By Topic

An improved scale invariant feature transform algorithm based on rounded projection

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
$31 $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

3 Author(s)
Yincheng Liang ; Sch. of Inf. & Electr. Eng., Ludong Univ., Yantai, China ; Chanjuan Liu ; Hailin Zou

The scale-invariant feature transform algorithm proposed by Lowe has a low efficiency which can not meet the need of real-time. The algorithm based on rounded projection proposed in our paper applies Fast Fourier Transform algorithm (FFT) on the projection local area to compute the first harmonic components which are used to prescreen the feature points that extracted by SIFT algorithm. We carry on the image to match according to the prescreened feature points to calculate the local area descriptors. The experiments show that new algorithm has a less number of feature points than the original, so it improves the efficiency and has a better performance.

Published in:

Computer Science and Network Technology (ICCSNT), 2011 International Conference on  (Volume:4 )

Date of Conference:

24-26 Dec. 2011