By Topic

Fast SIFT algorithm based on Sobel edge detector

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

5 Author(s)
Yang Li ; Inst. of Inf. & Commun. Eng., Zhejiang Univ., Hangzhou, China ; Lingshan Liu ; Lianghao Wang ; Dongxiao Li
more authors

The SIFT (Scale Invariant Feature Transform) algorithm is an approach for extracting distinctive invariant features from images. It is widely used in image matching. Since SIFT detector detects the extreme points through the whole scale space, it often selects keypoints that have no value and reduces the efficiency of the algorithm. This paper proposes a fast SIFT algorithm based on Sobel edge detector. Sobel edge detector is applied to generate an edge group scale space and SIFT detector detects the extreme point under the constraint of the edge group scale space. The experimental results show that the proposed algorithm decreases the redundancy of keypoints and speeds up the implementation while the matching rate between different images maintains at a high level. As the threshold of Sobel detector increases, number of keypoints decreases and matching rate gets higher.

Published in:

Consumer Electronics, Communications and Networks (CECNet), 2012 2nd International Conference on

Date of Conference:

21-23 April 2012