期刊文献+

基于视差范围自动提取的视差图优化算法研究

RESEARCH ON DISPARITY MAP OPTIMISATION BASED ON AUTOMATIC DISPARITY RANGE EXTRACTION
下载PDF
导出
摘要 基于图割理论的立体匹配是从同一场景不同角度的两幅或多幅图像中得到视差图,进而求得场景的立体深度,为三维重建、视觉测量等提供有用的信息。然而,视图视差范围的选择往往被忽视,提出一种基于图像分割及GPU SIFT算法的视差范围快速自动提取算法,得到的视差范围值应用于立体匹配算法中视差范围的取值;并针对图割方法进行立体匹配时存在的正面平行表面缺陷的问题,提出一种最小二乘法的迭代改进方法,对立体匹配得到的视差图进行优化处理。对Middlebury中的标准数据进行测试的结果表明,该算法能准确地提取视图的视差范围,并有效提高各类平面与曲面的视差精度。 Stereo matching algorithm based on graph cuts theory produces disparity images from two or more images of the same scene in different visual angles,from which the stereo depth of scene can be further obtained,this brings available information to 3-D reconstruction and vision measurement.However,the choice of the disparity range is often overlooked.In the paper we present a fast disparity range auto-matic extraction algorithm which is based on image segmentation and GPU SIFT algorithm,the value of disparity range derived is applied to the value assigning of disparity range in stereo matching algorithm.Moreover,we present an iterative improvement method of the least squares for solving the problem of front parallel surface defect happened in stereo matching with graph cuts,and carry out optimised processing on dis-parity image obtained in stereo matching.It is demonstrated by the result of the test with standard data in Middlebury that the proposed algo-rithm can extract the disparity range of visual image accurately,and improves the accuracy of the disparity of various flat and curved planes ef-fectively.
出处 《计算机应用与软件》 CSCD 2015年第10期172-177,共6页 Computer Applications and Software
基金 国家自然科学基金项目(61375032)
关键词 图像分割 SIFT 算法 图割理论 视差范围 迭代最小二乘法 视差图 Image segmentation SIFT algorithm Graph cuts theory Disparity range Iterative least squares Disparity map
  • 相关文献

参考文献17

  • 1Scharstein D, Szeliski R. A taxonomy and evaluation of dense two- frame stereo correspondence algorithms[J]. Computer Vision, 1999, 47(2) :7 -42.
  • 2Boykov Y, Veksler O, Zabih R. Fast approximate energy minimization via graph cuts[J]. IEEE Transactions on Pattern Analysis and Ma- chine Intelligence, 2001,23 (11) : 1222 - 1239.
  • 3Kolrnogorov V, Zabih R. Computing visual correspondence with occlu- sions using graph cuts[ C]//Sth International Conference on Computer Vision. Washington, DC: IEEE Computer Society, 2001.
  • 4Jian Sun, NanNing Zheng, HeungYeung Shum. Stereo matching using belief propagation [ J ]. IEEE Transactions on Pattern Analysis and Ma- chine Intelligence, 2003 (7) :787 - 800.
  • 5Sun J, Li Y, Kang S, et al. Symmetric stereo matching for occlusion handling[ C]//In Computer Vision and Pattern Recognition. 2005 , 2:399 -406.
  • 6Yang Q, Wang L, Yang R, et al. Stereo matching with color-weighted correlation, hierarchical belief propagation and occlusion handling [ C ]//In Computer Vision and Pattern Recognition, 2006,II: 2347 - 2354.
  • 7Pedro F Felzenszwalb, Daniel P Huttenlocher. Efficient belief propaga- tion for early vision [ J ]. International Journal of Computer Vision, 2006, 61(1) : 55 -79.
  • 8Li Xu, Jiaya Jia. Stereo Matching: An Outlier Confidence Approach [ C ]//European Conference on Computer Vision, 2008.
  • 9Shah J. A nonlinear diffusion model for discontinuous disparity and half-occlusion in stereo[ C]//In CVPR, 1993.
  • 10Middlebury stereo wedsite [ EB/OL]. [2010 - 02 - 20 ]. http:// www. middlebury, edu/stereo.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部