By Topic

Trellis-based parallel stereo matching

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

2 Author(s)
Yuns Oh ; Dept. of Electr. Eng., POSTECH, Pohang, South Korea ; Hong Jeong

We present a center-referenced basis for discrete representation of stereo correspondence that includes new occlusion nodes. This basis improves the inclusion of constraints and the parallelism of the final algorithm. Disparity estimation is formulated in a MAP context and natural constraints are incorporated, resulting in an optimal path problem in a sparsely connected trellis. Like other dynamic programming methods, the computational complexity is low at O(MN2) for M×N pixel images. However, this method is better suited to parallel solution, scaling up to O(MN) processors. Experimental results confirm the performance of this method

Published in:

Acoustics, Speech, and Signal Processing, 2000. ICASSP '00. Proceedings. 2000 IEEE International Conference on  (Volume:6 )

Date of Conference:

2000