A Stereo Matching Using Variable Windows and Dynamic Programming.

In this paper, we present a segment-based stereo matching algorithm using adaptive variable windows and dynamic programming with a robust disparity. We solve the problem of window shape and size using adaptive line masks and adaptive rectangular windows which are constrained by segments and visibility that reduces ambiguity produced by the occlusion in the computation window. In dynamic programming, we also propose the method that selects an efficient occlusion penalty. [ABSTRACT FROM AUTHOR]