Fast and robust semi-local stereo matching using possibility distributions Online publication date: Thu, 06-Oct-2011
by Haythem Ghazouani; Moncef Tagina; René Zapata
International Journal of Computational Vision and Robotics (IJCVR), Vol. 2, No. 3, 2011
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Vision and Robotics (IJCVR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook