Multi-label depth estimation for graph cuts stereo problems

Abstract : We describe here a method to compute the depth of a scene from a set of at least two images taken at known view-points. Our approach is based on an energy formulation of the 3D reconstruction problem which we minimize using a graph-cut approach that computes a local minimum whose energy is comparable (modulo a multiple constant) with the energy of the absolute minimum. As usually done, we treat the input images symmetrically, match pixels using photoconsistency, treat occlusion and visibility problems and consider a spatial regularization term which preserves discontinuities. The details of the graph construction as well as the proof of the correctness of the method are given. Moreover we introduce a multi-label refinement algorithm in order to increase the number of depth labels without significantly increasing the computational complexity. Finally we compared our algorithm with the results available in the Middlebury database.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00596140
Contributor : Nicolas Papadakis <>
Submitted on : Thursday, May 26, 2011 - 3:55:41 PM
Last modification on : Thursday, May 26, 2011 - 3:55:41 PM

Links full text

Identifiers

Citation

Nicolas Papadakis, Vicent Caselles. Multi-label depth estimation for graph cuts stereo problems. Journal of Mathematical Imaging and Vision, Springer Verlag, 2010, 38 (1), pp.70-82. ⟨10.1007/s10851-010-0212-8⟩. ⟨hal-00596140⟩

Share

Metrics

Record views

112