By Topic

A fast corner matching algorithm based on circular region features

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

2 Author(s)
Zhang Huanghui ; Key Lab. of Complex Syst. & Intell. Sci., Chinese Acad. of Sci., Beijing, China ; Xu De

A fast corner matching algorithm based on circular region features is proposed. For each corner, the features are the gray values of the pixels in a certain radius of circle around the corner. After the translation registration of the features, the normalized cross correlation coefficient is calculated to match the corners. Then, the bidirectional consistency constraint, the gray values constraint and the clustering constraint of difference in position are applied to the matching corners in turn, which are used to eliminate the mismatching corners, in order to improve the accuracy of the corner matching. Experimental results on a mobile robot verify the effectiveness of the proposed algorithm.

Published in:

Control Conference (CCC), 2011 30th Chinese

Date of Conference:

22-24 July 2011