首页 | 本学科首页   官方微博 | 高级检索  
     

自适应窗口的时间规整立体匹配算法
引用本文:刘正东,杨静宇.自适应窗口的时间规整立体匹配算法[J].计算机辅助设计与图形学学报,2005,17(2):291-294.
作者姓名:刘正东  杨静宇
作者单位:南京理工大学计算机系,南京,210094
摘    要:针对立体视觉中图像对应点的误匹配问题,以时间规整算法(DTW)为基础,提出了自适应窗口的立体匹配算法.根据外极线的约束,在自适应窗口内采用灰度相关技术得到长度不相等的两个灰度段作为相容的匹配序列;利用动态规划法及连续性约束寻找一条最佳的匹配路径.根据回溯得到的匹配路径及其坐标值得到高密度视差图.实验结果表明,该算法具有较高的运行效率和良好的匹配效果.

关 键 词:计算机视觉  立体匹配  DTW  动态规划

Stereo Matching Algorithm Using Adaptive Windows-Constrained and DTW
Liu Zhengdong,Yang Jingyu.Stereo Matching Algorithm Using Adaptive Windows-Constrained and DTW[J].Journal of Computer-Aided Design & Computer Graphics,2005,17(2):291-294.
Authors:Liu Zhengdong  Yang Jingyu
Abstract:For solving the incorrect stereo matching problem of visual images, an adaptive windows-constrained stereo matching algorithm based on the dynamic time warping (DTW) is proposed in the paper. In this algorithm, we first find out a pair of compatible sequences from images according to the constraint epipolar. In searching the sequences, we use the technique of gray correlation in adaptive windows to obtain two matching sequences which may not have to be in the same lengths. Then, the dynamic programming (DP) method with DTW is used to find out an optimum matching path under the continuity constraint. Detailed disparity map can be obtained from the matching paths and the coordinates of the matching sequences in images. Experiments show that this algorithm is highly efficient in computation, and generates nice result of stereo matching.
Keywords:computer vision  stereo matching  DTW  dynamic programming
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号