Low complexity stereo matching algorithm using adaptive sized square window

2014 
This paper presents an efficient stereo matching algorithm for hardware implementation. A low-complexity local window size decision rule is proposed in our processing scheme. The proper window size is adopted according to the local content characteristic. The matching computation cost is almost as low as the conventional fixed window size method. An efficient hardware architecture comprises unified window size processing elements is also developed. Experimental results reveal that the proposed design can achieve better quality than the related fixed window size method with the properties of low computation cost and hardware realizable flow.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    15
    References
    0
    Citations
    NaN
    KQI
    []