Efficient Registration of stereo images by matching graph descriptions of edge segments

Nicholas Ayache 1, * Bernard Faverjon 2
* Auteur correspondant
1 ROBOTVIS - Computer Vision and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
2 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : We present a new approach to the stereo-matching problem. Images are individually described by aneighborhood graph of line segments coming from a polygonal approximation of the contours. The matching process is defined as the exploration of the largest components of adisparity graph built from the descriptions of the two images, and is performed by an efficient prediction and propagation technique. This approach was tested on a variety of man-made environments, and it appears to be fast and robust enough for mobile robot navigation and three-dimensional part-positioning applications.
Liste complète des métadonnées

https://hal.inria.fr/inria-00615533
Contributeur : Project-Team Asclepios <>
Soumis le : vendredi 19 août 2011 - 16:44:40
Dernière modification le : samedi 27 janvier 2018 - 01:30:42
Document(s) archivé(s) le : vendredi 25 novembre 2011 - 11:36:09

Fichier

AyacheIJCV1987.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Nicholas Ayache, Bernard Faverjon. Efficient Registration of stereo images by matching graph descriptions of edge segments. International Journal of Computer Vision, Springer Verlag, 1987, pp.107--131. 〈10.1007/BF00123161〉. 〈inria-00615533〉

Partager

Métriques

Consultations de la notice

159

Téléchargements de fichiers

152