A robust eigendecomposition framework for inexact graph-matching

Proceedings - 11th International Conference on Image Analysis and Processing, ICIAP 2001

Volumn , Issue , 2001, Pages 465-470

  Luo, B ^a,b   Hancock, E R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

^b ANHUI UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; IMAGE ANALYSIS; MAXIMUM LIKELIHOOD ESTIMATION; PROBABILITY DISTRIBUTIONS;

CONNECTIVITY STRUCTURES; EIGEN DECOMPOSITION; EM ALGORITHMS; HIGH-LEVEL VISIONS; MATCHING ERROR; REAL-WORLD; SYNTHETIC DATA;

GRAPH THEORY;

EID: 84890538613     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIAP.2001.957053     Document Type: Conference Paper

References (13)

1. K. Boyer and A. Kak. Structural Stereopsis for 3D Vision. IEEE PAMI, 10:144-166,1988.
2. H. Bunke. Error correcting graph matching: On the influence of the underlying cost function. IEEE PAMI, 21:917-922,1999.
3. W.J. Christmas, J. Kittler, and M. Petrou. Structural matching in computer vision using probabilistic relaxation. IEEE PAMI, 17(8):749-764,1995.
4. F.R.K. Chung. Spectral Graph Theory. American Mathmatical Society Ed., CBMS series 92,1997.
5. A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum-likelihood from incomplete data via the EM algorithm. J. Royal Statistical Soc. Ser. B (methodological), 39:1-38, 1977.
6. R. Horaud and H. Sossa. Polyhedral object recognition by indexing. Pattern Recognition, 28(12): 1855-1870, 1995.
7. B. Luo, A.D.J. Cross, and E.R. Hancock. Corner detection via topographic analysis of vector potential. Pattern Recognition Letters, 20:635-650, 1999.
8. A. Sanfeliu and K.S. Fu. A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Systems, Man and Cybernetics, 13(3):353-362,May 1983.
9. G.L. Scott and H.C. Longuet-Higgins. An Algorithm for Associating the Features of 2 Images. Proceedings of the Royal Society of London Series B-Biological, 244(1309):21-26,1991.
10. L.S. Shapiro and J. M. Brady. Feature-based Correspondence-An Eigenvector Approach. Image and Vision Computing, 10:283-288, 1992.
11. S. Umeyama. An eigen decomposition approach to weighted graph matching problems. IEEE PAMI, 10:695-703,1988.
12. R.C. Wilson and E.R. Hancock. Structural matching by discrete relaxation. IEEE T-PAMI, 19(6):634-648, June 1997.
13. A.K.C Wong and M You. Entropy and distance of random graphs with application to structural pattern recognition. IEEE PAMI, 7:509-609,1985.