By Topic

Stereo Matching using Multi-Directional Dynamic Programming and Edge Orientations

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)
Min Chul Sung ; Seoul Nat. Univ., Seoul ; Sang Hwa Lee ; Nam Ik Cho

This paper proposes a stereo matching algorithm which employs an adaptive multi-directional dynamic programming (DP) scheme using edge orientations. A new energy function is defined in order to consider the discontinuity of disparity and occlusions, which is minimized by the multi-directional DP scheme. Chain codes are introduced to find the accurate edge orientations which provide the DP scheme with optimal multidirectional paths. The proposed algorithm eliminates the streaking problem of conventional DP based algorithms, and estimates more accurate disparity information in boundary areas. The experimental results using the Middlebury stereo images [7] demonstrate that our algorithm shows better performance than previous DP based approaches.

Published in:

Image Processing, 2007. ICIP 2007. IEEE International Conference on  (Volume:1 )

Date of Conference:

Sept. 16 2007-Oct. 19 2007