Abstract
In graph comparison, the use of (dis)similarity measurements between graphs is an important topic. In this work, we propose an eigendecomposition based approach for measuring dissimilarities between graphs in the joint eigenspace (JoEig). We will compare our JoEig approach with two other eigendecomposition based methods that compare graphs in different eigenspaces. To calculate the dissimilarity between graphs of different sizes and perform inexact graph comparison, we further develop three different ways to resize the eigenspectra and study their performance in different situations.
Chapter PDF
Similar content being viewed by others
References
Caelli, T., Kosinov, S.: An Eigenspace Projection Clustering Method for Inexact Graph Matching. IEEE Trans. Pattern Analysis and Machine Intelligence 26(4), 515–519 (2004)
Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty Years of Graph Matching in Pattern Recognition. International Journal of Pattern Recognition and Artificial Intelligence 18(3), 265–298 (2004)
Debnath, A.K., Lopez de Compadre, R.L., Debnath, G., Shusterman, A.J., Hansch, C.: Structure-Activity Relationshop of Mutagenic Aromatic and Heteroaromatic Nitro Compounds. Correlation with Molecular Orbital Energies and Hydrophobicity, Journal of Medicinal Chemistry 34, 786–797 (1991)
He, P.R., Zhang, W.J., Li, Q., Wu, F.X.: A New Method for Detection of Graph Isomorphism Based on the Quadratic Form. Journal of Mechanical Design 125, 640–642 (2003)
Lowe, D.G.: Distinctive Image Features from Scale-Invariant Keypoints. International Journal of Computer Vision 60(2), 91–110 (2004)
Umeyama, S.: An Eigendecomposition Approach to Weighted Graph Matching Problems. IEEE Trans. Pattern Analysis and Machine Intelligence 10(5), 695–703 (1988)
Nene, S.A., Nayar, S.K., Murase, H.: Columbia University Image Library (COIL-20), http://www1.cs.columbia.edu/CAVE/software/softlib/coil-20.php
Neuhaus, M., Bunke, H.: Edit Distance-Based Kernel Functions for Structural Pattern Classification. Pattern Recognition 39, 1852–1863 (2006)
Pekalska, E., Duin, R.P.W.: Dissimilarity Representations Allow for Building Good Classifiers. Pattern Recognition Letters 23(8), 943–956 (2002)
Qiu, H.J., Hancock, E.R.: Spectral Simplication of Graphs. In: Proceedings of the 8th European conference on computer vision, Czech Republic, pp. 114–126 (2004)
Wilson, R.C., Hancock, E.R., Luo, B.: Pattern Vectors from Algebraic Graph Theory. IEEE Trans. Pattern Analysis and Machine Intelligence 27(7), 1–13 (2005)
Zhao, G.X., Luo, B., Ting, J., Ma, J.X.: Using Eigen-Decomposition Method for Weighted Graph Matching. In: Huang, D.-S., Heutte, L., Loog, M. (eds.) ICIC 2007. LNCS, vol. 4681, pp. 1283–1294. Springer, Heidelberg (2007)
CMU Vision and Autonomous System Center’s Image Database, http://www.ius.cs.cmu.edu/idb/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, WJ., Duin, R.P.W. (2008). An Inexact Graph Comparison Approach in Joint Eigenspace. In: da Vitoria Lobo, N., et al. Structural, Syntactic, and Statistical Pattern Recognition. SSPR /SPR 2008. Lecture Notes in Computer Science, vol 5342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89689-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-89689-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89688-3
Online ISBN: 978-3-540-89689-0
eBook Packages: Computer ScienceComputer Science (R0)