This Article 
 Bibliographic References 
 Add to: 
Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures
April 2006 (vol. 28 no. 4)
pp. 643-649
In previous work on point matching, a set of points is often treated as an instance of a joint distribution to exploit global relationships in the point set. For nonrigid shapes, however, the local relationship among neighboring points is stronger and more stable than the global one. In this paper, we introduce the notion of a neighborhood structure for the general point matching problem. We formulate point matching as an optimization problem to preserve local neighborhood structures during matching. Our approach has a simple graph matching interpretation, where each point is a node in the graph, and two nodes are connected by an edge if they are neighbors. The optimal match between two graphs is the one that maximizes the number of matched edges. Existing techniques are leveraged to search for an optimal solution with the shape context distance used to initialize the graph matching, followed by relaxation labeling updates for refinement. Extensive experiments show the robustness of our approach under deformation, noise in point locations, outliers, occlusion, and rotation. It outperforms the shape context and TPS-RPM algorithms on most scenarios.

[1] L.G. Brown, “A Survey of Image Registration Techniques,” ACM Computing Survey, vol. 24, no. 4, pp. 325-376, 1992.
[2] H. Chui and A. Rangarajan, “A New Point Matching Algorithm for Non-Rigid Registration,” Computer Vision and Image Understanding, vol. 89, nos. 2-3, pp. 114-141, 2003.
[3] P.J. Besl and N.D. McKay, “A Method for Registration of 3-D Shapes,” IEEE Trans. Pattern Analysis and Machine Inteligence, vol. 14, no. 2, pp. 239-256, Feb. 1992.
[4] 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.
[5] T.B. Sebastian, P.N. Klein, and B.B. Kimia, “On Aligning Curves,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 1, pp. 116-124, Jan. 2003.
[6] I. Biederman, “Recognition by Components: A Theory of Human Image Understanding,” Psychological Rev., vol. 94, no. 2, pp. 115-147, 1987.
[7] D.J. Field, A. Hayes, and R.E. Hess, “Contour Integration by the Human Visual System: Evidence for a Local ‘Association Field,’” Vision Research, vol. 33, no. 2, pp. 173-193, 1993.
[8] S. Gold and A. Rangarajan, “A Graduated Assignment Algorithm for Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377-388, Apr. 1996.
[9] 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, 1976.
[10] Y. Zheng and D. Doermann, “Robust Point Matching for Non-Rigid Shapes: A Relaxation Labeling Based Approach,” Technical Report, LAMP-TR-117, Univ. of Maryland, College Park, 2004.
[11] M. Pelillo, “The Dynamics of Nonlinear Relaxation Labeling Processes,” J. Math. Imaging and Vision, vol. 7, no. 4, pp. 309-323, 1997.
[12] 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, 1983.
[13] J. Ton and A.K. Jain, “Registering Landsat Images by Point Matching,” IEEE Trans. Geoscience and Remote Sensing, vol. 27, no. 5, pp. 642-651, 1989.
[14] M. Pelillo, “Replicator Equations, Maximal Cliques, and Graph Isomorphism,” Neural Computation, vol. 11, no. 8, pp. 1933-1955, 1999.
[15] G.K. Kanji, 100 Statistical Tests. Sage Publications, 1999.

Index Terms:
Point matching, shape matching, image registration, nonrigid shapes, relaxation labeling.
Yefeng Zheng, David Doermann, "Robust Point Matching for Nonrigid Shapes by Preserving Local Neighborhood Structures," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 4, pp. 643-649, April 2006, doi:10.1109/TPAMI.2006.81
Usage of this product signifies your acceptance of the Terms of Use.