According to the disadvantage of the large computation of the stereo matching algorithm based on graph cuts

a new stereo matching algorithm is presented. First

adaptive window is obtained in virtue of image edge features. Second

the SSD matching method as a similarity decision criterion is introduced to determine the initial disparity map

and then left-right conformity verification is adopted to remove mistake matching points. The initial disparity is used as a reference for the function when the energy function is structured. Finally the optimization of disparity distribution is obtained to achieve the minimum global energy by graph cuts algorithm. Experimental results based on standard stereo image rig are compared with other methods and demonstrate that not only the proposed algorithm has better performance of processing the large low texture areas and the occluded pixels

but also running time is short and two-thirds faster than the original algorithm. It can satisfy the demands of engineering practices completely.