An Optimal Probabilistic Graphical Model for Point Set Matching

  • Tibério S. Caetano
  • Terry Caelli
  • Dante A. C. Barone
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3138)


We present a probabilistic graphical model for point set matching. By using a result about the redundancy of the pairwise distances in a point set, we represent the binary relations over a simple triangulated graph that retains the same informational content as the complete graph. The maximal clique size of this resultant graph is independent of the point set sizes, what enables us to perform exact inference in polynomial time with a Junction Tree algorithm. The resulting technique is optimal in the Maximum a Posteriori sense. Experiments show that the algorithm significantly outperforms standard probabilistic relaxation labeling.


Markov Random Field Maximal Clique Domain Pattern Probabilistic Graphical Model Junction Tree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Carcassoni, M., Hancock, E.R.: Spectral correspondence for point pattern matching. Pattern Recognition 36, 193–204 (2003)zbMATHCrossRefGoogle Scholar
  2. 2.
    Luo, B., Hancock, E.R.: Structural Graph Matching using the EM Algorithm and Singular Value Decomposition. IEEE Trans. PAMI 23(10), 1120–1136 (2001)Google Scholar
  3. 3.
    Akutsu, T., Kanaya, K., Ohyama, A., Fujiyama, A.: Point matching under nonuniform distortions. Discrete Applied Mathematics 127, 5–21 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Reimann, D., Haken, H.: Stereo Vision by Self-Organization. Biological Cybernetics 74(1), 17–21 (1994)CrossRefGoogle Scholar
  5. 5.
    Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Trans. PAMI 18(4), 377–388 (1996)Google Scholar
  6. 6.
    Lauritzen, S.L.: Graphical Models. Oxford University Press, New York (1996)Google Scholar
  7. 7.
    Jordan, M.I.: An Introduction to Probabilistic Graphical Models (in preparation)Google Scholar
  8. 8.
    Christmas, W.J., Kittler, J., Petrou, M.: Structural Matching in Computer Vision Using Probabilistic Relaxation. IEEE Trans. PAMI 17(8), 749–764 (1995)Google Scholar
  9. 9.
    Rosenfeld, A., Kak, A.C.: Digital Picture Processing, vol. 1. Academic Press, New York (1982)Google Scholar
  10. 10.
    Geman, S., Geman, D.: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images. IEEE Trans. PAMI 6(6), 721–741 (1984)zbMATHGoogle Scholar
  11. 11.
    de Rezende, P.J., Lee, D.T.: Point Set Pattern Matching in d-dimensions. Algorithmica 13, 387–404 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Connelly, R.: Generic Global Rigidity. Preprint privately providedGoogle Scholar
  13. 13.
    Jackson, B., Jordán, T.: Connected Rigidity Matroids and Unique Realizations of Graphs,
  14. 14.
    West, D.B.: Introduction to Graph Theory, 2nd edn., Upper Saddle River, NJ. Prentice Hall, Englewood Cliffs (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Tibério S. Caetano
    • 1
    • 2
  • Terry Caelli
    • 1
  • Dante A. C. Barone
    • 2
  1. 1.Department of Computing ScienceUniversity of AlbertaEdmontonCanada
  2. 2.Instituto de InformáticaUnivesidade Federal do Rio Grande do SulPorto AlegreBrazil

Personalised recommendations