Abstract : Finding point correspondences which are consistent with a geometric constraint is one of the cornerstones of many computer vision problems. This is a difficult task because of spurious measurements leading to ambiguously matched points and because of uncertainty in point location. In this article we address these problems and propose a new robust algorithm that explicitly takes account of location uncertainty. We propose applications to Sift matching and 3D data fusion.
https://hal.inria.fr/inria-00474083
Contributeur : Frédéric Sur
<>
Soumis le : lundi 20 septembre 2010 - 10:48:06
Dernière modification le : jeudi 11 janvier 2018 - 06:20:14
Document(s) archivé(s) le : mardi 21 décembre 2010 - 02:29:04
