A study of graph spectra for comparing graphs

BMVC 2005 - Proceedings of the British Machine Vision Conference 2005

Volumn , Issue , 2005, Pages

  Zhu, Ping ^a   Wilson, Richard C ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; LAPLACE TRANSFORMS; MATRIX ALGEBRA; PATTERN MATCHING;

COMBINATORIAL LAPLACIAN; EUCLIDEAN DISTANCE; EXTRACT INFORMATIONS; MATRIX FORMULATION; MATRIX REPRESENTATION; PARTICULAR MATRIXES; PATH LENGTH DISTRIBUTION; SPECTRUM OF A GRAPH;

COMPUTER VISION;

EID: 84898481266     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5244/C.19.69     Document Type: Conference Paper

References (15)

1. H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18: 689-694, 1997.
2. F. R. K. Chung. Spectral Graph Theory. AMS, 1997.
3. C. D. Godsil and B. D. McKay. Constructing cospectral graphs. Aequationes Mathematicae, 25: 257-268, 1982.
4. W. H. Haemers and E. Spence. Enumeration of cospectral graphs. European Journal of Combinatorics, 25(2): 199-211, 2004.
5. S. Kosinov and T. Caelli. Inexact multisubgraph matching using graph eigenspace and clustering models. Structural, Syntatic and Statistical Pattern Recognition, LNCS, 2396: 133-142, 2002.
6. G. Li and F. Ruskey. The advantages of forward thinking in generating rooted and free trees. In 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 939-940, 1999.
7. B. Luo, R. C. Wilson, and E. R. Hancock. Graph manifolds from spectral polynoth mials. In 17 International Conference on Pattern Recognition, volume III, pages 402-405, 2004.
8. A. Sanfeliu and K. S. Fu. A distance measure between attributed relational graphs for pattern-recognition. IEEE Transactions on Systems, Man and Cybernetics, 13(3): 353-362, 1983.
9. S. Sarkar and K. L. Boyer. Preceptual organization in computer vision. IEEE Trans. Systems, Man and Cybernetics, 23: 382-399, 1993.
10. A. J. Schwenk. Almost all trees are cospectral. In F. Harary, editor, New directions in the theory of graphs, pages 275-307. Academic Press, New York, 1973.
11. J. Shi and J. Malik. Normalized cuts and image segmentation. CVPR, pages 731-737, 1997.
12. A. Shokoufandeh, S. Dickinson, K. Siddiqi, and S. Zucker. Indexing using a spectral coding of topological structure. In Proceedings IEEE Conference on Computer Vision and Pattern Recognition, number 491-497, 1999.
13. E. R. van Damand W. H. Haemers. Which graphs are determined by their spectrum? Linear Algebra and its Applications, 356: 241-272, 2003.
14. th International Conference on Image Analysis and Processing, pages 480-485, 2003.
15. R. C. Wilson and E. R. Hancock. Contour segments from spline interpolation. In Syntactic and Structural Pattern Recognition Workshop, volume LNCS 3138, pages 57-65. Springer, 2004.