Symmetric Stereo Matching for Occlusion Handling

In this paper, we propose a symmetric stereo model to handle occlusion in dense two-frame stereo. Our occlusion reasoning is directly based on the visibility constraint that is more general than both ordering and uniqueness constraints used in previous work. The visibility constraint requires occlusion in one image and disparity in the other to be consistent. We embed the visibility constraint within an energy minimization framework, resulting in a symmetric stereo model that treats left and right images equally. An iterative optimization algorithm is used to approximate the minimum of the energy using belief propagation. Our stereo model can also incorporate segmentation as a soft constraint. Experimental results on the Middlebury stereo images show that our algorithm is state-of-the-art.

• Type: Conference
• Year: 2005
• Where: CVPR
• Authors: Jian Sun, Yin Li, Sing Bing Kang
• Keywords: Computer Vision, CVPR 2005, Stereo Model, Symmetric Stereo Model, Visibility Constraint