A convex programming approach for color stereo matching

Abstract : This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is cast as a convex programming problem in which a color-based objective function is minimized under specific convex constraints. These constraints arise from prior knowledge and rely on various properties of the disparity field to be estimated. The resulting multi-constrained optimization problem is solved via an efficient parallel block-iterative algorithm. Four different color spaces have been tested in order to evaluate their suitability for stereo matching. Experiments on standard stereo images show that the matching results have been efficiently improved when using color information instead of grey values.
Document type :
Conference papers
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal-upec-upem.archives-ouvertes.fr/hal-01372371
Contributor : Admin Upem <>
Submitted on : Tuesday, September 27, 2016 - 10:58:20 AM
Last modification on : Wednesday, February 20, 2019 - 2:41:34 PM
Long-term archiving on : Wednesday, December 28, 2016 - 1:12:51 PM

File

MiledPesquetPesquet2008.pdf
Files produced by the author(s)

Identifiers

Citation

Wided Miled, Béatrice Pesquet-Popescu, Jean-Christophe Pesquet. A convex programming approach for color stereo matching. MMSP 2008, Oct 2008, Cairns, Australia. ⟨10.1109/MMSP.2008.4665098⟩. ⟨hal-01372371⟩

Share

Metrics

Record views

409

Files downloads

95