The Community for Technology Leaders
Green Image
Issue No. 02 - February (2011 vol. 33)
ISSN: 0162-8828
pp: 427-432
Jong-Ha Lee , Temple University, Philadelphia
Chang-Hee Won , Temple University, Philadelphia
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.
Point pattern matching, graph matching, registration, relaxation labeling, nonrigid point matching.

C. Won and J. Lee, "Topology Preserving Relaxation Labeling for Nonrigid Point Matching," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 33, no. , pp. 427-432, 2010.
88 ms
(Ver 3.3 (11022016))