Kolmogorov and Zabih's Graph Cuts Stereo Matching Algorithm

Abstract : Binocular stereovision estimates the three-dimensional shape of a scene from two photographs taken from different points of view. In rectified epipolar geometry, this is equivalent to a matching problem. This article describes a method proposed by Kolmogorov and Zabih in 2001, which puts forward an energy-based formulation. The aim is to minimize a four-term-energy. This energy is not convex and cannot be minimized except among a class of perturbations called expansion moves, in which case an exact minimization can be done with graph cuts techniques. One noteworthy feature of this method is that it handles occlusion: The algorithm detects points that cannot be matched with any point in the other image. In this method displacements are pixel accurate (no subpixel refinement).
Type de document :
Article dans une revue
Liste complète des métadonnées

Littérature citée [7 références]  Voir  Masquer  Télécharger

https://hal-enpc.archives-ouvertes.fr/hal-01074878
Contributeur : Pascal Monasse <>
Soumis le : mercredi 15 octobre 2014 - 17:07:35
Dernière modification le : lundi 25 février 2019 - 14:40:27
Document(s) archivé(s) le : vendredi 16 janvier 2015 - 10:45:49

Fichier

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

Identifiants

Citation

Vladimir Kolmogorov, Pascal Monasse, Pauline Tan. Kolmogorov and Zabih's Graph Cuts Stereo Matching Algorithm. Image Processing On Line, IPOL - Image Processing on Line, 2014, 4, pp.220-251. ⟨10.5201/ipol.2014.97⟩. ⟨hal-01074878⟩

Partager

Métriques

Consultations de la notice

441

Téléchargements de fichiers

776