Abstract：The stereo matching is a problem in the computer vision. In order to obtain the precise dense disparity map, a twolevel matching algorithm based on the graph cuts of network is proposed. The algorithm synthesizes the advantages of the areabased process algorithm and the graph cuts global algorithm. Firstly, the twolevel 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 areabased 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.
王哲，常发亮. 基于网络最小割的分层立体视觉匹配方法*[J]. 模式识别与人工智能, 2007, 20(1): 64-68.
WANG Zhe, CHANG FaLiang. TwoLevel Stereo Matching Algorithm Based on the Graph Cuts of Network. , 2007, 20(1): 64-68.
[1] Scharstein D, Szeliski R. A Taxonomy and Evaluation of Dense TwoFrame Stereo Correspondence Algorithms. International Journal of Computer Vision, 2002, 47(1/2/3): 742 [2] Crespi B, Cozzi A G. Analog Computation for PhaseBased Disparity Estimation: Continuous and Discrete Models. Machine Vision and Applications, 1998, 11(2): 8395 [3] Greig D M, Porteous B D, Seheult A H. Exact Maximum a Posteriori Estimation for Binary Image. Journal of the Royal Statistical Society, 1989, 51(2): 271279 [4] Roy S. Stereo without Epipolar Lines: A MaximumFlow Formulation. International Journal of Computer Vision, 1999, 34(2/3): 147161 [5] Boykov Y, Veksler O, Zabih R. Fast Approximate Energy Minimization via Graph Cuts. IEEE Trans on Pattern Analysis and Machine Intelligence, 2001, 23(11): 12221239 [6] Boykov Y, Kolmogorov V. An Experimental Comparison of MinCut/MaxFlow Algorithms for Energy Minimization in Vision. IEEE Trans on Pattern Analysis and Machine Intelligence, 2004, 26(9): 11241137 [7] Huang Haiyun, Qi Feihu, Cen Feng. Stereo Matching Algorithm Based on the Maximum Flow of Network. Journal of Shanghai Jiaotong University, 2001, 35(2): 168172 (in Chinese) (黄海赟,戚飞虎,岑 峰.基于网络最大流的立体匹配算法. 上海交通大学学报, 2001, 35(2): 168172) [8] Xie Zheng. Network Algorithm and Complexity Theory. 2nd Edition. Changsha, China: National Defense Science and Technology University Press, 2003 (in Chinese) (谢 政.网络算法与复杂性理论.第2版.长沙:国防科技大学出版社, 2003) [9] Cochran S D, Medioni G. 3D Surface Description from Binocular Stereo. IEEE Trans on Pattern Analysis and Machine Intelligence, 1992, 14(10): 981994
2007, Vol. 20 
