Kolmogorov and Zabih's Graph Cuts Stereo Matching Algorithm - École des Ponts ParisTech Access content directly
Journal Articles Image Processing On Line Year : 2014

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).
Fichier principal
Vignette du fichier
article.pdf (3.16 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01074878 , version 1 (15-10-2014)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More