首页 | 本学科首页   官方微博 | 高级检索  
     

基于视差图优化的立体匹配算法研究
引用本文:徐昇,云挺,业宁.基于视差图优化的立体匹配算法研究[J].计算机工程与设计,2012,33(2):658-664,717.
作者姓名:徐昇  云挺  业宁
作者单位:南京林业大学信息科学与技术学院,江苏南京,210037
基金项目:国家自然科学基金项目,江苏省自然基金项目
摘    要:传统的立体匹配算法通过计算两幅图像的像素点相似程度,从而找到左图像素点和右图像素点的对应关系,常采用的是一种局部最优的方法,所以其匹配精度很低.为了提高精度,当前策略主要是将问题转化为求解能量方程,进而来对全局空间进行优化.从一个新的角度即视差图优化来研究能量方程的求解,通过对扫描线算法、动态规划算法和图割算法深刻讨论来分析算法原理与运行图,从而理解各算法优缺点形成本质与问题转化的依据,可以进一步的改进其不足,为研究新的算法打下基础.

关 键 词:视差图优化  能量方程  全局优化  扫描线  动态规划  图割

Research on stereo matching algorithm based on disparity map optimization
XU Sheng , YUN Ting , YE Ning.Research on stereo matching algorithm based on disparity map optimization[J].Computer Engineering and Design,2012,33(2):658-664,717.
Authors:XU Sheng  YUN Ting  YE Ning
Affiliation:(Institute of Information Science and Technology,Nanjing Forestry University,Nanjing 210037,China)
Abstract:The traditional stereo matching method is calculating the similarity of the pixels in two images and then finds the correspondence between the left picture pixels and the right picture pixels.However it is often a local optimum method and the accuracy is very low.To improve accuracy,the current strategy is to create its energy equation,and then to optimize the global space.However,it is difficult to understand the reasons for the transformation and the essence of the problem.Thus from the perspective of disparity map optimization,the optimization of the global energy equation is discussed by using the scanline optimization algorithm,dynamic programming algorithm and graph cut algorithm.Through a deep analysis of their nature and the diagram when the algorithms are running,the advantages and disadvantages of each algorithm are analyzed,and their shortcomings are further improved,thus laying the foundation for new algorithms.
Keywords:disparity map optimization  energy equation  global optimization  scanline  dynamic programming  graph cuts
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号