Fast segmentation-based dense stereo from quasi-dense matching - Archive ouverte HAL Access content directly
Conference Papers Year : 2004

Fast segmentation-based dense stereo from quasi-dense matching

Abstract

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
Origin : Files produced by the author(s)

Dates and versions

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

Identifiers

  • HAL Id : hal-00118599 , version 1

Cite

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
81 View
48 Download

Share

Gmail Facebook Twitter LinkedIn More