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.
Type de document :
Communication dans un congrès
MMSP 2008, Oct 2008, Cairns, Australia. Proceedings of the 2008 IEEE 10th Workshop on Multimedia Signal Processing, 2008, 〈10.1109/MMSP.2008.4665098〉
Liste complète des métadonnées

Littérature citée [29 références]  Voir  Masquer  Télécharger

https://hal-upec-upem.archives-ouvertes.fr/hal-01372371
Contributeur : Admin Upem <>
Soumis le : mardi 27 septembre 2016 - 10:58:20
Dernière modification le : jeudi 9 février 2017 - 15:19:58
Document(s) archivé(s) le : mercredi 28 décembre 2016 - 13:12:51

Fichier

MiledPesquetPesquet2008.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Wided Miled, Béatrice Pesquet-Popescu, Jean-Christophe Pesquet. A convex programming approach for color stereo matching. MMSP 2008, Oct 2008, Cairns, Australia. Proceedings of the 2008 IEEE 10th Workshop on Multimedia Signal Processing, 2008, 〈10.1109/MMSP.2008.4665098〉. 〈hal-01372371〉

Partager

Métriques

Consultations de la notice

327

Téléchargements de fichiers

36