Asymmetrical Occlusion Handling Using Graph Cut for Multi-View Stereo

Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel formulation that handles occlusion using only one depth map in an asymmetrical way. Consequently, multiview information is efficiently accumulated to achieve high accuracy. The resulting energy function is complex and approximate graph cut based solutions are proposed. Our approach complements the theory and extends the applicability of using graph cut in stereo. The experiments demonstrate that the approach is comparable with the state of the art and potentially more efficient for multi-view stereo. keywords : stereo, graph cut, occlusion

• Type: Conference
• Year: 2005
• Where: CVPR
• Authors: Yichen Wei, Long Quan
• Keywords: Approximate Graph Cut, Asymmetrical Way, Computer Vision, CVPR 2005, Multi-view Stereo