Evaluating the usage of Dynamic Programming in Stereo Vision Algorithm Optimization

12 October 2022, Version 1
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

In modern research, the most studied step of stereo vision algorithms is the process of pixel correspondence, better known as stereo matching. As of now, researchers are attempting to integrate optimization techniques with stereo matching to improve stereo system performance. This paper seeks to provide an in-depth explanation of the stereo vision process in general and find value in the application of optimization techniques to stereo-matching algorithms. To analyze and implement a sound stereo vision algorithm as well as an optimized matching algorithm, scholarly sources involving stereo vision and optimization techniques were studied. After implementing a standard stereo-matching algorithm and an algorithm that involves a famous optimization technique known as Dynamic Programming, I found that there was a significant increase in both accuracy and efficiency in the depth estimates provided by the algorithm.

Keywords

Computer Vision
Dynamic Programming
Optimization
Stereo Vision
Algorithms

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.