The Community for Technology Leaders
Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662) (2000)
Hilton Head, South Carolina
June 13, 2000 to June 15, 2000
ISSN: 1063-6919
ISBN: 0-7695-0662-3
pp: 1649
Marco Carcassoni , University of York
Edwin R. Hancock , University of York
ABSTRACT
This paper investigates the correspondence matching of point-sets using spectral graph analysis. In particular, we are interested in the problem of how the modal analysis of point-sets can be rendered robust to contamination and dropout. We make three contributions. First, we show how the modal structure of point-sets can be embedded within the framework of the EM algorithm. Second, we present several methods for computing the probabilities of point correspondences using the point proximity matrix. Third, we consider alternatives to the Gaussian proximity matrix. We evaluate the new method on both synthetic and real-world data. Here we show that the method can be used to compute useful correspondences even when the level of point contamination is as large as 50%.
INDEX TERMS
CITATION

M. Carcassoni and E. R. Hancock, "Point Pattern Matching with Robust Spectral Correspondence," Proceedings IEEE Conference on Computer Vision and Pattern Recognition. CVPR 2000 (Cat. No.PR00662)(CVPR), Hilton Head, South Carolina, 2000, pp. 1649.
doi:10.1109/CVPR.2000.855881
94 ms
(Ver 3.3 (11022016))