Computing stereo correspondences in the presence of narrow occluding objects

Contemporary stereo correspondence algorithms disambiguate multiple candidate matches by using a spatial hierarchy mechanism. Narrow occluding objects in 3-D scenes cannot be handled by the spatial hierarchy mechanism alone. The authors propose a dynamic disparity search (DDS) framework that combines the spatial hierarchy mechanism with a new disparity hierarchy mechanism, to reduce the stereo matching errors caused by narrow occluding objects. They demonstrate the merits of the DDS approach on real stereo images.<>