Two-Level Stereo Matching Algorithm Based on the Graph Cuts of Network
Chang Fa · 2007
The stereo matching is a problem in the computer vision.In order to obtain the precise dense disparity map,a two-level matching algorithm based on the graph cuts of network is proposed. The algorithm synthesizes the advantages of the area-based process algorithm and the graph cuts global algorithm.Firstly,the two-level pyramid data structure for the original image pair is gotten and the global optimization matching in the lower resolution image pair is obtained by using the graph cuts method.Then under the constraint of the acquired disparity map,the area-based stereo matching algorithm is employed to get the dense disparity map of the original image pair.The algorithm not only reduces the search range of matching,but also ensures the validity of matching. The experimental results show the algorithm is efficient and feasible.