Fast stereo matching algorithm based on limited search space

A fast stereo matching algorithm based on dynamic programming on limited search space is proposed to attain an accurate dense disparity map.The proposed algorithm is built on the base of dynamic programming for stereo matching and it limits the search space by an initial match sequence to reduce the number of vertices to be expanded.The multi-window aggregation strategy based on adaptive weight is proposed to improve the matching accuracy.The brightness gradient is integrated into the smoothness constraints to avoid over-punishment on disparity discontinuity on object boundary.Experimental results show that the matching speed and accuracy of the proposed algorithm are greatly improved,and the algorithm is simple and effective for stereo matching.