Cart (Loading....) | Create Account
Close category search window
 

An Advanced Harris-Laplace Feature Detector with High Repeatability

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

6 Author(s)
Jieyu Zhang ; Dept. of Comput. Sci. & Technol., Nanjing Univ. of Sci. & Technol., Nanjing, China ; Qiang Chen ; Xiaojing Bai ; Quansen Sun
more authors

An advanced Harris-Laplace is proposed to remove the redundant points detected by original Harris-Laplace. In this novel method, all points detected at each scale are tracked and grouped beginning with the largest scale in the scale-space to make each group represent one local structure firstly. Then the point in each group which simultaneously leads to the maxima of corner points measuring and scale normalization Laplace function is selected. Finally, these points are described and matched by scale invariant feature transform (SIFT) descriptor successfully. Experimental results indicate that the proposed method has higher repeatability than original Harris-Laplace.

Published in:

Image and Signal Processing, 2009. CISP '09. 2nd International Congress on

Date of Conference:

17-19 Oct. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.