Graph matching using spectral embedding and alignment

Proceedings - International Conference on Pattern Recognition

Volumn 3, Issue , 2004, Pages 398-401

  Bai, Xiao ^a   Yu, Hang ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EUCLIDEAN SPACE; GRAPH MATCHING; SPECTRAL METHODS;

ALGORITHMS; GRAPH THEORY; MATRIX ALGEBRA; OPTIMIZATION; VECTORS;

PATTERN RECOGNITION;

EID: 10044247255     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPR.2004.1334550     Document Type: Conference Paper

References (18)

1. A.Ranicki. Algebraic 1-theory and topological manifolds. Cambridge University Press, 1992.
2. A.Shokoufandeh, S.Dickinson, K.Siddiqi, and S.Zucker. Indexing using a spectral encoding of topological structure. IEEE Conf. on Computer Vision and Pattern Recognition, pages 491-497, 1999.
3. F.R.K.Chung. Spectral graph theory. CBMS series, 92, 1997.
4. G.L.Scott and H.C.Longuett-Higgins. An algorithm for associating the features of two images. Proceedings of the Royal Society of London B, 244:21-26, 1991.
5. G.R.Hjaltason and H.Samet. Properties of embedding methods for similarity searching in metric spaces. PAMI, 25:530-549, 2003.
6. H.Busemann. The geometry of geodesies. Academic Press, 1955.
7. J.B.Tenenbaum, V.D.Silva, and J.C.Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:586-591, 2000.
8. L.S.Shapiro and J.M.Brady. Feature-based correspondence: an eigenvector approach. Image and Vision Computing, 10:283-288, 1992.
9. B. Luo, A.D.J.Cross, and E. Hancock. The independent and principal component of graph spectra. ICPV, pages 164-167, 2002.
10. B. Luo and E. Hancock. Structural graph matching using the em algorithm and singular value decomposition. IEEE PAMI, 23:1120-1136, 2001.
11. M.Belkin and P.Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15, 2000.
12. N.Linial, E.London, and Y.Rabinovich. The geometry of graphs and some its algorithmic application. Combinatorica, 15:215-245, 1995.
13. S.Gold and A.Rangarajan. A graduated assignment algorithm for graph matching. IEEE PAMI, 18, 1996.
14. S.Kosinov and T. Caelli. Inexact multisubgraph matching using graph eigenspace and clustering models. 9th International Workshop on Structural and Syntactic Pattern, LNCS 2396:133-142, 2002.
15. S.Umeyama. An eigen decomposition approach to weighted graph matching problems. IEEE PAMI, 10:695-703, 1988.
16. C. T. and C. M. Multidimensional scaling. Chapman and Hall, 1994.
17. J. Ullman. An algorithm for subgraph isomorphism. J.ACM, 23:31-42, 1976.
18. W.Christmas, J.Kittler, and M.Petrou. Structural matching in computer vision using probabilistic relaxation. IEEE PAMI, 17, 1995.