本文提出了一种改进的立体匹配方法，通过调整代价矩阵计算中的惩罚参数，并利用图像边界信息重构最优路径，有效减少了条纹效应。在Middlebury数据集上实验表明，新方法的偏差误差率降低至6.33%，排名提升至29，优于先前的动态规划算法。
摘要：
- . , . . , . Middlebury 6.33% 29 . .
The dynamic programming based methods, a kind of globally optimizing stereo matching methods, has the inherent advantage that the occlusion regions can be found during the process. But it also has a serious drawback of streaking phenomena. This paper focuses on reducing the streaking phenomena by adjusting the penalties in calculating the cost matrix and re-establishing the optimal path in the back-tracing process using the boundary information of the image. Especially we use a pixel expansion method in re-establishing the path, which is the results from expanding the pixel information of the ones just left the boundaries. Experiments with the four image pairs provided by the Middlebury site showed the results that the proposed method has the disparity error ratio of 6.33% and the rank is 29, which is competitive to the best method among the previously published dynamic programming based methods.
展开
扫一扫
6553
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
