检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:门宇博 马宁[1,2] 张国印[1] 李香[1] 门朝光[1] 孙鹏飞[2]
机构地区:[1]哈尔滨工程大学计算机科学与技术学院,哈尔滨150001 [2]哈尔滨师范大学计算机科学与信息工程学院,哈尔滨150001
出 处:《哈尔滨工业大学学报》2015年第3期60-65,共6页Journal of Harbin Institute of Technology
基 金:国家自然科学基金(61100004);黑龙江省自然科学基金(F201320)
摘 要:针对传统稠密立体匹配方法在非纹理区、深度不连续处和遮挡处存在错误匹配率过高的问题,提出一种基于非参数变换和改进动态规划相结合的立体匹配算法.采用稀疏非参数变换相关方法计算初始局部匹配代价,并利用行列双向约束动态规划算法对匹配代价进行全局优化,在获取初始视差后分别对原始图像每一像素点进行可信性与纹理性检测,最后利用视差平面拟合结果代替非纹理与非可信区域像素点的原始视差,得到稠密视差图.实验表明,该算法具有较高的鲁棒性与匹配精度,尤其在处理图像的非纹理区、深度不连续处和遮挡处,可获得精确的匹配结果.A stereo matching algorithm based on Census transform and improved dynamic programming is proposed to the problems of traditional dense stereo matching methods, which have high false matching rate in the textureless areas, depth discontinuities and occlusion. The initial local matching cost is calculated by sparse Census transform correlation, and the raw cost is also optimized by a dynamic programming method by involvoing bidirectional constraints of row and column simultaneously. Meanwhile, the confidence and texture of each pixel are measured for reference image. Finally, the disparities of non-confident or textureless pixels are estimated by fitting parameters of a plane model for the corresponding segment, and the dense disparity map was obtained as well. Experiment results demonstrate that the proposed algorithm achieves high matching accuracy and robustness, especially in the textureless areas, depth discontinuities, and occlusion as well.
关 键 词:立体匹配 Census变换 动态规划 双向约束 视觉导航
分 类 号:TP391.41[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.116.230.250