Stereo Matching with Color-Weighted Correlation, Hierachical Belief Propagation and Occlusion Handling
Stereo Matching with Color-Weighted Correlation, Hierachical Belief Propagation and Occlusion Handling
复制标题
DOI：
10.1109/cvpr.2006.292
复制
发表时间：
2006-06
期刊：
影响因子：
--
通讯作者：
Qingxiong Yang;Liang Wang;Ruigang Yang;Henrik Stewénius;D. Nistér
中科院分区：
文献类型：
--
作者：
Qingxiong Yang;Liang Wang;Ruigang Yang;Henrik Stewénius;D. Nistér
本文提出了一种处理视差、不连续和遮挡的立体匹配算法。该算法采用基于能量最小化框架的全局匹配立体模型。全局能量包含两项，数据项和平滑项。数据项首先通过颜色加权相关性进行近似，然后通过重复应用分层循环信念传播算法在遮挡和低纹理区域进行细化。在Middlebury数据集上对实验结果进行了评估，结果表明我们的算法是性能最好的。
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 energy- minimization 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.