Computing Visual Correspondence with Occlusions via Graph Cuts

Several new algorithms for visual correspondence based on graph cuts [6, 13, 16] have recently been developed. While these methods give very strong results in practice, they do not handle occlusions properly. Specifically, they treat the two input images asymmetrically, and they do not ensure that a pixel corresponds to at most one pixel in the other image. In this paper, we present two new methods which properly address occlusions, while preserving the advantages of graph cut algorithms. We give experimental results for stereo as well as motion, which demonstrate that our methods perform well both at detecting occlusions and computing disparities. 1 

• Type: Conference
• Year: 2001
• Where: ICCV
• Authors: Vladimir Kolmogorov, Ramin Zabih
• Keywords: Computer Vision, Graph Cut Algorithms, Graph Cuts, ICCV 2001