Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ranicki, A.: Algebraic l-theory and topological manifolds. Cambridge University Press, Cambridge (1992)
Chung, F.R.K.: Spectral graph theory. CBMS series 92 (1997)
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)
Hjaltason, G.R., Samet, H.: Properties of embedding methods for similarity searching in metric spaces. PAMI 25, 530–549 (2003)
Busemann, H.: The geometry of geodesics. Academic Press, London (1955)
Tenenbaum, J.B., Silva, V.D., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 586–591 (2000)
Shapiro, L.S., Brady, J.M.: Feature-based correspondence: an eigenvector approach. Image and Vision Computing 10, 283–288 (1992)
Luo, B., Hancock, E.R.: Structural graph matching using the em algorithm and singular value decomposition. IEEE PAMI 23, 1120–1136 (2001)
Gold, S., Rangarajan, A.: A graduated assignment algorithm for graph matching. IEEE PAMIÂ 18 (1996)
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)
Umeyama, S.: An eigen decomposition approach to weighted graph matching problems. IEEE PAMI 10, 695–703 (1988)
Ullman, J.R.: An algorithm for subgraph isomorphism. J. ACM 23, 31–42 (1976)
Christmas, W., Kittler, J., Petrou, M.: Structural matching in computer vision using probabilistic relaxation. IEEE PAMIÂ 17 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xiao, B., Yu, H., Hancock, E. (2004). Graph Matching Using Manifold Embedding. In: Campilho, A., Kamel, M. (eds) Image Analysis and Recognition. ICIAR 2004. Lecture Notes in Computer Science, vol 3211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30125-7_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-30125-7_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23223-0
Online ISBN: 978-3-540-30125-7
eBook Packages: Springer Book Archive