Graph matching using spectral seriation and string edit distance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2726, Issue , 2003, Pages 154-165

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

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; MATRIX ALGEBRA; PATTERN RECOGNITION; PROBABILITY; PROBABILITY DISTRIBUTIONS;

ADJACENCY MATRICES; GRAPH ADJACENCY MATRICES; GRAPH EDIT DISTANCE; GRAPH MATCHINGS; MAXIMUM A POSTERIORI PROBABILITIES; SEQUENCE ALIGNMENTS; STRING ALIGNMENT; STRING MATCHING;

PATTERN MATCHING;

EID: 35248840153     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45028-9_14     Document Type: Article

References (19)

1. 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.
2. H. Bunke. On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters, 18(8):689-694, 1997.
3. 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.
4. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl., 6:707-710, 1966.
5. L. Lovász. Random walks on graphs: a survey. Bolyai Society Mathematical Studies, 2(2):1-46, 1993.
6. 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.
7. 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.
8. Bin Luo, R. Wilson, and E. Hancock. Eigenspaces for graphs. International Journal of Image and Graphics, 2(2):247-268, 2002.
9. Bin Luo, R. C. Wilson, and E. R. Hancock. Spectral feature vectors for graph clustering. In S+SSPR 2002, pages 82-90, 2002.
10. 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.
11. R. Myers, R. C. Wilson, and E. R. Hancock. Bayesian graph edit distance. PAMI, 22(6):628-635, June 2000.
12. B. J. Oommen and K. Zhang. The normalized string editing problem revisited. PAMI, 18(6):669-672, June 1996.
13. 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.
14. 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.
15. 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.
16. L. G. Shapiro and R. M. Haralick. Relational models for scene analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 4:595-602, 1982.
17. R. S. Varga. Matrix Iterative Analysis. Springer, second edition, 2000.
18. R. A. Wagner and M. J. Fisher. The string-to-string correction problem. Journal of the ACM, 21(1):168-173, 1974.
19. 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.