By Topic

Topology Preserving Relaxation Labeling for Nonrigid Point Matching

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
$33 $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)
Jong-Ha Lee ; Temple University, Philadelphia ; Chang-Hee Won

This paper presents a relaxation labeling process with the newly defined compatibility measure for solving a general nonrigid point matching problem. In the literature, there exists a point matching method using relaxation labeling; however, the compatibility coefficient takes a binary value of zero or one depending on whether a point and a neighbor have corresponding points. Our approach generalizes this relaxation labeling method. The compatibility coefficient takes n-discrete values which measure the correlation between point pairs. In order to improve the speed of the algorithm, we use a diagram of log distance and polar angle bins to compute the correlation. The extensive experiments show that the proposed topology preserving relaxation algorithm significantly improves the matching performance compared to other state-of-the-art point matching algorithms.

Published in:

IEEE Transactions on Pattern Analysis and Machine Intelligence  (Volume:33 ,  Issue: 2 )