Edit distance from graph spectra

Proceedings of the IEEE International Conference on Computer Vision

Volumn 1, Issue , 2003, Pages 234-241

  Robles Kelly, A ^a   Hancock, E R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER VISION; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; IMAGE SEGMENTATION; MATRIX ALGEBRA; OBJECT RECOGNITION; PROBABILITY;

DELAUNAY GRAPHS; GRAPH EDIT DISTANCE; GRAPH SPECTRAL SERIATION METHOD;

PATTERN MATCHING;

EID: 0344551915     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iccv.2003.1238347     Document Type: Conference Paper

References (23)

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. F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
4. E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Math, 1:269-271, 1959.
5. 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.
6. R. Horaud and H. Sossa. Polyhedral object recognition by indexing. Pattern Recognition, 28(12):1855-1870, 1995.
7. V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Sov. Phys. Dokl., 6:707-710, 1966.
8. L. Lovász. Random walks on graphs: a survey. Bolyai Society Mathematical Studies, 2(2):1-46, 1993.
9. B. 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.
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. Pairwise clustering with matrix factorisation and the EM algorithm. In European Conference on Computer Vision, pages 63-67, 2002.
14. 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.
15. S. Sarkar and K. L. Boyer. Quantitative measures of change based on feature organization: Eigenvalues and eigenvectors. Computer Vision and Image Understanding, 71(1):110-136, 1998.
16. G. Scott and H. Longuet-Higgins. An algorithm for associating the features of two images. In Proceedings of the Royal Society of London, number 244 in B, pages 21-26, 1991.
17. L. G. Shapiro and R. M. Haralick. Relational models for scene analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 4:595-602, 1982.
18. L. S. Shapiro and J. M. Brady. A modal approach to feature-based correspondence. In British Machine Vision Conference, pages 78-85, 1991.
19. A. Shokoufandeh, S. J. Dickinson, K. Siddiqi, and S. W. Zucker. Indexing using a spectral encoding of topological structure. In Proceedings of the Computer Vision and Pattern Recognition, pages 491-497, 1998.
20. S. Umeyama. An eigen decomposition approach to weighted graph matching problems. PAMI, 10(5):695-703, September 1988.
21. R. S. Varga. Matrix Iterative Analysis. Springer, second edition, 2000.
22. R. A. Wagner and M. J. Fisher. The string-to-string correction problem. Journal of the ACM, 21(1):168-173, 1974.
23. 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.