By Topic

Dynamic search range using sparse disparity map for fast 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

4 Author(s)
Chan-oh Park ; Sch. of Inf. & Commun., Sungkyunkwan Univ., Suwon, South Korea ; Jun-Hoe Heo ; Dong-Hun Lee ; Jun Dong Cho

In this paper, we have suggested a dynamic search range method to reduce a matching cost of the local stereo matching process basing on the sparse representation theory. The suggested method analyzes sparse disparity map, generating the valid search range information and then using the analyzed information skip the region where the matching blocks are not likely to be found in a dense disparity map acquisition step. Also considering for the solution of accuracy decline, we have offered some parameters to adjust speed and accuracy trade-off. Through experimental result, we have showed that the suggested algorithm reduces computation time 40% to 70% with a acceptable accuracy loss. The proposed algorithm can be applied to any local stereo matching algorithm. Also our algorithm is designed to be hardware friendly by lowering the hardware resource requirement and memory bandwidth.

Published in:

Broadband Multimedia Systems and Broadcasting (BMSB), 2012 IEEE International Symposium on

Date of Conference:

27-29 June 2012