This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Graphical Models and Point Pattern Matching
October 2006 (vol. 28 no. 10)
pp. 1646-1663
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We present a noniterative, polynomial time algorithm that is guaranteed to find an optimal solution for the noiseless case. First, we model point pattern matching as a weighted graph matching problem, where weights correspond to Euclidean distances between nodes. We then formulate graph matching as a problem of finding a maximum probability configuration in a graphical model. By using graph rigidity arguments, we prove that a sparse graphical model yields equivalent results to the fully connected model in the noiseless case. This allows us to obtain an algorithm that runs in polynomial time and is provably optimal for exact matching between noiseless point sets. For inexact matching, we can still apply the same algorithm to find approximately optimal solutions. Experimental results obtained by our approach show improvements in accuracy over current methods, particularly when matching patterns of different sizes.

[1] T.S. Caetano, T. Caelli, and D.A.C. Barone, “An Optimal Probabilistic Graphical Model for Point Set Matching,” Proc. Joint Int'l Workshops Syntactical and Structural Pattern Recognition and Statistical Pattern Recognition (SSPR & SPR), pp. 162-170, 2004.
[2] T.S. Caetano, “Graphical Models and Point Set Matching,” PhD dissertation, Universidade Federal do Rio Grande do Sul (UFRGS), 2004.
[3] R. Myers, R.C. Wilson, and E.R. Hancock, “Bayesian Graph Edit Distance,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 6, pp. 628-635, June 1999.
[4] M. Carcassoni and E.R. Hancock, “Spectral Correspondence for Point Pattern Matching,” Pattern Recognition, vol. 36, pp. 193-204, 2003.
[5] H. Wang and E.R. Hancock, “A Kernel View of Spectral Point Pattern Matching,” Proc. Joint Int'l Workshops Syntactical and Structural Pattern Recognition and Statistical Pattern Recognition (SSPR & SPR), pp. 361-369, 2004.
[6] M.T. Goodrich and J.S.B. Mitchell, “Approximate Geometric Pattern Matching under Rigid Motions,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 4, pp. 371-379, 1999.
[7] F. Murtagh, “A New Approach to Point-Pattern Matching,” Astronomical Soc. Pacific, vol. 104, no. 674, pp. 301-307, 1992.
[8] G. Weber, L. Knipping, and H. Alt, “An Application of Point Pattern Matching in Astronautics,” J. Symbolic Computation, no. 11, pp. 1-20, 1994.
[9] Y. Martin, M. Bures, E. Danaher, J. Delazzer, and I. Lico, “A Fast New Approach to Pharmacophore Mapping and Its Application to Dopaminergic and Bezodiazepine Agonists,” J. Computer-Aided Molecular Design, vol. 7, pp. 83-102, 1993.
[10] P.W. Finn, L.E. Kavraki, J.-C. Latombe, R. Motwani, C. Shelton, S. Venkatasubramanian, and A. Yao, “Rapid: Randomized Pharmacophore Identification for Drug Design,” Computational Geometry, vol. 10, pp. 263-272, 1998.
[11] T. Akutsu, K. Kanaya, A. Ohyama, and A. Fujiyama, “Point Matching under Non-Uniform Distortions,” Discrete Applied Math., special issue: computational biology series IV, pp. 5-21, 2003.
[12] R. Nussinov and H.J. Wolfson, “Efficient Detection of Three-Dimensional Structural Motifs in Biological Macromolecules by Computer Vision Techniques,” Proc. Nat'l Academy Sciences, vol. 88, pp. 10,495-10,499, 1991.
[13] 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.
[14] T.S. Caetano, T. Caelli, and D.A.C. Barone, “Graphical Models for Graph Matching,” Proc. IEEE Int'l Conf. Computer Vision and Pattern Recognition, pp. 466-473, 2004.
[15] Y. Keselman, A. Shokoufandeh, M.F. Demirci, and S. Dickinson, “Many-to-Many Graph Matching via Metric Embedding,” Proc. Int'l Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 18-20, 2003.
[16] M. Demirci, A. Shokoufandeh, S. Dickinson, Y. Keselman, and L. Bretzner, “Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs,” Proc. European Conf. Computer Vision, pp. 322-335, 2004.
[17] J. Ullman, “An Algorithm for Subgraph Isomorphism,” J. ACM, vol. 23, no. 1, pp. 31-42, 1976.
[18] B.T. Messmer and H. Bunke, “A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 20, no. 5, pp. 493-503, May 1998.
[19] S. Berreti, A.D. Bimbo, and E. Vicario, “Efficient Matching and Indexing of Graph Models in Content-Based Retrieval,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 1089-1105, Oct. 2001.
[20] K.S. Fu, “A Step Towards Unification of Syntactic and Statistical Pattern Recognition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, no. 2, pp. 200-205, 1983.
[21] M. Eshera and K. Fu, “A Graph Distance Measure for Image Analysis,” IEEE Trans. Systems, Man, and Cybernetics, vol. 14, no. 3, pp. 353-363, 1984.
[22] W.H. Tsai and K.S. Fu, “Subgraph Error-Correcting Isomorphisms for Syntactic Pattern Recognition,” IEEE Trans. Systems, Man, and Cybernetics, vol. 13, no. 1, pp. 48-62, 1983.
[23] K.L. Boyer and A.C. Kak, “Structural Stereopsis for 3-D Vision,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 2, pp. 144-166, Mar. 1988.
[24] B. Bhanu and O.D. Faugeras, “Shape Matching of Two-Dimensional Objects,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 2, pp. 137-156, 1984.
[25] L.S. Davis, “Shape Matching Using Relaxation Techniques,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 1, no. 1, pp. 60-72, 1979.
[26] O.D. Faugeras and M. Berthod, “Improving Consistency and Reducing Ambiguity in Stochastic Labeling: An Optimization Approach,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 3, pp. 412-423, 1981.
[27] S. Ulmann, “Relaxation and Constraint Optimization by Local Process,” Computer Graphics and Image Processing, vol. 10, pp. 115-195, 1979.
[28] A. Rosenfeld and A.C. Kak, Digital Picture Processing. New York: Academic Press, 1982.
[29] W.J. 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. 1994.
[30] S.Z. Li, “A Markov Random Field Model for Object Matching under Contextual Constraints,” Proc. Int'l Conf. Computer Vision and Pattern Recognition, pp. 866-869, 1994.
[31] R.A. Hummel and S.W. Zucker, “On the Foundations of Relaxations Labeling Process,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 5, no. 3, pp. 267-286, 1983.
[32] A. Rosenfeld, R. Hummel, and S. Zucker, “Scene Labeling by Relaxation Operations,” IEEE Trans. Systems, Man, and Cybernetics, vol. 6, pp. 420-433, 1976.
[33] 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.
[34] E. Hancock and R.C. Wilson, “Graph-Based Methods for Vision: A Yorkist Manifesto,” Proc. Joint Int'l Workshops Syntactical and Structural Pattern Recognition and Statistical Pattern Recognition (SSPR & SPR), pp. 31-46, 2002.
[35] J.V. Kittler and E.R. Hancock, “Combining Evidence in Probabilistic Relaxation,” Int'l J. Pattern Recognition and Artificial Intelligence, vol. 3, pp. 29-51, 1989.
[36] S. Umeyama, “An Eigen Decomposition Approach to Weighted Graph Matching Problems,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, pp. 695-703, 1998.
[37] L. Shapiro and J. Brady, “Feature-Based Correspondence— An Eigenvector Approach,” Image and Vision Computing, vol. 10, pp. 283-288, 1992.
[38] B.J. van Wyk and M.A. van Wyk, “Kronecker Product Graph Matching,” Pattern Recognition, vol. 36, no. 9, pp. 2019-2030, 2003.
[39] M.A. van Wyk, T.S. Durrani, and B.J. van Wyk, “A RKHS Interpolator-Based Graph Matching Algorithm,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 24, no. 7, pp. 988-995, July 2002.
[40] A. Robles-Kelly and E.R. Hancock, “Graph Edit Distance From Spectral Seriation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 27, no. 3, pp. 365-378, Mar. 2005.
[41] P.N. Suganthan, “Structural Pattern Recognition Using Genetic Algorithms,” Pattern Recognition, vol. 35, pp. 1883-1893, 2002.
[42] M. Pelillo, “Replicator Equations, Maximal Cliques, and Graph Isomorphism,” Neural Computing vol. 11, pp. 1933-1955, 1999.
[43] M. Pelillo, K. Siddiqi, and S. Zucker, “Matching Hierarchical Structures Using Association Graphs,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 11, pp. 1105-1120, Nov. 1999.
[44] D. Conte, P. Foggia, C. Sansone, and M. Vento, “Thirty Years of Graph Matching in Pattern Recognition,” Int'l J. Pattern Recognition and Artificial Intelligence, special edition on graph theory in vision, vol. 18, no. 3, pp. 265-298, 2004.
[45] T. Caelli and T. Caetano, “Graphical Models for Graph Matching: Approximate Models and Optimal Algorithms,” Pattern Recognition Letters, vol. 26, pp. 339-346, 2005.
[46] R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision. Cambridge, U.K.: Cambridge Univ. Press, 2000.
[47] J. Mejía, T. Villela, and J. Braga, “The CCD Stellar Sensor of the Masco Telescope Pointing System,” Advances in Space Research, vol. 26, no. 9, pp. 1407-1410, 2000.
[48] P.J. de Rezende and D.T. Lee, “Point Set Pattern Matching in D-Dimensions,” Algorithmica, vol. 13, pp. 387-404, 1995.
[49] H. Chui and A. Rangarajan, “A New Algorithm for Non-Rigid Point Matching,” Proc. Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 44-51, 2000.
[50] A. Rangarajan, A. Yuille, and E. Mjolsness, “Convergence Properties of the Softassign Quadratic Assignment Algorithm,” Neural Computation, vol. 11, pp. 1455-1474, 1999.
[51] R. Sinkhorn, “A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices,” Ann. Math. Statistics, vol. 35, pp. 876-879, 1964.
[52] T. Caelli and S. Kosinov, “An Eigenspace Projection Clustering Method for Inexact Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 4, pp. 515-519, Apr. 2004.
[53] A. Robles-Kelly and E.R. Hancock, “String Edit Distance, Random Walks and Graph Matching,” Int'l J. Pattern Recognition and Artificial Intelligence, vol. 18, no. 3, pp. 315-327, 2004.
[54] S.L. Lauritzen, Graphical Models. New York, NY: Oxford Univ. Press, 1996.
[55] J. Dattorro, “Euclidean Distance Matrices,” PhD dissertation, Stanford Univ., 2005.
[56] H.-X. Huang, Z.-A. Liang, and P.M. Pardalos, “Some Properties of the Euclidean Distance Matrix and Positive Semidefinite Matrix Completion Problems,” J. Global Optimization, vol. 25, pp. 3-21, 2003.
[57] M.J. Wainwright, “Stochastic Processes on Graphs with Cycles: Geometric and Variational Approaches,” PhD dissertation, Dept. of Electrical Eng. and Computer Science, Massachusetts Inst. of Tech nology, 2002.
[58] M.J. Wainwright and M.I. Jordan, “A Variational Principle for Graphical Models,” New Directions in Statistical Signal Processing: From Systems to Brains. MIT Press, 2006.
[59] M.I. Jordan, “An Introduction to Probabilistic Graphical Models,” in preparation.
[60] M.I. Jordan, “Graphical Models,” Statistical Science, vol. 19, no. 1, pp. 140-155, 2004.
[61] S. Geman and D. Geman, “Stochastic Relaxation, Gibbs Distribution and the Bayesian Restoration of Images,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 721-741, 1984.
[62] T.S. Caetano, T. Caelli, and D.A.C. Barone, “A Comparison of Junction Tree and Relaxation Algorithms for Point Matching Using Different Distance Metrics,” Proc. IEEE Int'l Conf. Pattern Recognition, vol. 2, pp. 124-127, 2004.
[63] R. Connelly, “Rigidity and Energy,” Inventiones Mathemticae, vol. 66, no. 1, pp. 11-33, 1982.
[64] D.B. West, Introduction to Graph Theory. Upper Saddle River, N.J.: Prentice Hall, 2001.
[65] L.R. Rabiner, “A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition,” Proc. IEEE, vol. 77, no. 2, pp. 257-286, 1989.

Index Terms:
Point pattern matching, graph matching, graphical models, Markov random fields, junction tree algorithm.
Citation:
Tib?rio S. Caetano, Terry Caelli, Dale Schuurmans, Dante A.C. Barone, "Graphical Models and Point Pattern Matching," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 10, pp. 1646-1663, Oct. 2006, doi:10.1109/TPAMI.2006.207
Usage of this product signifies your acceptance of the Terms of Use.