HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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 metadata

Cited literature [29 references]  Display  Hide  Download

Contributor : Admin Upem Connect in order to contact the contributor
Submitted on : Tuesday, September 27, 2016 - 10:58:20 AM
Last modification on : Saturday, January 15, 2022 - 3:57:18 AM
Long-term archiving on: : Wednesday, December 28, 2016 - 1:12:51 PM


Files produced by the author(s)



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⟩



Record views


Files downloads