光学学报, 2016, 36 (4): 0415001, 网络出版: 2016-04-13   

基于改进Census 变换和动态规划的立体匹配算法 下载: 838次

Stereo Matching Algorithm Based on Improved Census Transform and Dynamic Programming
作者单位
北京航空航天大学仪器科学与光电工程学院, 北京 100191
摘要
为降低双目立体匹配算法在视差不连续区域和噪声干扰情况下的误匹配率,提出了一种基于改进Census变换和动态规划的立体匹配算法。采用支持区域为十字交叉形状窗口且设有噪声容限的改进Census 变换进行代价计算,提高了单像素匹配代价的可靠性;利用引导图滤波器快速有效地完成代价聚合;在视差选择阶段,设计了一种改进的动态规划算法,消除了扫描线效应,提高了匹配速度和正确率;经过视差后处理得到最终视差图。实验结果表明,该算法在Middlebury测试平台上的平均误匹配率为5.31%,在低纹理区域和视差不连续区域均能得到准确的视差,运算复杂度低且具有较好的稳健性。
Abstract
In order to reduce the mismatching rate of binocular stereo matching algorithm in the disparity discontinuity region and under noise disturbance, a stereo matching algorithm based on improved Census transform and dynamic programming is proposed. An improved Census transform with a noise margin is applied to compute the cost based on a cross shape support region. The reliability of single pixel matching cost is enhanced. The guided image filter is used to aggregate the cost volume fast and efficiently. In the disparity selecting step, an improved dynamic programming algorithm is designed to eliminate the scan-line effect and improve the matching speed and accuracy. The final disparity maps are gained after post-processing. The experimental results demonstrate that the proposed algorithm evaluated on the Middlebury benchmark achieves an average error rate of 5.31% , and the accurate disparity can be obtained in both low texture and disparity discontinuity regions with low computing complexity and strong robustness.

祝世平, 闫利那, 李政. 基于改进Census 变换和动态规划的立体匹配算法[J]. 光学学报, 2016, 36(4): 0415001. Zhu Shiping, Yan Lina, Li Zheng. Stereo Matching Algorithm Based on Improved Census Transform and Dynamic Programming[J]. Acta Optica Sinica, 2016, 36(4): 0415001.

本文已被 17 篇论文引用
被引统计数据来源于中国光学期刊网
引用该论文: TXT   |   EndNote

相关论文

加载中...

关于本站 Cookie 的使用提示

中国光学期刊网使用基于 cookie 的技术来更好地为您提供各项服务,点击此处了解我们的隐私策略。 如您需继续使用本网站,请您授权我们使用本地 cookie 来保存部分信息。
全站搜索
您最值得信赖的光电行业旗舰网络服务平台!