首页 | 官方网站   微博 | 高级检索  
     

基于凸集论的稠密视差图优化算法
引用本文:高凯,陈贺新,赵岩,耿英楠,黎昌明.基于凸集论的稠密视差图优化算法[J].吉林大学学报(工学版),2013(Z1):204-208.
作者姓名:高凯  陈贺新  赵岩  耿英楠  黎昌明
作者单位:吉林大学通信工程学院
基金项目:国家自然科学基金资助项目(61171078;60832002);吉林大学杰出青年基金项目(200905018)
摘    要:针对计算机视觉领域中立体匹配算法在图像无纹理区产生的误匹配问题,提出以全变差函数为凸约束集,使用次梯度投影法,对通过初始视差变换后的立体图像对之间的像素误差函数和视差二次平滑因子形成的严格凸函数进行求解,寻求立体图像对之间的最优视差图。实验结果表明,该方法不仅能保留初始视差图的边缘,而且减少了由先前立体匹配算法求得的视差图在无纹理区产生的误匹配点,取得了良好的视差图优化效果。

关 键 词:立体匹配  凸优化  次梯度投影  全变差  二次平滑因子

Dense disparity map optimization algorithm based on convex set theory
GAO Kai,CHEN He-xin,ZHAO Yan,GENG Ying-nan,LI Chang-ming.Dense disparity map optimization algorithm based on convex set theory[J].Journal of Jilin University:Eng and Technol Ed,2013(Z1):204-208.
Authors:GAO Kai  CHEN He-xin  ZHAO Yan  GENG Ying-nan  LI Chang-ming
Affiliation:(College of Communication Engineering,Jilin University,Changchun 130012,China)
Abstract:According to the mismatch problem in less textured area of stereo match algorithms in computer vision field,in order to find the optimal disparity map of the stereo image pair,a method using the sub-gradient projection method to solve strict convex function which composed by the pixel error function of the shaped image pairs and quadratic smoothing factor of disparity map was proposed,which was restrained by the convex constraint set of total variation function.Experimental results show that the method can keep the edge of primal disparity map well,reduce the mismatch in the less textured area of disparity generated by primal stereo matching algorithm,and get the better optimization disparity map effectively.
Keywords:stereo matching  convex optimization  sub-gradient projection  total variation  quadratic smoothing factor
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号