A convex programming approach for color stereo matching - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

A convex programming approach for color stereo matching


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.
Fichier principal
Vignette du fichier
MiledPesquetPesquet2008.pdf (479.25 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01372371 , version 1 (27-09-2016)



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⟩
233 View
172 Download



Gmail Facebook X LinkedIn More