| 基于垂直性约束的动态规划立体匹配算法 |
| |
| 引用本文： | 曹义,王敬东,李鹏.基于垂直性约束的动态规划立体匹配算法[J].红外技术,2008,30(12). |
| |
| 作者姓名： | 曹义 王敬东 李鹏 |
| |
| 作者单位： | 南京航空航天大学自动化学院,江苏南京,210016 |
| |
| 摘 要： | 针对传统的DP算法存在条纹瑕疵,提出了一种改进的垂直性约束动态规划立体匹配算法,通过利用扫描线间的相关信息来约束动态规划过程,使得处理每一条扫描线时都能充分利用以前扫描线的匹配信息.实验结果表明,该算法可以明显地消除传统DP算法的视差图的条纹瑕疵,匹配精度高,而且执行时间短.
|
| 关 键 词： | 立体匹配 动态规划 垂直性约束 视觉导航 |
Dynamic Programming Stereo Matching Algorithm Based on Vertical Constraint |
| |
| CAO Yi,WANG Jing-dong,LI Peng.Dynamic Programming Stereo Matching Algorithm Based on Vertical Constraint[J].Infrared Technology,2008,30(12). |
| |
| Authors: | CAO Yi WANG Jing-dong LI Peng |
| |
| Affiliation: | CAO Yi,WANG Jing-dong,LI Peng (College of Automation Engineering,Nanjing University of Aeronautics , Astronautics,Nanjing Jiangsu 210016,China) |
| |
| Abstract: | To solve the problem of horizontal streaks caused by traditional DP-based stereo matching algorithm, dynamic programming stereo matching algorithm based on vertical constraint is proposed. Constraining dynamic programming by use of relevant information between scan lines, we can process each scan line by using previous matching information. Experiments show that the method can alleviate the effect of horizontal steaks and have a high matching-rate and a fast speed. |
| |
| Keywords: | stereo matching dynamic programming vertical constraint visual navigation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
