Dynamic search range using sparse disparity map for fast stereo matching

Abstract

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… (More)
DOI: 10.1109/BMSB.2012.6264306

8 Figures and Tables

Cite this paper

@article{Park2012DynamicSR, title={Dynamic search range using sparse disparity map for fast stereo matching}, author={Chan-Oh Park and Jun-Hoe Heo and Dong-Hun Lee and Jun-Dong Cho}, journal={IEEE international Symposium on Broadband Multimedia Systems and Broadcasting}, year={2012}, pages={1-4} }