南京师范大学学报：工程技术版2011，Vol.11Issue(4)：47-52,6.
针对图像区域连续化问题的立体匹配算法
Continuous Problem of Image Region Stereo Matching Algorithm
徐姗姗 1刘应安 1徐昇1
作者信息
- 1. 南京林业大学信息科学与技术学院,江苏南京210037
- 折叠
摘要
Abstract
Traditional graph cut algorithm to solve the binocular matching problem is time-consuming while it requires great precision. This paper proposes a new algorithm by which the minimum cut graph cut problem is converted into the greedy algorithm to reduce the complexity of the problem. At the same time as the transformed graph cut has a low effect in dealing with the image continuous problem, we propose the graph cuts combined with the region matching algorithm called GR （ Graphic Cut in Region） algorithm. They not only apply the Graph cut algorithm theory to the stereo matching problem, but also use a new method which computes the initial disparity cost through sealing the SAD window and twice compute the window cost to improve the accuracy of the initial disparity. The experiments show that this new algorithm in image continuous region has a better effect, and significantly improves the accuracy of matching at this time, and also that the algorithm complexity is greatly reduced.关键词
图割/图像区域连续化/能量函数最小化/区域匹配/窗口单位化Key words
graph cut/continuity of image region/minimization of energy function/region matching/scale the window分类
信息技术与安全科学引用本文复制引用
徐姗姗,刘应安,徐昇..针对图像区域连续化问题的立体匹配算法[J].南京师范大学学报：工程技术版,2011,11(4):47-52,6.
