A Study of Disparity Map Based on Improved Dynamic Programming Algorithm

2019 ◽  
Author(s):  
Ziwei Zhao ◽  
Yan Piao ◽  
Che Liu
Keyword(s):  
Dynamic Programming ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Disparity Map ◽  
Improved Dynamic Programming

Image Stereo Matching Based on Multi-Scale Plane Set

2013 ◽  
Vol 709 ◽  
pp. 527-533 ◽  
Author(s):  
Xin Hui Jiang ◽  
Shao Jun Yu ◽  
Xing Jiang
Keyword(s):  
Dynamic Programming ◽  
Stereo Matching ◽  
Structural Model ◽  
Dynamic Programming Algorithm ◽  
Programming Method ◽  
Programming Algorithm ◽  
Dynamic Programming Method ◽  
Disparity Map ◽  
Matching Method ◽  
Multi Scale

The disparity map of dynamic programming method is poor. To overcome it, a stereo matching method based on multi-scale plane set is proposed in this paper. This method converts the structural model into the plane set. Define the key plane. Then the key planes are in a high-scale. The other planes are in the low scale. Stereo matching the multi-scale plane set using dynamic programming method. The experimental results show that: this method can solve the dynamic programming algorithm`s problem that disparity map has low matching accuracy and a lot of stripes error.

An Improved Dynamic Programming Algorithm for Bitonic TSP

2013 ◽  
Vol 347-350 ◽  
pp. 3094-3098 ◽  
Author(s):  
Jian Li
Keyword(s):  
Dynamic Programming ◽  
Time Complexity ◽  
Dynamic Programming Algorithm ◽  
Space Complexity ◽  
Programming Algorithm ◽  
Time And Space ◽  
Space Requirement ◽  
Classical Algorithm ◽  
Computing Speed ◽  
Improved Dynamic Programming

This paper puts forward an improved dynamic programming algorithm for bitonic TSP and it proves to be correct. Divide the whole loop into right-and-left parts through analyzing the key point connecting to the last one directly; then construct a new optimal sub-structure and recursion. The time complexity of the new algorithm is O(n2) and the space complexity is O(n); while both the time and space complexities of the classical algorithm are O(n2). Experiment results showed that the new algorithm not only reduces the space requirement greatly but also increases the computing speed by 2-3 times compared with the classical algorithm.

Sign in / Sign up

Export Citation Format

Share Document