This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Topology Preserving Relaxation Labeling for Nonrigid Point Matching
February 2011 (vol. 33 no. 2)
pp. 427-432
ASCII Text
x 
 
Jong-Ha Lee, Chang-Hee Won, "Topology Preserving Relaxation Labeling for Nonrigid Point Matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 2, pp. 427-432, February, 2011.
 
 
BibTex
x
 
@article{ 10.1109/TPAMI.2010.179,
author = {Jong-Ha Lee and Chang-Hee Won},
title = {Topology Preserving Relaxation Labeling for Nonrigid Point Matching},
journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence},
volume = {33},
number = {2},
issn = {0162-8828},
year = {2011},
pages = {427-432},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2010.179},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Pattern Analysis and Machine Intelligence
TI - Topology Preserving Relaxation Labeling for Nonrigid Point Matching
IS - 2
SN - 0162-8828
SP427
EP432
EPD - 427-432
A1 - Jong-Ha Lee,
A1 - Chang-Hee Won,
PY - 2011
KW - Point pattern matching
KW - graph matching
KW - registration
KW - relaxation labeling
KW - nonrigid point matching.
VL - 33
JA - IEEE Transactions on Pattern Analysis and Machine Intelligence
ER -
 
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.

[1] L.G. Brown, "A Survey of Image Registration Techniques," ACM Computing Surveys, vol. 24, no. 4, pp. 325-376, Dec. 1992.
[2] H.J. Johnson and G.E. Christensen, "Consistent Landmark and Intensity-Based Image Registration," IEEE Trans. Medical Imaging, vol. 21, no. 5, pp. 450-461, May 2002.
[3] B. Zitova and J. Flusser, "Image Registration Methods: A Survey," Image and Vision Computing, vol. 21, no. 11, pp. 977-1000, 2003.
[4] A. Rangarajan, H. Chui, and F. Bookstein, "The Softassign Procrustes Matching Algorithm," Medical Image Analysis, vol. 4, pp. 1-17, 1999.
[5] P.J. Besl and N.D. Mckay, "A Method for Registration of 3D Shapes," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 14, no. 2, pp. 239-256, Feb. 1992.
[6] H. Chui and A. Rangarajan, "A New Point Matching Algorithm for Nonrigid Registration," Computer Vision and Image Understanding, vol. 89, no. 23, pp. 114-141, 2003.
[7] A. Rangarajan, S. Gold, and E. Mjolsness, "A Novel Optimizing Network Architecture with Applications," Neural Computing, vol. 8, no. 5, pp. 1041-1060, July 1996.
[8] A. Myronenko, X. Song, and M.A. Carreira-Perpinan, "Nonrigid Point Registration: Coherent Point Drift," Advances in Neural Information Processing Systems, vol. 19, pp. 1009-1016, Springer, 2007.
[9] S. Belongie, J. Malik, and J. Puzicha, "Shape Matching and Object Recognition Using Shape Contexts," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 4, pp. 509-522, Apr. 2002.
[10] Y. Zheng and D. Doermann, "Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 28, no. 4, pp. 643-649, Apr. 2006.
[11] Y. Tsin and T. Kanade, "A Correlation-Based Approach to Robust Point Set Registration," Proc. Eighth European Conf. Computer Vision, pp. 558-569, 2004.
[12] B. Jian and B. Vemuri, "A Robust Algorithm for Point Set Registration Using Mixture of Gaussians," Proc. 10th IEEE Int'l Conf. Computer Vision, pp. 1246-1251, 2005.
[13] A. Rosenfeld, R.A. Hummel, and S.W. Zucker, "Scene Labeling by Relaxation Operations," IEEE Trans. System, Man, and Cybernetics, vol. 6, no. 6, pp. 420-433, June 1976.
[14] R.A. Hummel and S.W. Zucker, "On the Foundations of Relaxation Labeling Processes," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, no. 3, pp. 267-287, May 1983.
[15] S. Peleg and A. Rosenfeld, "Determining Compatibility Coefficients for Curve Enhancement Relaxation Processes," IEEE Trans. System, Man, and Cybernetics, vol. 8, no. 7, pp. 548-555, July 1978.
[16] M. Pelillo and M. Refice, "Learning Compatibility Coefficients for Relaxation Labeling Processes," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 16, no. 9, pp. 933-945, Sept. 1994.
[17] F.L. Bookstein, "Principal Warps: Thin-Plate Splines and the Decomposition of Deformations," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 11, no. 6, pp. 567-585, June 1989.
[18] Q.X. Wu and D. Pairman, "A Relaxation Labeling Technique for Computing Sea Surface Velocities from Sea Surface Temperature," IEEE Trans. Geoscience and Remote Sending, vol. 33, no. 1, pp. 216-220, Jan. 1995.
[19] R. Sinkhorn, "A Relationship between Arbitrary Positive Matrices and Doubly Stochastic Matrices," The Annals of Math. Statistics, vol. 35, no. 2, pp. 876-879, 1964.
[20] K. Mikolajczyk and C. Schmid, "A Performance Evaluation of Local Descriptors," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 10, pp. 1615-1630, Oct. 2005.
[21] X.C. He and N.H.C. Yung, "Corner Detector Based on Global and Local Curvature Properties," Optical Eng., vol. 47, no. 5, p. 057008, 2008.
[22] M. Pelillo, "The Dynamics of Nonlinear Relaxation Labeling Processes," J. Math. Imaging and Vision, vol. 7, no. 4, pp. 309-323, Oct. 1997.
[23] R.C. Wilson and E.R. Hancock, "A Bayesian Compatibility Model for Graph Matching," Pattern Recognition Letters, vol. 17, no. 3, pp. 263-276, Mar. 1996.
[24] W. Christmas, J. Kittler, and M. Petrou, "Structural Matching in Computer Vision Using Probabilistic Relaxation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749-764, Aug. 1995.
[25] J. Kitter and E.R. Hancock, "Combining Evidence in Probabilistic Relaxation," Int'l J. Pattern Recognition and Artificial Intelligence, vol. 3, no. 1, pp. 25-51, Feb. 1989.

Index Terms:
Point pattern matching, graph matching, registration, relaxation labeling, nonrigid point matching.
Citation:
Jong-Ha Lee, Chang-Hee Won, "Topology Preserving Relaxation Labeling for Nonrigid Point Matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 2, pp. 427-432, Feb. 2011, doi:10.1109/TPAMI.2010.179
Usage of this product signifies your acceptance of the Terms of Use.