Graph matching and clustering using spectral partitions

Pattern Recognition

Volumn 39, Issue 1, 2006, Pages 22-34

  Qiu, Huaijun ^a   Hancock, Edwin R ^a,b  

^a UNIVERSITY OF YORK   (United Kingdom)

^b Central Research Laboratory   (United Kingdom)

Author keywords

Fiedler vector; Graph partition; Graph simplification; Graph spectral clustering; Inexact graph matching

Indexed keywords

FIEDLER VECTOR; GRAPH PARTITION; GRAPH SIMPLIFICATION; GRAPH SPECTRAL CLUSTERING; INEXACT GRAPH MATCHING;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; HIERARCHICAL SYSTEMS; LAPLACE TRANSFORMS; MATRIX ALGEBRA; PROBLEM SOLVING;

PATTERN MATCHING;

EID: 27344438468     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2005.06.014     Document Type: Article

References (22)

1. B.W. Kernighan, S. Lin, An efficient heuristic procedure for partitioning graphs, Bell Syst. Tech. J. (1970) 291-307.
2. R.J. Wilson, J.J. Watkins, Graphs: An Introductory Approach: A First Course in Discrete Mathematics, Wiley International Edition. New York, etc., Wiley, 1990.
3. B.T. Messmer, and H. Bunke A new algorithm for error-tolerant subgraph isomorphism detection IEEE Pattern Anal. Mach. Intel. 20 1998 493 504
4. F.R.K. Chung, Spectral Graph Theory, CBMS Series, vol. 92, American Mathematical Society Providence, RI, 1997.
5. S. Umeyama An eigendecomposition approach to weighted graph matching problems IEEE Pattern Anal. Mach. Intel. 10 1988 695 703
6. L. Shapiro, and J. Brady Feature-based correspondence: an eigenvector approach Image Vision Comput. 10 2 1992 283 288
7. B. Luo, and E.R. Hancock Structural graph matching using the em algorithm and singular value decomposition IEEE Pattern Anal. Mach. Intel. 23 10 2001 1120 1136
8. R.C. Wilson, and E.R. Hancock Structural matching by discrete relaxation IEEE Pattern Anal. Mach. Intel. 19 6 1997 634 648
9. A. Shokoufandeh, S.J. Dickinson, K. Siddiqi, S.W. Zucker, Indexing using a spectral encoding of topological structure, IEEE Int. Conf. Pattern Recog. (1999) 491-497.
10. B. Mohar, Some applications of laplace eigenvalues of graphs, Graph Symmetry: Algebraic Methods and Applications, NATO ASI Series C, vol. 497, 1997, pp. 227-275.
11. W.H. Haemers, Interlacing eigenvalues and graphs, Linear Algebra Appl. 1995, pp. 593-616.
12. J. Shi, and J. Malik Normalized cuts and image segmentation IEEE Pattern Anal. Mach. Intel. 22 8 2000 888 905
13. J. Diaz, J. Petit, M. Serna, A survey on graph layout problems, Technical Report LSI-00-61-R, Universitat Polit'ecnica de Catalunya, 2000.
14. J.E. Atkins, E.G. Boman, B. Hendrickson, A spectral algorithm for seriation and the consecutive ones problem, SIAM J. Comput. 1998.
15. M. Fiedler A property of eigenvectors of non-negative symmetric matrices and its application to graph theory Czech. Math. J. 25 1975 619 633
16. R. Myers, R.C. Wilson, and E.R. Hancock Bayesian graph edit distance IEEE Pattern Anal. Mach. Intel. 22 6 2000 628 635
17. V.I. Levenshtein Binary codes capable of correcting deletions insertions and reversals Sov. Phys. Dokl. 10 8 1966 707 710
18. R.A. Wagner, and M. Fischer The string-to-string correction problem J. ACM 21 1 1974 168 173
19. A. Marzal, and E. Vidal Computation of normalized edit distance and applications IEEE Trans. Syst. Man Cybern. 25 1995 202 206
20. S. Gold, and A. Rangarajan A graduated assignment algorithm for graph matching IEEE Pattern Anal. Mach. Intel. 18 4 1996 377 388
21. A.M. Finch, R.C. Wilson, and E.R. Hancock An energy function and continuous edit process for graph matching Neural Computation 10 7 1998 1873 1894
22. B. Luo, A.D. Cross, E.R. Hancock, Corner detection via topographic analysis of vector potential, Proceedings of the nineth British Machine Vision Conference, 1998.