Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Points matching via iterative convex hull vertices pairing

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)
Xiang-Yu Yu ; Signal Process. Lab, Sch. of Electron. Inf., Wuhan Univ., Hubei, China ; Hong Sun ; Jun Chen

Image registration is a fundamental task in image processing. In feature-based image registration, feature matching is the key but difficult step. In this paper, a point matching algorithm, which takes use of convex hull of point set and establishes correspondence between matched hull vertices, is proposed. Mapping parameters and point sets are updated after each step. After all points are processed, the current mapping parameter is the exact parameter between images. Experiment indicated that this method can match two point sets correctly with a little manual interference.

Published in:

Machine Learning and Cybernetics, 2005. Proceedings of 2005 International Conference on  (Volume:9 )

Date of Conference:

18-21 Aug. 2005