Abstract
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the formality and rigour of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that string matching techniques can be used. To do this we use graph spectral seriation method to convert the adjacency matrix into a string or sequence order. We show how the serial ordering can be established using the leading eigenvector of the graph adjacency matrix. We pose the problem of graph-matching as maximum a posteriori probability alignment of the seriation sequences for pairs of graphs. This treatment leads to an expression in which for edit cost is the negative logarithm of the a posteriori sequence alignment probability. To compute the string alignment probability we provide models of the edge compatibility error and the probability of individual node correspondences.
Supported by CONACYT, under grant No. 146475/151752.
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.
Similar content being viewed by others
References
J. E. Atkins, E. G. Roman, and B. Hendrickson. A spectral algorithm for seriation and the consecutive ones problem. SIAM Journal on Computing, 28(1):297–310, 1998.
H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18(8):689–694, 1997.
M. A. Eshera and K. S. Fu. A graph distance measure for image analysis. IEEE Transactions on Systems, Man and Cybernetics, 14:398–407, 1984.
V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl., 6:707–710, 1966.
L. Lovász. Random walks on graphs: a survey. Bolyai Society Mathematical Studies, 2(2):1–46, 1993.
Bin Luo and E. R. Hancock. Procrustes alignment with the EM Algorithm. In 8th International Conference on Computer Analysis of Images and Image Patterns, pages 623–631, 1999.
Bin Luo and E. R. Hancock. Structural graph matching using the EM algorithm and singular value decomposition. IEEE Trans. on Pattern Analysis and Machine Intelligence, 23(10):1120–1136, 2001.
Bin Luo, R. Wilson, and E. Hancock. Eigenspaces for graphs. International Journal of Image and Graphics, 2(2):247–268, 2002.
Bin Luo, R. C. Wilson, and E. R. Hancock. Spectral feature vectors for graph clustering. In S+SSPR 2002, pages 82–90, 2002.
B. Mohar. Some applications of laplace eigenvalues of graphs. In G. Hahn and G. Sabidussi, editors, Graph Symmetry: Algebraic Methods and Applications, NATO ASI Series C, pages 227–275, 1997.
R. Myers, R. C. Wilson, and E. R. Hancock. Bayesian graph edit distance. PAMI, 22(6):628–635, June 2000.
B. J. Oommen and K. Zhang. The normalized string editing problem revisited. PAMI, 18(6):669–672, June 1996.
A. Robles-Kelly and E. R. Hancock. A maximum likelihood framework for iterative eigendecomposition. In Proc. of the IEEE International Conference on Conputer Vision, pages 654–661, 2001.
A. Robles-Kelly and E. R. Hancock. An expectation-maximisation framework for segmentation and grouping. Image and Vision Computing, 20(9–10):725–738, 2002.
A. Sanfeliu and K. S. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Transactions on Systems, Man and Cybernetics, 13:353–362, 1983.
L. G. Shapiro and R. M. Haralick. Relational models for scene analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 4:595–602, 1982.
R. S. Varga. Matrix Iterative Analysis. Springer, second edition, 2000.
R. A. Wagner and M. J. Fisher. The string-to-string correction problem. Journal of the ACM, 21(1):168–173, 1974.
J. T. L. Wang, B. A. Shapiro, D. Shasha, K. Zhang, and K. M. Currey. An algorithm for finding the largest approximately common substructures of two trees. PAMI, 20(8):889–895, August 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Robles-Kelly, A., Hancock, E.R. (2003). Graph Matching Using Spectral Seriation and String Edit Distance. In: Hancock, E., Vento, M. (eds) Graph Based Representations in Pattern Recognition. GbRPR 2003. Lecture Notes in Computer Science, vol 2726. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45028-9_14
Download citation
DOI: https://doi.org/10.1007/3-540-45028-9_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40452-1
Online ISBN: 978-3-540-45028-3
eBook Packages: Springer Book Archive