Stereo matching using intra- and inter-row dynamic programming

Abstract This paper describes a stereo matching algorithm based on dynamic programming. The algorithm is in two stages, the first of which (intra-row) produces a set of candidate matches for each row separately. The second stage (inter-row) uses continuity constraints to choose the best matches.