Stereo Matching Algorithm Using a Simplified Trellis Diagram Iteratively and Bi-Directionally

Tran Thai SON; Seiichi MITA

doi:10.1093/ietisy/e89-d.1.314

Stereo Matching Algorithm Using a Simplified Trellis Diagram Iteratively and Bi-Directionally

Tran Thai SON, Seiichi MITA

Full Text Views

0

Cite this

Summary :

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(N²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.

Publication: IEICE TRANSACTIONS on Information Vol.E89-D No.1 pp.314-325

Publication Date: 2006/01/01

Publicized

Online ISSN: 1745-1361

DOI: 10.1093/ietisy/e89-d.1.314

Type of Manuscript: PAPER

Category: Image Recognition, Computer Vision

Cite this

Copy

Tran Thai SON, Seiichi MITA, "Stereo Matching Algorithm Using a Simplified Trellis Diagram Iteratively and Bi-Directionally" in IEICE TRANSACTIONS on Information, vol. E89-D, no. 1, pp. 314-325, January 2006, doi: 10.1093/ietisy/e89-d.1.314.
Abstract: 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(N²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.
URL: https://global.ieice.org/en_transactions/information/10.1093/ietisy/e89-d.1.314/_p

Copy

@ARTICLE{e89-d_1_314,
author={Tran Thai SON, Seiichi MITA, },
journal={IEICE TRANSACTIONS on Information},
title={Stereo Matching Algorithm Using a Simplified Trellis Diagram Iteratively and Bi-Directionally},
year={2006},
volume={E89-D},
number={1},
pages={314-325},
abstract={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(N²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.},
keywords={},
doi={10.1093/ietisy/e89-d.1.314},
ISSN={1745-1361},
month={January},}

Copy

TY - JOUR
TI - Stereo Matching Algorithm Using a Simplified Trellis Diagram Iteratively and Bi-Directionally
T2 - IEICE TRANSACTIONS on Information
SP - 314
EP - 325
AU - Tran Thai SON
AU - Seiichi MITA
PY - 2006
DO - 10.1093/ietisy/e89-d.1.314
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E89-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2006
AB - 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(N²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.
ER -