A new stereo matching algorithm based on adaptive window
Yingyun Yang, Huabing Wang, Bo Liu · 2012
As to the problem of great complexity of traditional adaptive window matching algorithm, a simple adaptive window matching algorithm is proposed in this paper, which use various square or rectangular windows of different size based on the different gradient of points to be matched. Moreover, for better matching effect, a regional seed propagation method is proposed based on the disparity smoothness constraints and the assumption that adjacent pixels of similar color should have the same disparity. Experiments show that compared with traditional adaptive window matching algorithms, the computation complexity has been decreased significantly and the matching accuracy rate has been improved effectively.