Abstract
The spectra of graphs has been widely used to characterise and extract information from their structures. Applications include matching, segmentation and indexing. One of the key questions about this approach is the stability and representational power of the spectrum under changes in the graphs. There is also a wide variety of graph matrix representations from which the spectrum can be extracted. In this paper we discuss the issue of stability of various graph representation methods and compare five main graph representations; the adjacency matrix, combinatorial Laplacian, normalized Laplacian matrix, heat kernel and path length distribution matrix. We show that the Euclidean distance between spectra tracks the edit distance over a wide range of edit costs, and we analyse the stability of this relationship. We then use the spectra to match and classify the graphs and demonstrate the effect of the graph matrix formulation on error rates.
This is a preview of subscription content, log in via an institution to check access.
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
Torsello, A., Hancock, E.R.: Efficiently computing weighted tree edit distance using relaxation labeling. In: Figueiredo, M., Zerubia, J., Jain, A.K. (eds.) EMMCVPR 2001. LNCS, vol. 2134, pp. 438–453. Springer, Heidelberg (2001)
Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters 18, 689–694 (1997)
Bunke, H.: Error correcting graph matching: On the influence of the underlying cost function. IEEE Transactions on Pattern Analysis and Machine Intelligence 21, 917–922 (1999)
Chung, F.R.K.: Spectral Graph Theory. AMS, Providence (1997)
Kosinov, S., Caelli, T.M.: 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)
Luo, B., Wilson, R.C., Hancock, E.R.: Graph manifolds from spectral polynomials. In: 17th International Conference on Pattern Recognition, vol. III, pp. 402–405 (2004)
Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs for pattern-recognition. IEEE Transactions on Systems, Man and Cybernetics 13(3), 353–362 (1983)
Sarkar, S., Boyer, K.L.: Preceptual organization in computer vision. IEEE Trans. Systems, Man and Cybernetics 23, 382–399 (1993)
Shi, J., Malik, J.: Normalized cuts and image segmentation. In: CVPR, pp. 731–737 (1997)
Shokoufandeh, A., Dickinson, S., Siddiqi, K., Zucker, S.: Indexing using a spectral coding of topological structure. In: Proceedings IEEE Conference on Computer Vision and Pattern Recognition, pp. 491–497 (1999)
Tsai, W.H., Fu, K.S.: Subgraph error-correcting isomorphisms for syntactic pattern-recognition. IEEE Transations on Systems, Man and Cybernetics 13(1), 48–62 (1983)
Wilson, R.C., Hancock, E.R.: Pattern spaces from graph polynomials. In: 12th International Conference on Image Analysis and Processing, pp. 480–485 (2003)
Wilson, R.C., Hancock, E.R.: Contour segments from spline interpolation. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol. 3138, pp. 134–142. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, P., Wilson, R.C. (2005). Stability of the Eigenvalues of Graphs. In: Gagalowicz, A., Philips, W. (eds) Computer Analysis of Images and Patterns. CAIP 2005. Lecture Notes in Computer Science, vol 3691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11556121_46
Download citation
DOI: https://doi.org/10.1007/11556121_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28969-2
Online ISBN: 978-3-540-32011-1
eBook Packages: Computer ScienceComputer Science (R0)