Fast and Robust Semi-Local Stereo Matching Using Possibility Distributions

Abstract : Global stereo matching methods aim to reduce the sensibility of stereo correspondence to ambiguities caused by occlusions, poor local texture or fluctuation of illumination. However, when facing the problem of real-time stereo matching, as in robotic vision, local algorithms are known to be the best. In this paper, we propose a semi-local stereo matching algorithm (SLSM algorithm); an area-based method that embodies global matching constraints in the matching score. Our approach uses a fuzzy formularisation of the similarity assumption in order to define a matching possibility distribution. An unmatching possibility distribution is defined by applying global constraints to the matching possibility distribution. The final matching cost is computed using the two possibility distributions. Experimental results and comparison with other existing algorithms are presented to demonstrate the performance and effectiveness of our approach.
Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00738216
Contributor : Haythem Ghazouani <>
Submitted on : Wednesday, October 3, 2012 - 5:26:56 PM
Last modification on : Thursday, April 4, 2019 - 10:18:07 AM
Long-term archiving on: Friday, January 4, 2013 - 3:59:02 AM

File

X_GHAZOUANI.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Haythem Ghazouani, Moncef Tagina, René Zapata. Fast and Robust Semi-Local Stereo Matching Using Possibility Distributions. International Journal of Computational Vision and Robotics, Inderscience, 2011, 2 (3), pp.237-253. ⟨10.1504/IJCVR.2011.042841⟩. ⟨lirmm-00738216⟩

Share

Metrics

Record views

328

Files downloads

650