Abstract
Graph structures have proved computationally cumbersome for pattern analysis. The reason for this is that before graphs can be converted to pattern vectors, correspondences must be established between the nodes of structures which are potentially of different size. To overcome this problem, in this paper we turn to the spectral decomposition of the Laplacian matrix. We show how the elements of the spectral matrix for the Laplacian can be used to construct symmetric polynomials that are permutation invariants. The co-efficients of these polynomials can be used as graph-features which can be encoded in a vectorial manner. We explore whether the vectors of invariants can be embedded in a low dimensional space using a number of alternative strategies including principal components analysis (PCA), multidimensional scaling (MDS) and locality preserving projection (LPP).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Christmas, W.J., Kittler, J., Petrou, M.: Structural Matching in Computer Vision using Probabilistic Relaxation. IEEE PAMI 17, 749–764 (1995)
Chung, F.R.K.: Spectral Graph Theory. In: CBMS series 92, American Mathmatical Society Ed. Providence (1997)
Umeyama, S.: An eigen decomposition approach to weighted graph matching problems. IEEE PAMI 10, 695–703 (1988)
Luo, B., Wilson, R.C., Hancock, E.R.: Spectral Embedding of Graphs. Pattern Recognition 36, 2213–2230 (2003)
Roweis, S., Saul, L.: Non-linear dimensionality reduction by locally linear embedding. Science 299, 2323–2326 (2002)
Tenenbaum, J.B., Silva, V.D., Langford, J.C.: A global geometric framework for non-linear dimensionality reduction. Science 290, 586–591 (2000)
He, X., Niyogi, P.: Locality preserving projections In: NIPS 2003 (to appear)
Shokoufandeh, S.D., Siddiqi, K., Zucker, S.: Indexing using a Spectral Coding of Topological Structure. In: CVPR, pp. 491–497 (1999)
Segen, J.: Learning graph models of shape. In: Laird, J. (ed.) Proceedings of the Fifth International Conference on Machine Learning, pp. 29–25 (1988)
Bagdanov, A.D., Worring, M.: First Order Gaussian Graphs for Efficient Structure Classification. Pattern Recogntion 36, 1311–1324 (2003)
Wong, A.K.C., Constant, J., You, M.L.: Random Graphs. In: Syntactic and Structural Pattern Recognition, World Scientific, Singapore (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luo, B., Wilson, R.C., Hancock, E.R. (2004). Graph Pattern Spaces from Laplacian Spectral Polynomials. In: Campilho, A., Kamel, M. (eds) Image Analysis and Recognition. ICIAR 2004. Lecture Notes in Computer Science, vol 3211. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30125-7_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-30125-7_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23223-0
Online ISBN: 978-3-540-30125-7
eBook Packages: Springer Book Archive