Performance Analysis between Basic Block Matching and Dynamic Programming of Stereo Matching Algorithm

Authors

  • Maged Aboali Machine Learning and Signal Processing (MLSP) Research Group, Center of Telecommunication Research & Innovation (CETRI), Fakulti Kejuruteraan Elektronik Dan Kejuruteraan Komputer (FKEKK), Universiti Teknikal Malaysia Melaka (UTeM), Malaysia.
  • Nurulfajar Abd Manap Machine Learning and Signal Processing (MLSP) Research Group, Center of Telecommunication Research & Innovation (CETRI), Fakulti Kejuruteraan Elektronik Dan Kejuruteraan Komputer (FKEKK), Universiti Teknikal Malaysia Melaka (UTeM), Malaysia.
  • Abd Majid Darsono Machine Learning and Signal Processing (MLSP) Research Group, Center of Telecommunication Research & Innovation (CETRI), Fakulti Kejuruteraan Elektronik Dan Kejuruteraan Komputer (FKEKK), Universiti Teknikal Malaysia Melaka (UTeM), Malaysia.
  • Zulkalnain Mohd Yusof Machine Learning and Signal Processing (MLSP) Research Group, Center of Telecommunication Research & Innovation (CETRI), Fakulti Kejuruteraan Elektronik Dan Kejuruteraan Komputer (FKEKK), Universiti Teknikal Malaysia Melaka (UTeM), Malaysia.

Keywords:

Basic Block Matching (BBM) algorithms, disparity map accuracy Dynamic Programming (DP), Performance analysis,

Abstract

One of the most important key steps of stereo vision algorithms is the disparity map implementation, where it generally utilized to decorrelate data and recover 3D scene framework of stereo image pairs. However, less accuracy of attaining the disparity map is one of the challenging problems on stereo vision approach. Thus, various methods of stereo matching algorithms have been developed and widely investigated for implementing the disparity map of stereo image pairs including the Dynamic Programming (DP) and the Basic Block Matching (BBM) methods. This paper mainly presents an evaluation between the Dynamic Programming (DP) and the Basic Block Matching (BBM) methods of stereo matching algorithms in term of disparity map accuracy, noise enhancement, and smoothness. Where the Basic Block Matching (BBM) is using the Sum of Absolute Difference (SAD) method in this research as a basic algorithm to determine the correspondence points between the target and reference images. In contrast, Dynamic Programming (DP) has been used as a global optimization approach. Besides, there will be a performance analysis including graphs results from both methods presented in this paper, which can show that both methods can be used on many stereo vision applications.

Downloads

Published

2017-09-27

How to Cite

Aboali, M., Abd Manap, N., Darsono, A. M., & Mohd Yusof, Z. (2017). Performance Analysis between Basic Block Matching and Dynamic Programming of Stereo Matching Algorithm. Journal of Telecommunication, Electronic and Computer Engineering (JTEC), 9(2-13), 7–16. Retrieved from https://jtec.utem.edu.my/jtec/article/view/2558