Disparity space image-based stereo matching using optimal path searching

2003 ◽  
Author(s):  
Chul-Hwan Kim ◽  
Ho-Keun Lee ◽  
Yeong-Ho Ha
Keyword(s):  
Stereo Matching ◽  
Optimal Path ◽  
Disparity Space Image ◽  
Disparity Space ◽  
Space Image

A Improved Stereo Matching Fast Algorithm Based on Dynamic Programming

2012 ◽  
Vol 531-532 ◽  
pp. 657-661
Author(s):  
Zi Wei Zhou ◽  
Ge Li ◽  
Chang Le Li ◽  
Ji Zhuang Fan
Keyword(s):  
Dynamic Programming ◽  
Stereo Matching ◽  
Computation Time ◽  
Local Algorithm ◽  
Color Feature ◽  
Line Segments ◽  
Gaussian Pyramid ◽  
Scan Line ◽  
Disparity Space Image ◽  
Disparity Space

Compared with the local algorithm in stereo matching, the high quality disparity space image is calculated by the global algorithm, which is difficult to use in practical application for its long computation time. The dynamic programming is one of the global algorithms with a fast matching speed, but it has strip blemish in matching result. In this paper, a new dynamic programming based method is proposed to accelerate the matching speed and improve the matching quality. Firstly, the color feature of two images are calculated using the Laplacians of Gaussian pyramid algorithm, and the color feature of the image pair obtained are matched. Secondly, the matching points are taken as the ground control points of the scan line, which is cut into several short line segments. Finally, all line segments are matched to obtain the disparity of the scan line. The experimental results show that the matching speed is accelerated greatly with improved disparity image quality

scholarly journals LOCK-FREE MULTITHREADED SEMI-GLOBAL MATCHING WITH AN ARBITRARY NUMBER OF PATH DIRECTIONS

2020 ◽  
Vol V-2-2020 ◽  
pp. 143-150
Author(s):  
D. Frommholz
Keyword(s):  
Arbitrary Number ◽  
Ground Truth ◽  
Multiple Data ◽  
Reduced Height ◽  
Global Matching ◽  
Path Cost ◽  
Disparity Space Image ◽  
The Cost ◽  
Disparity Space ◽  
Space Image

Abstract. This paper describes an efficient implementation of the semi-global matching (SGM) algorithm on multi-core processors that allows a nearly arbitrary number of path directions for the cost aggregation stage. The scanlines for each orientation are discretized iteratively once, and the regular substructures of the obtained template are reused and shifted to concurrently sum up the path cost in at most two sweeps per direction over the disparity space image. Since path overlaps do not occur at any time, no expensive thread synchronization will be needed. To further reduce the runtime on high counts of path directions, pixel-wise disparity gating is applied, and both the cost function and disparity loop of SGM are optimized using current single instruction multiple data (SIMD) intrinsics for two major CPU architectures. Performance evaluation of the proposed implementation on synthetic ground truth reveals a reduced height error if the number of aggregation directions is significantly increased or when the paths start with an angular offset. Overall runtime shows a speedup that is nearly linear to the number of available processors.

Sign in / Sign up

Export Citation Format

Share Document