文献类型：期刊文献

中文题名：一种基于多邻域非线性扩散的动态规划全局立体匹配算法

英文题名：A Dynamic Programming Global Stereo Matching Algorithm Based on Multiple Neighbors' Nonlinear Diffusion

作者：耿冬冬[1];罗娜[1]

机构：[1]华东理工大学化工过程先进控制和优化技术教育部重点实验室,上海200237

年份：2017

卷号：43

期号：5

起止页码：677

中文期刊名：华东理工大学学报（自然科学版）

外文期刊名：Journal of East China University of Science and Technology

收录：北大核心:【北大核心2014】；CSCD:【CSCD_E2017_2018】；

基金：国家自然科学基金(61403140);上海市自然科学基金(13ZR1411500)

语种：中文

中文关键词：动态规划;立体匹配;非线性扩散;视差;代价叠加

外文关键词：dynamic programming; stereo matching;nonlinear diffusion;disparity;costs aggregation

摘要：双目立体视觉匹配通过两幅具有一定视差的图像获得精确、稠密的视差图。为了解决动态规划立体匹配算法橫条纹瑕疵以及精度低的问题,提出了一种基于多邻域非线性扩散的立体匹配算法。该算法采用AD测度函数构建视差空间,根据行列像素之间的约束关系,基于非线性扩散的代价聚合方法,通过图像边缘的动态优化寻求全局能量函数最优值得到稠密视差图。在Middlebury测试集上的实验结果表明,该算法的平均误匹配率为5.60%,相比IIDP动态规划全局匹配算法,精度提高了39.9%,有效地解决了横向条纹问题,改善了边缘模糊情况,且提升了算法的稳定性。与其他全局匹配算法相比,本文算法误匹配率降低了38.2%,在图像参数的11个指标中有9项指标排名第1。
Binocular stereo matching can obtain the accuracy and dense disparity map by comparing two images. However, the utilization of dynamic programming algorithms may resutt in some shortcomings % such as stripe-like and low accuracy. Aiming these problems, this paper proposes a new stereo matchingalgorithm based on multiple neighbors^ nonlinear diffusion. Firstly,absolute difference test method is usedto build disparity space image in raw costs computation period. And then, according to the constraintrelation between rows and columns, multiple neighbors’ nonlinear diffusion of costs aggregation isproposed to improve the global costs function. Finally,dense disparity maps during the global optimization process are obtained by the edges-optimized DP optimization. The experiment results via images show that the proposed algorithm attains the average PBM 5. 60% and than HDP. Moreover, the problem of stripe-like is well solved and the edge-blurring is also improved.Compared with other global matching methods,the proposed algorithm reduces PBM by 38. 2% and has 9 of 11 indexes to rank the first.