Graph Matching Using Manifold Embedding

  • Bai Xiao
  • Hang Yu
  • Edwin Hancock
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3211)


This paper describes how graph-spectral methods can be used to transform the node correspondence problem into one of point-set alignment. We commence by using a heat kernel analysis to compute geodesic distances between nodes in the graphs. With geodesic distances to hand, we use the ISOMAP algorithm to embed the nodes of a graph in a low-dimensional Euclidean space. With the nodes in the graph transformed to points in a metric space, we can recast the problem of graph-matching into that of aligning the points. Here we use a variant of the Scott and Longuet-Higgins algorithm to find point correspondences. We experiment with the resulting algorithm on a number of real-world problems.


Heat Kernel Geodesic Distance Graph Match Spectral Graph Theory Embed Point 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ranicki, A.: Algebraic l-theory and topological manifolds. Cambridge University Press, Cambridge (1992)zbMATHGoogle Scholar
  2. 2.
    Chung, F.R.K.: Spectral graph theory. CBMS series 92 (1997)Google Scholar
  3. 3.
    Scott, G.L., Longuett-Higgins, H.C.: An algorithm for associating the features of two images. Proceedings of the Royal Society of London B 244, 21–26 (1991)CrossRefGoogle Scholar
  4. 4.
    Hjaltason, G.R., Samet, H.: Properties of embedding methods for similarity searching in metric spaces. PAMI 25, 530–549 (2003)Google Scholar
  5. 5.
    Busemann, H.: The geometry of geodesics. Academic Press, London (1955)zbMATHGoogle Scholar
  6. 6.
    Tenenbaum, J.B., Silva, V.D., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 586–591 (2000)CrossRefGoogle Scholar
  7. 7.
    Shapiro, L.S., Brady, J.M.: Feature-based correspondence: an eigenvector approach. Image and Vision Computing 10, 283–288 (1992)CrossRefGoogle Scholar
  8. 8.
    Luo, B., Hancock, E.R.: Structural graph matching using the em algorithm and singular value decomposition. IEEE PAMI 23, 1120–1136 (2001)Google Scholar
  9. 9.
    Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE PAMI 18 (1996)Google Scholar
  10. 10.
    Kosinov, S., Caelli, T.: Inexact multisubgraph matching using graph eigenspace and clustering models. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol. 2396, pp. 133–142. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Umeyama, S.: An eigen decomposition approach to weighted graph matching problems. IEEE PAMI 10, 695–703 (1988)zbMATHGoogle Scholar
  12. 12.
    Ullman, J.R.: An algorithm for subgraph isomorphism. J. ACM 23, 31–42 (1976)zbMATHCrossRefGoogle Scholar
  13. 13.
    Christmas, W., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation. IEEE PAMI 17 (1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Bai Xiao
    • 1
  • Hang Yu
    • 1
  • Edwin Hancock
    • 1
  1. 1.Department of Computer ScienceUniversity of YorkYorkUK

Personalised recommendations