Stereo Matching Algorithm Using a Simplified Trellis Diagram Iteratively and Bi-Directionally
Stereo Matching Algorithm Using a Simplified Trellis Diagram Iteratively and Bi-Directionally
复制标题
DOI：
10.1093/ietisy/e89-d.1.314
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
T. T. Son-T.;S. Mita
中科院分区：
文献类型：
--
作者：
T. T. Son-T.;S. Mita
本文提出了一种方法，使用维特比算法的立体声对应问题。我们提出了一个匹配过程，这是可视化的网格图，找到最大的后验结果。匹配过程分为两个部分：左场景与右场景的匹配和右场景与左场景的匹配。通过比较两部分匹配过程的结果，以唯一性误差最小为原则选择最终的匹配结果。这使得立体匹配成为可能，而无需明确地检测遮挡。此外，该立体匹配算法可以提高视差图像的精度，它具有一个可接受的运行时间，因为它使用了一个网格图迭代和双向的实际应用。该算法的复杂度近似为O（N2 × P），其中N为视差个数，P为左右图像的核线长度。我们所提出的方法已被证明是强大的，当应用于著名的立体图像样本，如随机点，五角大楼，筑波图像等，它提供了一个95.7%的准确度半径为1（相差±1）的筑波图像。
This paper presents an approach that uses the Viterbi algorithm in a stereo correspondence problem. We propose a matching process which is visualized as a trellis diagram to find the maximum a posterior result. The matching process is divided into two parts: matching the left scene to the right scene and matching the right scene to the left scene. The last result of stereo problem is selected based on the minimum error for uniqueness by a comparison between the results of the two parts of matching process. This makes the stereo matching possible without explicitly detecting occlusions. Moreover, this stereo matching algorithm can improve the accuracy of the disparity image, and it has an acceptable running time for practical applications since it uses a trellis diagram iteratively and bi-directionally. The complexity of our proposed method is shown approximately as O(N2 × P), in which N is the number of disparity, and P is the length of the epipolar line in both the left and right images. Our proposed method has been proved to be robust when applied to well-known samples of stereo images such as random dot, Pentagon, Tsukuba image, etc. It provides a 95.7 percent of accuracy in radius 1 (differing by ±1) for the Tsukuba images.