期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于线段分割的图割立体匹配 被引量：3

Line-segments Based Stereo Matching Algorithm Using Graph Cuts
下载PDF
导出
摘要 提出了一种基于线段分割的图割立体匹配方法。首先,把图像的扫描线分割成不相重叠的、彩色-空间一致的线段基元。然后,在能量最小化框架下利用图割优化算法实现立体匹配,采用图割方法得到全局最优解,本算法中优化的节点不是传统的像素,而是分割得到的线段单元。图割方法是在拟合能量最优化的情况下给每个线段单元分配对应的视差来实现立体匹配的。多组测试数据上的实验结果说明了本方法的有效性。 A novel line-segments based stereo matching algorithm using graph cuts is proposed. Firstly, the reference image is divided into non-overlap- ping homogeneous line segments along scan line. Secondly, the stereo matching problem is formulated as an energy minimization problem in the line segment domain instead of the traditional pixel domain. Graph cuts technique is used to speed up approximating the optimal solution, which assigns the corresponding disparity to each line segments. Experimental results on various testing data sets demonstrate the good performance of the proposed algorithm.
作者 段军 何明一 戴玉超
机构地区 西北工业大学电子信息学院陕西省信息获取与处理重点实验室
出处 《电视技术》 北大核心 2012年第11期15-18,共4页 Video Engineering
基金 陕西省自然科学基金项目
关键词 立体匹配 线段分割 图割方法 全局优化 stereo matching line segment graph cuts global optimization
分类号 TN911.73 [电子电信—通信与信息系统] TP391.4 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献12

  • 1张令涛,曲道奎,徐方.一种基于图割的改进立体匹配算法[J].机器人,2010,32(1):104-108. 被引量：16
  • 2SCHARSTEIN D,SZELISKI R. A taxonomy and evaluation of dense twoframe stereo correspondence algorithms[J].International Journal of Computer Vision,2002,(01):7-4-2.
  • 3VEKSLER O. Stereo correspondence by dynamic programming on a tree[A].IEEE Press,2005.384-390.
  • 4BOYKOV Y,VEKSLER O,ZABIH R. Fast approximate energy minimization via graph cuts[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2001,(11):1222-1239.doi:10.1109/34.969114.
  • 5KOLMOGOROV V,ZABIH R. Computing visual correspondence with occlusions using graph cuts[A].IEEE Press,2001.508-515.
  • 6ROY S,COX I J. A maximum-flow formulation of the n-camera stereo correspondence problem[A].IEEE Press,1995.492-499.
  • 7TAO H,SAWHNEY H S,KUMAR R. A global matching framework for stereo computation[A].IEEE Press,2001.508-515.
  • 8HONG L,CHEN G. Segment-based stereo matching using graph cuts[A].IEEE Press,2004.74-81.
  • 9DENG Y,LIN X. A fast line segment based dense stereo algorithm using tree dynamic programming[A].IEEE Press,2006.201-212.
  • 10SUN X,MEI X,JIAO S. Stereo matching with reliable disparity propagation[A].IEEE Press,2011.355-362.

二级参考文献9

  • 1Scharstein D, Szeliski R. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms[J]. International Journal of Computer Vision, 2002, 47(1/2/3): 7-42.
  • 2Boykov Y, Kolmogorov V. An experimental comparison of mincut/max-flow algorithms for energy minimization in vision[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(9): 1124-1137.
  • 3Hong L, Chen G. Segment-based stereo matching using graph cuts[C]//IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Piscataway, NJ, USA: IEEE, 2004: 74-81.
  • 4Deng Y, Yang Q, Lin X Y, et al. Stereo correspondence with occlusion handling in a symmetric patch-based graph-cuts model[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2007, 29(6): 1068-1079.
  • 5Kolmogorov V. Graph based algorithms for scene reconstruction from two or more views[D]. Ithaca, NY, USA: Cornell University, 2003.
  • 6Kolmogorov V, Zabih R. Computing visual correspondence with occlusions using graph cuts[C]//IEEE International Conference on Computer Vision. Piscataway, N J, USA: IEEE, 2001: 508-515.
  • 7Greig D, Porteous B, Seheult A. Exact maximum a-posteriori estimation for binary images[J]. Journal of the Royal Statistical Society, Series B, 1989, 51(2): 271-279.
  • 8Ford L R, Fulkerson D R. Flows in networks[M]. USA: Princeton University Press, 1962.
  • 9Dinic E A. Algorithm for solution of a problem of maximum flow in networks with power estimation[J]. Soviet Mathematics Doklady, 1970, 11: 1277-1280.

共引文献15

同被引文献33

  • 1GUPTA R K,CHO S Y. Window-based approach for fast stereo cor- respondence [ J ]. lET Computer Vision, 2013,7 ( 2 ) : 123-134.
  • 2SU X, KHOSHGOFIAAR T M. Arbitrarily-shaped window based stereo matching using the go-light optimization algorithm [ C ]// Proc. IEEE Intemational Conference on Image Processing, 2007 ( ICIP 2007). [ S. 1. ] : IEEE Press,2007:556-559.
  • 3DE-MAEZTU L, VILLANUEVA A, CABEZA R. Stereo matching using gradient similarity and locally adaptive support- weight [ J ]. Pattern Recognition Letters ,2011,32( 13 ) : 1643-1651.
  • 4GU Z,SU X,LIU Y,et al. Local stereo matching with adaptive sup- port-weight, rank transform and disparity calibration [ J]. Pattern Recognition Letters,2008,29 ( 9 ) : 1230-1235.
  • 5MEI X,SUN X,ZHOU M, et al. On building an accurate stereo matc- hing system on graphics hardware [ C]//Prec. IEEE International Conference on Computer Vision Workshops,2011 (ICCV Workshops 2011). [S. 1. ] :IEEE Press,2011 : 467---474.
  • 6DUTI'A A, KAR A, CHA'I'I'ERJI B N. A novel apprnach to comer matching using fuzzy similarity measure[ C ]//Prec. 7th International Conference on Advances in Pattern Recognition ,2009 (ICAPR'09). [S. 1. ] :IEEE Press,2009:57--60.
  • 7GALAR M, FERNANDEZ J, BELIAKOV G, et al. Interval-valued fuzzy sets applied to stereo matching of color images [ J ]. IEEE Trans. Image Processing,2011,20 ( 7 ) : 1949-1961.
  • 8SAFF E B, SNIDER A D. Fundamentals of complex analysis with applications to engineering, science, and mathematics [ M ]. NJ: Prentice Hall,2003.
  • 9SCHARSTEIN D, SZELISK1 R. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms [ J ]. International Jour- nal of Computer Vision ,2002,47( 1 ) :7--42.
  • 10AMBROSCH K, KUBINGER W. Accurate hardware-based stereo vision [ J ]. Computer Vision and Image Understanding, 2010 ( 11 ) : 1303-1316.

引证文献3

二级引证文献2

电视技术
2012年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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