Correspondence Matching with Modal Clusters
|
Abstract—The modal correspondence method of Shapiro and Brady aims to match point-sets by comparing the eigenvectors of a pairwise point proximity matrix. Although elegant by means of its matrix representation, the method is notoriously susceptible to differences in the relational structure of the point-sets under consideration. In this paper, we demonstrate how the method can be rendered robust to structural differences by adopting a hierarchical approach. To do this, we place the modal matching problem in a probabilistic setting in which the correspondences between pairwise clusters can be used to constrain the individual point correspondences. We demonstrate the utility of the method on a number of synthetic and real-world point-pattern matching problems.
[1] 1609 M. Carcassoni and E.R. Hancock, Spectral Correspondence for Point Pattern Matching Pattern Recognition, vol. 36, no. 1, pp. 193-204, 2003.
[2] H. Chui and A. Rangarajan, Non-Rigid Point Matching Using Mixture Models Proc. Workshop Math. Methods in Biomedical Image Analysis, pp. 190-197, 2000.
[3] F.R.K. Chung, Spectral Graph Theory, CBMS series, AMS ed. vol. 92, 1997.
[4] T.F. Cootes, C.J. Taylor, D.H. Cooper, and J. Graham, "Active Shape Models—Their Training and Application," Computer Vision and Image Understanding, vol. 61, no. 1, pp. 38-59, Jan. 1995.
[5] A.D.J. Cross and E.R. Hancock, Graph Matching with Dual Step Em Algorithm IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, pp. 1236-1253, 1998.
[6] 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.
[7] P.J. Green, Bayesian Reconstruction from Emission Tomography Data Using a Modified Em Algorithm IEEE Trans. Medical Imaging, vol. 9, pp. 84-93, 1990.
[8] B. Luo, A.D.J. Cross, and E.R. Hancock, Corner Detection via Topographic Analysis of Vector-Potential Pattern Recognition Letters, pp. 635-650, 1999.
[9] B. Luo and E.R. Hancock, Structural Matching Using the Em Algorithm and Singular Value Decomposition IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, pp. 1120-1136, 2001.
[10] F. Mokhtarian and R. Suomela, Robust Image Corner Detection through Curvature Scale Space IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 12, pp. 1376-1381, Dec. 1998.
[11] M. Pelillo, K. Siddiqi, and S.W. Zucker, “Matching Hierarchical Structures Using Association Graphs,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 11, pp. 1105-1120, 1999.
[12] M. Pilu, A Direct Method for Stereo Correspondence Based on Singular Value Decomposition Proc. IEEE Computer Vision and Pattern Recognition Conf., pp. 261-266, 1997.
[13] S. Sclaroff and A.P. Pentland, Modal Matching for Correspondence and Recognition IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 6, pp. 545-561, 1995.
[14] G.L. Scott and H.C. Longuett-Higgins, An Algorithm for Associating the Features of Two Images Proc. Royal Soc. London B, vol. 244, pp. 21-26, 1991.
[15] L.S. Shapiro and J.M. Brady, “Feature-Based Correspondence: An Eigenvector Approach,” Image and Vision Computing, vol. 10, pp. 283-288, 1992.
[16] A. Shokoufandeh, S.J. Dickinson, K. Siddiqi, and S.W. Zucker, “Indexing Using Spectral Encoding of Topological Structure,” Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, June 1999.
[17] H. Sossa and R. Horaud, Model Indexing: The Graph-Hashing Approach Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 811-815, 1992.
[18] C. Tomasi and T. Kanade, "Shape and Motion From Image Streams Under Orthography: A Factorization Method," Int'l J. Computer Vision, vol. 9, no. 2, pp. 137-154, 1992.
[19] S. Umeyama, “An Eigendecomposition Approach to Weighted Graph Matching Problems,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695-703, Sept. 1988.
[20] R.C. Wilson, A.D.J. Cross, and E.R. Hancock, Structural Matching with Active Triangulation Proc. Computer Vision and Image Understanding, vol. 72, no. 1, pp. 21-38, Oct. 1998.
[21] R.C. Wilson and E.R. Hancock, “Structural Matching by Discrete Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 6, pp. 634-648, June 1997.
Index Terms:
Point-pattern matching, spectral graph theory, robust statistics, hierarchy.
Citation:
Marco Carcassoni, Edwin R. Hancock, "Correspondence Matching with Modal Clusters," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 12, pp. 1609-1615, Dec. 2003, doi:10.1109/TPAMI.2003.1251153
PURCHASE ARTICLE: $19
IEEE Xplore Subscribers
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb