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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [21 references]  Display  Hide  Download

https://hal.inria.fr/inria-00001255
Contributor : Wided Miled <>
Submitted on : Friday, April 14, 2006 - 4:41:22 PM
Last modification on : Friday, May 25, 2018 - 12:02:03 PM
Long-term archiving on : Saturday, April 3, 2010 - 11:11:59 PM

Identifiers

  • 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. ⟨inria-00001255⟩

Share

Metrics

Record views

393

Files downloads

803