Disparity Map Estimation Using A Total Variation Bound

Abstract : This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an objective function is minimized under various constraints modelling prior knowledge and observed information. The algorithm proposed to solve this problem has a block-iterative structure which allows a wide range of constraints to be easily incorporated, possibly taking advantage of parallel computing architectures. In this work, we use a Total Variation bound as a regularization constraint, which is shown to be well-suited to disparity maps. Experimental results for standard data sets are presented to illustrate the capabilities of the proposed disparity estimation technique.
Type de document :
Communication dans un congrès
Third Canadian Conference on Computer and Robot Vision, Jun 2006, Quebec, 2006


https://hal.inria.fr/inria-00001255
Contributeur : Wided Miled <>
Soumis le : vendredi 14 avril 2006 - 16:41:22
Dernière modification le : mercredi 15 avril 2015 - 16:07:52
Document(s) archivé(s) le : samedi 3 avril 2010 - 23:11:59

Identifiants

  • HAL Id : inria-00001255, version 1

Citation

Wided Miled, Jean-Christophe Pesquet, Michel Parent. Disparity Map Estimation Using A Total Variation Bound. Third Canadian Conference on Computer and Robot Vision, Jun 2006, Quebec, 2006. <inria-00001255>

Partager

Métriques

Consultations de
la notice

236

Téléchargements du document

444