Simple but Effective Tree Structures for Dynamic Programming-Based Stereo Matching
Simple but Effective Tree Structures for Dynamic Programming-Based Stereo Matching
复制标题
DOI：
10.5220/0001072904150422
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
M. Bleyer;M. Gelautz
中科院分区：
文献类型：
--
作者：
M. Bleyer;M. Gelautz
这项工作描述了一种快速的方法，用于计算密集的立体对应，能够产生的结果接近国家的最先进的。我们建议运行一个单独的视差计算过程中的每个图像像素。其思想是在需要重建视差的像素上建立树图。因此，该树形成该特定像素的标准四连接网格的个体近似。通过动态规划（DP）确定所应用的树结构上的预定义能量函数的精确最优值，并且将根像素分配给最优成本的差异。我们提出了两个简单的树结构，允许所有树的最优值的有效计算，只有四个基于扫描线的DP通过。这些简单的树被设计为捕获参考帧的所有像素，并结合水平和垂直平滑边缘，以削弱基于DP的方法中固有的扫描线条纹问题。我们使用Middlebury测试集来评估我们的结果。我们的算法目前在Middlebury数据库中的大约30种算法中排名第八。更重要的是，它是目前性能最好的方法，不使用图像分割，并且比大多数竞争算法快得多。我们的方法需要不到一秒钟的时间来确定典型立体对的视差图。
This work describes a fast method for computing dense stereo correspondences that is capable of generating results close to the state-of-the-art. We propose running a separate disparity computation process in each image pixel. The idea is to root a tree graph on the pixel whose disparity needs to be reconstructed. The tree thereby forms an individual approximation of the standard four-connected grid for this specific pixel. An exact optimum of a predefined energy function on the applied tree structure is determined via dynamic programming (DP), and the root pixel is assigned to the disparity of optimal costs. We present two simple tree structures that allow for the efficient calculation of all trees’ optima with only four scanline-based DP passes. These simple trees are designed to capture all pixels of the reference frame and incorporate horizontal and vertical smoothness edges in order to weaken the scanline streaking problem inherent in DP-based approaches. We evaluate our results using the Middlebury test set. Our algorithm currently ranks at the eighth position of approximately 30 algorithms in the Middlebury database. More importantly, it is the currently best-performing method that does not use image segmentation and is significantly faster than most competing algorithms. Our method needs less than a second to determine the disparity map for typical stereo pairs.