Sciweavers

Share
CVPR
2006
IEEE

Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation and Occlusion Handling

9 years 10 months ago
Stereo Matching with Color-Weighted Correlation, Hierarchical Belief Propagation and Occlusion Handling
In this paper, we formulate an algorithm for the stereo matching problem with careful handling of disparity, discontinuity and occlusion. The algorithm works with a global matching stereo model based on an energyminimization framework. The global energy contains two terms, the data term and the smoothness term. The data term is first approximated by a color-weighted correlation, then refined in occluded and low-texture areas in a repeated application of a hierarchical loopy belief propagation algorithm. The experimental results are evaluated on the Middlebury data set, showing that our algorithm is the top performer.
Qingxiong Yang, Liang Wang, Ruigang Yang, Henrik S
Added 12 Oct 2009
Updated 12 Oct 2009
Type Conference
Year 2006
Where CVPR
Authors Qingxiong Yang, Liang Wang, Ruigang Yang, Henrik Stewénius, David Nistér
Comments (0)
books