A study of graph spectra for comparing graphs and trees

Pattern Recognition

Volumn 41, Issue 9, 2008, Pages 2833-2841

  Wilson, Richard C ^a   Zhu, Ping ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Features; Graph matching; Shape representation; Spectrum; Tree matching

Indexed keywords

INFORMATION RETRIEVAL; LAPLACE EQUATION; PATTERN MATCHING;

GRAPH MATCHING; SHAPE REPRESENTATION; TREE MATCHING;

GRAPH THEORY;

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

References (30)

1. A. Shokoufandeh, S. Dickinson, K. Siddiqi, S. Zucker, Indexing using a spectral coding of topological structure. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 1999, pp. 491-497.
2. M.F. Demirci, R. van Leuken, R. Veltkamp, Indexing through Laplacian spectra, Comput. Vision Image Understanding, 2008.
3. J. Zhang, K. Siddiqi, D. Macrini, A. Shokoufandeh, S.J. Dickinson, Retrieving articulated 3-d models using medial surfaces and their graph spectra, In: EMMCVPR, 2005.
4. Fischler M.A., and Elschlager R.A. The representation and matching of pictorial structures. IEEE Trans. Comput. 22 1 (1973) 67-92
5. Barrow H.G., and Burstall R.M. Subgraph isomorphism, matching relational structures and maximal cliques. Inf. Process. Lett. 4 (1976) 83-84
6. Siddiqi K., Shokoufandeh A., Dickinson S., and Zucker S.W. Shock graphs and shape matching. Int. J. Comput. Vision 35 1 (1999) 13-32
7. Wilson R.C., and Hancock E.R. Structural matching by discrete relaxation. IEEE Trans. Pattern Anal. Mach. Intell. 19 6 (1997) 634-648
8. Gold S., and Rangarajan A. A graduated assignment algorithm for graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 18 (1996) 377-388
9. van Wyk B.J., and van Wyk M.A. A pocs-based graph matching algorithm. IEEE Trans. Pattern Anal. Mach. Intell. 26 11 (2004) 1526-1530
10. Sanfeliu A., and Fu K.S. A distance measure between attributed relational graphs for pattern-recognition. IEEE Trans. Syst. Man Cybern. 13 3 (1983) 353-362
11. Bunke H. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Lett. 18 (1997) 689-694
12. Bunke H. Error correcting graph matching: on the influence of the underlying cost function. IEEE Trans. Pattern Anal. Mach. Intell. 21 (1999) 917-922
13. Chung F.R.K. Spectral Graph Theory, CBMS Series vol. 92 (1997), American Mathematical Society, Providence, RI
14. J. Shi, J. Malik, Normalized cuts and image segmentation, In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 1997, pp. 731-737.
15. Sarkar S., and Boyer K.L. Preceptual organization in computer vision. IEEE Trans. Syst. Man Cybern. 23 (1993) 382-399
16. Umeyama S. An eigendecompostion approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell. 10 5 (1988) 695-703
17. S. Kosinov, T. Caelli, Inexact multisubgraph matching using graph eigenspace and clustering models, Struct. Syntatic Stat. Pattern Recognition, Lecture Notes in Computer Sience, vol. 2396, 2002, pp. 133-142.
18. R.C. Wilson, E.R. Hancock, Pattern spaces from graph polynomials, In: 12th International Conference on Image Analysis and Processing, 2003, pp. 480-485.
19. R.C. Wilson, E.R. Hancock, Contour segments from spline interpolation, In: Syntactic and Structural Pattern Recognition Workshop, Lecture Notes in Computer Science, vol. 3138, Springer, Berlin, 2004, pp. 57-65.
20. Schwenk A.J. Almost all trees are cospectral. In: Harary F. (Ed). New Directions in the Theory of Graphs (1973), Academic Press, New York 275-307
21. van Dam E.R., and Haemers W.H. Which graphs are determined by their spectrum?. Linear Algebra Appl. 356 (2003) 241-272
22. Haemers W.H., and Spence E. Enumeration of cospectral graphs. Eur. J. Combinatorics 25 2 (2004) 199-211
23. Robles-Kelly A., and Hancock E.R. A Riemannian approach to graph embedding. Pattern Recognition 40 (2007) 1042-1056
24. Yau S.T., and Schoen R.M. Differential Geometry (1988), Science, Moscow
25. X. Bai, E.R. Hancock, Heat kernels, manifolds and graph embedding, In: IAPR workshop on structural, syntatic and statistical pattern recognition, Lecture Notes in Computer Sience, vol. 3138, 2004, pp. 198-206.
26. Godsil C.D., and McKay B.D. Constructing cospectral graphs. Aequationes Math. 25 (1982) 257-268
27. G. Li, F. Ruskey, The advantages of forward thinking in generating rooted and free trees, In: 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1999, pp. 939-940.
28. Torsello A., and Hancock E.R. Learning shape-classes using a mixture of tree-unions. IEEE Trans. Pattern Anal. Mach. Intell. 28 6 (2006) 954-967
29. S.A. Nene, S.K. Nayar, H. Murase, Columbia object image library (coil-100), Technical Report CUCS-006-96, Department of Computer Science, Columbia University, 1996.
30. B. Xiao, E.R. Hancock, Clustering shapes using heat content invariants, In: IEEE International Conference on Image Processing, 2005.