String edit distance, random walks and graph matching

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 18, Issue 3, 2004, Pages 315-327

  Robles Kelly, Antonio ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Graph seriation; Graph spectral methods; Markov chains

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; MARKOV PROCESSES; MATRIX ALGEBRA; PROBABILITY; VECTORS;

GRAPH MATCHING; GRAPH SERIATION; GRAPH-SPECTRAL METHODS; STRUCTURAL ERRORS;

PATTERN MATCHING;

EID: 3142703528     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218001404003277     Document Type: Article

References (26)

1. H. Bunke, On a relation between graph edit distance and maximum common subgraph, Patt. Recogn. Lett. 18 (1997) 689-694.
2. F. R. K. Chung, Spectral Graph Theory (American Mathematical Society, 1997).
3. M. A. Eshera and K. S. Fu, A graph distance measure for image analysis, IEEE Trans. Syst. Man Cybern. 14 (1984) 398-407.
4. A. M. Finch, R. C. Wilson and E. R. Hancock, An energy function and continuous edit process for graph matching, Neural Comput. 10 (1998) 1873-1894.
5. S. Gold and A. Rangarajan, A graduated assignment algorithm for graph matching, PAMI 18 (1996) 377-388.
6. R. Horaud and H. Sossa, Polyhedral object recognition by indexing. Patt. Recogn. 28 (1995) 1855-1870.
7. S. Kosinov and T. Caelli, Inexact multisubgraph matching using graph eigenspace and clustering models, in Structural, Syntactic and Statistical Pattern Recognition, Lecture Notes in Computer Science, Vol. 2396, 2002, pp. 133-142.
8. V. I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Sov. Phys. Dokl. 6 (1966) 707-710.
9. L. Lovász, Random walks on graphs: a survey, Bolyai Soc. Math. Stud. 2 (1993) 1-46.
10. B. Luo and E. R. Hancock, Procrustes alignment with the EM Algorithm, 8th Int. Conf. Computer Analysis of Images and Image Patterns, 1999, pp. 623-631.
11. B. Luo and E. R. Hancock, Structural graph matching using the EM algorithm and singular value decomposition, IEEE Trans. Patt. Anal. Mach. Intell. 23 (2001) 1120-1136.
12. R. Myers, R. C. Wilson and E. R. Hancock, Bayesian graph edit distance, PAMI 22 (2000) 628-635.
13. B. J. Oommen and K. Zhang, The normalized string editing problem revisited, PAMI 18 (1996) 669-672.
14. A. Robles-Kelly and E. R. Hancock, Graph edit distance from spectral seriation, IEEE Trans. Pattern Analysis and Machine Intelligence, 2003, submitted.
15. A. Robles-Kelly and E. R. Hancock, A graph-spectral approach to shape-from-shading, IEEE Trans. Imag. Process., 2004, to appear.
16. A. Sanfeliu and K. S. Fu, A distance measure between attributed relational graphs for pattern recognition, IEEE Trans. Syst. Man Cybern. 13 (1983) 353-362.
17. G. Scott and H. Longuet-Higgins, An algorithm for associating the features of two images, in Proc. Roy. Soc. London B244 (1991) 21-26.
18. L. G. Shapiro and R. M. Haralick, Relational models for scene analysis, IEEE Trans. Patt. Anal. Mach. Intell. 4 (1982) 595-602.
19. L. S. Shapiro and J. M. Brady, A modal approach to feature-based correspondence, British Machine Vision Conf., 1991, pp. 78-85.
20. A. Shokoufandeh, S. J. Dickinson, K. Siddiqi and S. W. Zucker, Indexing using a spectral encoding of topological structure, in Proc. Computer Vision and Pattern Recognition, 1998, pp. 491-497.
21. S. Ullman, Filling in the gaps: the shape of subjective contours and a model for their generation, Biol. Cybern. 25 (1976) 1-6.
22. S. Umeyama, An eigen decomposition approach to weighted graph matching problems, PAMI 10 (1988) 695-703.
23. R. S. Varga, Matrix Iterative Analysis, 2nd edn. (Springer, 2000).
24. R. A. Wagner and M. J. Fisher, The string-to-string correction problem, J. ACM 21 (1974) 168-173.
25. 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 (1998) 889-895.
26. R. C. Wilson and E. R. Hancock, Structural matching by discrete relaxation, IEEE Trans. Patt. Anal. Mach. Intell. 19 (1997) 634-648.