By Topic

Improved adaptive stereo matching using double dynamic programming with correlation of row and column

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ming Zhao ; Coll. of Electron. & Inf., Eng., Beijing Univ. of Aeronaut. & Astronaut., Beijing, China ; Xiao-bai Li ; Rong-ling Lang

In a variety of stereo matching algorithms using dynamic programming algorithm can effectively improve the speed and accuracy with good real-time performance and easy realization. In this paper, with advantages of dynamic programming, we presents a stereo matching algorithm using double dynamic programming with correlation of row and column, which uses improved adaptive support-weight approach and energy minimization model to solve the optimization problem. In the solving process, different constructed values of data items given based on characters of variation in the column direction using row dynamic programming and the values of smoothness item in the column direction, to reduce apparent defective stripes, are used to get the final result using column dynamic programming. Experimental results used Middlebury database show that the proposed algorithm can reduce the overall matching error rates and apparent defective stripes and get a better stereo matching effect.

Published in:

Signal Processing Systems (ICSPS), 2010 2nd International Conference on  (Volume:3 )

Date of Conference:

5-7 July 2010