Evaluation Of Stereo Matching Algorithms And Dynamic Programming For 3D Triangulation
A good result of triangulation or known as Three-Dimensional (3D) is depending on the smoothness of the disparity depth map that obtained from the stereo matching algorithms. The smoother the disparity depth map, the better results of triangulation can be achieved. This paper presents the evaluation...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book Section |
| Language: | English |
| Published: |
Springer International Publishing AG
2014
|
| Subjects: | |
| Online Access: | http://eprints.utem.edu.my/id/eprint/20015/2/ICOCOE2014_v1.pdf http://eprints.utem.edu.my/id/eprint/20015/ https://link.springer.com/chapter/10.1007/978-3-319-07674-4_60 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknikal Malaysia Melaka |
| Language: | English |
| Summary: | A good result of triangulation or known as Three-Dimensional (3D) is depending on the smoothness of the disparity depth map that obtained from the stereo matching algorithms. The smoother the disparity depth map, the better results of triangulation can be achieved. This paper presents the evaluation of the existing stereo matching algorithms in the aspects of the speed of computational on depth map obtained. The stereo matching algorithms that we applied for experimental purpose are basic block matching, sub-pixel accuracy and dynamic programming. The dataset of stereo images that used for the experimental purpose are obtained from Middlebury Stereo Datasets. This research is to provide an idea on choosing the better stereo matching algorithms to work on the disparity depth map for the purpose of 3D triangulation applications, as the good result of 3D triangulation is depending on how smooth is the disparity depth map can be obtained. |
|---|