Dynamic programming based stereo matching after locating two end points

2005 ◽  
Author(s):  
Y. Yamada ◽  
S. Kuroe ◽  
I. Nose
Keyword(s):  
Dynamic Programming ◽  
Stereo Matching ◽  
End Points

Efficient interscanline consistency enforcing method for dynamic programming-based dense stereo matching algorithms

2013 ◽  
Vol 22 (4) ◽  
pp. 043028 ◽  
Author(s):  
Behzad Salehian ◽  
Abolghasem A. Raie ◽  
Ali M. Fotouhi ◽  
Meisam Norouzi
Keyword(s):  
Dynamic Programming ◽  
Stereo Matching ◽  
Dense Stereo Matching

Stereo Matching Algorithm Based on Phase Dynamic Programming in 3D Profile Measurement

2010 ◽  
Vol 139-141 ◽  
pp. 2046-2050 ◽  
Author(s):  
Xiao Hui Liu ◽  
Kai Yong Jiang ◽  
Jun Yi Lin
Keyword(s):  
Dynamic Programming ◽  
Stereo Matching ◽  
High Reliability ◽  
Optimal Path ◽  
Gray Code ◽  
Absolute Difference ◽  
Profile Measurement ◽  
Phase Dynamic ◽  
Data Point ◽  
Matching Strategy

A New Stereo Matching Method Based Phase Dynamic Programming (PDP) is presented in this paper. This method, based on gray code value and phase value, implements stereo matching through finding an optimal path on a 2D plane composed of cross phase absolute difference in the same gray region. Before matching, mask-image is adopted to reduce matching data point. During matching, the matching strategy is optimized by adopting sequence consistency technique as well as defining the path orientation. After matching, the error data point is eliminated by matching consistency and median filtering based disparity. Finally, experimental results show this algorithm can get a better performance. Matching process of PDP is simple but effective than others. It not only can get continuous and dense parallax but also eliminate effects of noise and the reconstructive object has high reliability, better authenticity and high precision.

Stereo Matching Algorithm Based on Pyramid Double Dynamic Programming

2014 ◽  
Vol 981 ◽  
pp. 352-355 ◽  
Author(s):  
Ji Zhou Wei ◽  
Shu Chun Yu ◽  
Wen Fei Dong ◽  
Chao Feng ◽  
Bing Xie
Keyword(s):  
Dynamic Programming ◽  
High Resolution ◽  
Stereo Matching ◽  
Control Points ◽  
Low Resolution ◽  
Matching Algorithm ◽  
Resolution Image ◽  
High Resolution Images ◽  
Candidate Control ◽  
Low Resolution Images

A stereo matching algorithm was proposed based on pyramid algorithm and dynamic programming. High and low resolution images was computed by pyramid algorithm, and then candidate control points were stroke on low-resolution image, and final control points were stroke on the high-resolution images. Finally, final control points were used in directing stereo matching based on dynamic programming. Since the striking of candidate control points on low-resolution image, the time is greatly reduced. Experiments show that the proposed method has a high matching precision.

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

Sign in / Sign up

Export Citation Format

Share Document