TY - GEN
T1 - A revisit to cost aggregation in stereo matching
T2 - 2011 IEEE International Conference on Computer Vision, ICCV 2011
AU - Min, Dongbo
AU - Lu, Jiangbo
AU - Do, Minh N.
PY - 2011
Y1 - 2011
N2 - This paper presents a novel method for performing an efficient cost aggregation in stereo matching. The cost aggregation problem is re-formulated with a perspective of a histogram, and it gives us a potential to reduce the complexity of the cost aggregation significantly. Different from the previous methods which have tried to reduce the complexity in terms of the size of an image and a matching window, our approach focuses on reducing the computational redundancy which exists among the search range, caused by a repeated filtering for all disparity hypotheses. Moreover, we also reduce the complexity of the window-based filtering through an efficient sampling scheme inside the matching window. The trade-off between accuracy and complexity is extensively investigated into parameters used in the proposed method. Experimental results show that the proposed method provides high-quality disparity maps with low complexity. This work provides new insights into complexity-constrained stereo matching algorithm design.
AB - This paper presents a novel method for performing an efficient cost aggregation in stereo matching. The cost aggregation problem is re-formulated with a perspective of a histogram, and it gives us a potential to reduce the complexity of the cost aggregation significantly. Different from the previous methods which have tried to reduce the complexity in terms of the size of an image and a matching window, our approach focuses on reducing the computational redundancy which exists among the search range, caused by a repeated filtering for all disparity hypotheses. Moreover, we also reduce the complexity of the window-based filtering through an efficient sampling scheme inside the matching window. The trade-off between accuracy and complexity is extensively investigated into parameters used in the proposed method. Experimental results show that the proposed method provides high-quality disparity maps with low complexity. This work provides new insights into complexity-constrained stereo matching algorithm design.
UR - http://www.scopus.com/inward/record.url?scp=84863011842&partnerID=8YFLogxK
U2 - 10.1109/ICCV.2011.6126416
DO - 10.1109/ICCV.2011.6126416
M3 - Conference contribution
AN - SCOPUS:84863011842
SN - 9781457711015
T3 - Proceedings of the IEEE International Conference on Computer Vision
SP - 1567
EP - 1574
BT - 2011 International Conference on Computer Vision, ICCV 2011
Y2 - 6 November 2011 through 13 November 2011
ER -