基于行列双向约束的动态规划立体匹配算法

Dynamic programming stereo matching algorithm based on bidirectional constraints of row and column

为了克服传统的动态规划立体匹配算法会产生明显条纹状瑕疵的缺陷,提出一种同时考虑行列双向约束的动态规划立体匹配算法。该算法首先利用扫描线信息中所包含的视差不连续性和遮挡现象构造出一种新的全局能量代价函数;然后进一步设计了基于此能量代价函数的全局优化策略,在保证扫描线行方向上视差平滑性的基础上,解决了扫描线列方向上的视差不连续性问题;最后通过动态规划寻找最优路径来获得匹配点和遮挡点的视差,从而得到稠密视差图。实验结果表明,所提出的算法不但能够有效消除视差图中的条纹状瑕疵,而且在匹配精度上能够取得较好的效果。

In order to overcome the obvious stripe-like defects caused by traditional dynamic programming stereo matching algorithm, a dynamic programming stereo matching algorithm is proposed, which considers bidirectional constraints of row and column simultaneously. Firstly, a new global energy cost function is constructed using the disparity discontinuity and occlusion information in the scanlines. Then a global optimization strategy based on this energy cost function is designed. The disparity discontinuity problem in column direction of the scanline is solved on the basis of guaranteeing the disparity smoothness in row direction of the scanline. Finally, the disparity of both matched and occluded points are obtained through finding the optimal path using dynamic programming, and the dense disparity map is obtained. Experiment results show that the proposed algorithm can not only eliminate the stripe-like defects in the disparity map effectively, but also achieve better effect in matching precision.