一种基于最小割的稠密视差图恢复算法.PDFVIP

1000-9825/2005/16(06)1090 ©2005 Journal of Software 软 件 学 报 Vol.16, No.6 ∗ 一种基于最小割的稠密视差图恢复算法 + 彭启民 , 贾云得 (北京理工大学 计算机科学与技术系,北京 100081) An Algorithm for Dense Disparity Mapping by Using Graph Cuts + PENG Qi-Min , JIA Yun-De (Department of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China) + Corresponding author: Phn: +86-10 E-mail: qimin@ios.cn Received 2003-11-21; Accepted 2004-02-03 Peng QM, Jia YD. An algorithm for dense disparity mapping by using graph cuts. Journal of Software, 2005,16(6):1090−1095. DOI: 10.1360/jos161090 Abstract: Vast computation is a great disadvantage of the existing graph cuts based vision algorithms. Lack of adaptability is another issue. An improved global optimal algorithm for dense disparity mapping using graph cuts is presented in this paper. First, adapted occlusion penalty and smoothness penalty are defined based on the intrinsic relation between the disparity changes and the discontinuities in an image. The graph cuts based algorithm is employed to get an optimial dense disparity mapping with occlusions. Secondly, according to the complexity analysis of graph cut algorithms, an operation named restricted α-expansion operation is defined to control the vertexes generation during graph constructing based on the result of normalized correlation algorithm. It is a great help to reduce the vertexes and edges in the constructed graph, thus the computing is speeded up . The experimental results show performance of the proposed algorithm is improved and it will take a shorter time to compute an accuracy dense disparity mapping. Key words: den