By Topic

A Fast SIFT Feature Matching Algorithm for Image Registration

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kun Li ; Coll. of Comput. Sci., Chongqing Univ., Chongqing, China ; Shangbo Zhou

In this paper, a novel fast SIFT (Scale Invariant Feature Transform) feature matching algorithm for image registration is presented. Firstly, for fast SIFT feature matching, we propose a method to optimize the priority k-d tree search algorithm by choosing a proper number of leaf nodes examined (denoted as Emax) in a single k-d tree. In order to get the relationships among the number of SIFT features, Emax and the precisions achieved by the priority k-d tree search algorithm in a single k-d tree, the properties of a single k-d tree and that of the priority k-d tree search algorithm are combined. Referring to these relationships, a proper value of Emax can be selected to achieve an approximate precision in fast time. And then, in image registration, in order to improve matching precision, we have designed the bidirectional priority k-d tree search algorithm in this paper. I. e. the priority k-d tree search algorithm is used twice.

Published in:

Multimedia and Signal Processing (CMSP), 2011 International Conference on  (Volume:1 )

Date of Conference:

14-15 May 2011