A Constant-Space Belief Propagation Algorithm for Stereo Matching

In this paper, we consider the problem of stereo matching using loopy belief propagation. Unlike previous methods which focus on the original spatial resolution, we hierarchically reduce the disparity search range. By fixing the number of disparity levels on the original resolution, our method solves the message updating problem in a time linear in the number of pixels contained in the image and requires only constant memory space. Specifically, for a 800

• Type: Conference
• Year: 2010
• Where: CVPR
• Authors: Qingxiong Yang, Liang Wang, Narendra Ahuja
• Keywords: Computer Vision, CVPR 2010, Disparity Search Range, Loopy Belief Propagation, Original Spatial Resolution