Abstract:Aiming at the problem that the traditional adaptive weight has high computational complexity and low precision of traditional graph matching, an improved stereo matching algorithm is proposed based on adaptive weights and graph cuts. Firstly, the data items of the energy function are redefined according to the gray similarity and the spatial similarity. The gradient information of the image is used as the smoothing term of the energy function. Then the model is solved by using the graph theory and the α -expansion algorithm. Finally, the disparity map is used to perform the parallax refinement by using the left - right consistency check and the weighted median filter. The algorithm uses the four international standard stereo images provided by the Middlebury website to test, and the experiment shows that the proposed algorithm can get a more accurate disparity map.