By Topic

Local Stereo Matching with Edge-Based Cost Aggregation and Occlusion Handling

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)
Li-Li Cai ; Comput. Sci. & Technol. Dept., Shandong Univ., Jinan, China ; Ming Zhang

This paper presents a new local binocular stereo matching algorithm. A self-adapting matching score is used to measure the dissimilarity of two corresponding pixels. In matching cost aggregation step, we replace the cost of each pixel with the average cost of selected neighboring pixels based on edge pixels information to limit cost aggregation within the same segment, which can preserve the shape and size of the discontinuity boundary. In disparity refinement step, an occlusion model is set up and occluded pixels are detected based on the model to improve the disparity maps accuracy. Experimental results using the Middlebury stereo test bed demonstrate the good performance of our proposed approach.

Published in:

Image and Signal Processing, 2009. CISP '09. 2nd International Congress on

Date of Conference:

17-19 Oct. 2009