Gong Minglun, Yang Yee-Hong
IEEE Trans Image Process. 2007 Mar;16(3):879-84. doi: 10.1109/tip.2006.891344.
A novel algorithm is presented in this paper for estimating reliable stereo matches in real time. Based on the dynamic programming-based technique we previously proposed, the new algorithm can generate semi-dense disparity maps using as few as two dynamic programming passes. The iterative best path tracing process used in traditional dynamic programming is replaced by a local minimum searching process, making the algorithm suitable for parallel execution. Most computations are implemented on programmable graphics hardware, which improves the processing speed and makes real-time estimation possible. The experiments on the four new Middlebury stereo datasets show that, on an ATI Radeon X800 card, the presented algorithm can produce reliable matches for 60% approximately 80% of pixels at the rate of 10 approximately 20 frames per second. If needed, the algorithm can be configured for generating full density disparity maps.
本文提出了一种新颖的算法，用于实时估计可靠的立体匹配。基于我们之前提出的基于动态规划的技术，新算法使用最少两次动态规划遍历就能生成半密集视差图。传统动态规划中使用的迭代最佳路径追踪过程被局部最小值搜索过程所取代，使得该算法适合并行执行。大部分计算在可编程图形硬件上实现，这提高了处理速度并使实时估计成为可能。在四个新的Middlebury立体数据集上进行的实验表明，在ATI Radeon X800显卡上，所提出的算法能够以每秒10至20帧的速度为大约60%至80%的像素生成可靠的匹配。如果需要，该算法可以配置为生成全密度视差图。
