Fast segmentation-based dense stereo from quasi-dense matching - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2004

Fast segmentation-based dense stereo from quasi-dense matching

Résumé

We propose a segmentation-based dense stereo algorithm within an energy minimization framework. The cost function includes a new consistency term to take into account an initial quasi-dense disparity map and handles occlusions explicitly. Based on quasi-dense matching and color segmentation, optimization is performed efficiently by assuming a constant disparity for each region. The assumption is made robust by over-segmentation and a dynamic region splitting method done by graph cut. The efficiency and accuracy of the algorithm are demonstrated on standard stereo data. Experiment results show that the algorithm compares favorably with other state-of-the-art stereo algorithms.
Fichier principal
Vignette du fichier
Accv04.pdf (918.92 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00118599 , version 1 (05-12-2006)

Identifiants

  • HAL Id : hal-00118599 , version 1

Citer

Yichen Wei, Maxime Lhuillier, Long Quan. Fast segmentation-based dense stereo from quasi-dense matching. Jan 2004, pp.CDROM. ⟨hal-00118599⟩

Collections

PRES_CLERMONT CNRS
89 Consultations
50 Téléchargements

Partager

Gmail Facebook X LinkedIn More