A graph-spectral approach to correspondence matching

Proceedings - International Conference on Pattern Recognition

Volumn 16, Issue 4, 2002, Pages 176-179

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

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; MARKOV PROCESSES; PATTERN MATCHING; PROBABILITY; SPECTRUM ANALYSIS; CHAINS; PATTERN RECOGNITION;

GRAPH ADJACENCY MATRIX; GRAPH-MATCHING;

GRAPH THEORY;

ADJACENCY MATRICES; GRAPH ADJACENCY MATRICES; GRAPH-MATCHING METHODS; GRAPH-SPECTRAL APPROACH; GRAPHICAL MODEL; SEARCH METHOD; SPECTRAL METHODS; TRANSITION PROBABILITY MATRIX;

EID: 33845218920     PISSN: 10514651     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. K. Siddiqi A. Shokoufandeh, S. J. Dickinson and S. W. Zucker. Indexing using a spectral encoding of topological structure. In Proceedings of the Computer Vision and Pattern Recognition, 1998.
2. Luo Bin 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.
3. Fan R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
4. M. Doob D. Cvetković and H. Sachs. Spectra of Craphs:Theory and Application. Academic Press, 1980.
5. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEET-PAMI, 18(4), 1996.
6. R. Horaud and H. Sossa. Polyhedral object recognition by indexing. Pattern Recognition, 1995.
7. Bin Luo and E. R. Hancock. Structural graph matching using the EM algorithm and singular value decomposition. To appear in IEEE Trans. on Pattern Analysis and Machine Intelligence, 2001.
8. L. Lovász. Random walks on graphs: a survey. Bolyai Society Mathematical Studies, 2(2): 1-46, 1993.
9. 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, 1991.
10. L. S. Shapiro and J. M. Brady. A modal approach to featurebased correspondence. In British Machine Vision Conference, 1991.
11. S. Umeyama. An eigen decomposition approach to weighted graph matching problems. PAMI, 10(5):695-703, September 1988.
12. R. S. Varga. Matrix Iterative Analysis. Springer, second edition, 2000.
13. R.C. Wilson, A.N. Evans, and E.R. Hancock. Relational matching by discrete relaxation. IVC, 13(5):411-421, June 1995.