@inproceedings{1b092082d6c84580a6c6e7f1c9375b98,
title = "Fast algorithm for local stereo matching in disparity estimation",
abstract = "The typical local stereo matching for disparity estimation can deliver accurate disparity maps by a well-designed cost aggregation method, but usually suffers from natively high computational complexity due to its dense processing. To address it, we propose a fast algorithm with search point reduction on spatial and disparity domains to generate a sparse search map. The sparse search map guides the local stereo matching to produce a sparse disparity map, and then it is recovered to a dense disparity map. The experimental results show the proposed fast algorithm could reduce the computation time to 8.8% of original algorithm for 2-megapixel images, and only has slightly quality degradation by 0.92dB in final view synthesis images.",
keywords = "Disparity estimation, Fast algorithm, Stereo matching",
author = "Tseng, {Yu Cheng} and Tian-Sheuan Chang",
year = "2011",
month = sep,
day = "29",
doi = "10.1109/ICDSP.2011.6004899",
language = "English",
isbn = "9781457702747",
series = "17th DSP 2011 International Conference on Digital Signal Processing, Proceedings",
booktitle = "17th DSP 2011 International Conference on Digital Signal Processing, Proceedings",
note = "null ; Conference date: 06-07-2011 Through 08-07-2011",
}