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

基于窄带图割的交互式快速目标提取

BandCut:interactive fast object segmentation using graph cuts
下载PDF
导出
摘要 针对传统算法易陷入局部极值、提取效率不高的不足,运用图割理论,提出一种将目标提取问题转化为能量最小化的组合优化问题的BandCut算法。BandCut通过人机交互获取一个将目标边界包围在内的环状窄带区域,对该区域生成距离图,构造s-t网络,进行最小代价切割获取目标。实验表明,BandCut能获取最优解,提取效率是GrabCut的5倍。 Aiming at the limitations of critical point problems in local minima trap and low extracting efficiency, by means of graph cuts theory, an object extracting algorithm, BandCut, is proposed. An annular band region that encompasses object bound- ary is obtained in an interactive way. The distance map and s-t network are created successively. The object boundary is extracted via min-cut of s-t network. The experimental results show optimal and rapid extraction ability.
作者 王亚荣 徐秋平
机构地区 武警工程学院训练部
出处 《计算机工程与应用》 CSCD 2013年第3期226-229,共4页 Computer Engineering and Applications
关键词 目标提取 彩色图像分割 图割 组合优化 object extraction color image segmentation graph cuts combinatorial optimization
分类号 TP391 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献6

  • 1Lucchese L,Mitra S K.Color image segmentation:a state-of-the-art survey[].Proceedings of the Indian National Science Academy.2001
  • 2Xu N,Ahuja N,Bansal R.Object Segmentation Using Graph Cuts Based Active Contours[].Computer Vision and Image Understanding.2007
  • 3Rother C,Kolmogorov Y,Blake A.Grabcut-interactive foreground extraction using iterated graph cuts[].Proceedings of the SIGGRAPH Conference.2004
  • 4徐秋平,郭敏,王亚荣.基于图割的目标提取实时修正算法[J].计算机应用,2008,28(12):3116-3119. 被引量：5
  • 5Boykov Y,Jolly M P.Interactive Graph Cuts for Optimal Boundary and Region Segmentation of Objects in N-D Images[].Proceedings of the International Conference on Computer Vision.2001
  • 6Osher S,Sethian J.Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations[].Journal of Computational Physics.1988

二级参考文献10

  • 1KASS M, WITKIN A, TERZOPOULOS D. Snakes: Active contour models [J]. International Journal of Computer Vision, 1988, 1(4) : 321 -331.
  • 2MUMFORD D, SHAH J. Boundary detection by minimizing,functions [ C] // Proceedings of Conference Computer Vision and Pattern Recognition. San Francisco:[s. n.], 1985:41-44.
  • 3OSHER S, SETHIAN J A. Fronts propagating with curvature dependent speed: Algorithms based on Hamihon-Jacobi formulation [J]. Journal of Computational Physics, 1988, 79(1) : 12-49.
  • 4BOYKOV Y, JOLLY M P. Interactive graph eats for optimal boundary and region segmentation of objects in N-D images [ C]// Proceedings of Eighth IEEE International Conference on Computer Vision. Washington: IEEE, 2001,1: 105-112.
  • 5XU N, AHUJA N, BANSAL R. Object segmentation using graph cuts based active contours [ J]. Computer Vision and Image Understanding, 2007, 107(3): 210-224.
  • 6BOYKOV Y, FUNKA-LEA G. Graph cuts and efficient N-D image segmentation [ J]. International Journal of Computer Vision, 2006, 70(2) : 109 - 131.
  • 7ROTHER C, KOLMOGOROV V, BLAKE A. Grabcut: Interactive foreground extraction using iterated graph cuts [ J]//ACM Transactions on Graphics, 2004, 23(3): 309-314.
  • 8KOLMOGOROV V, CRIMINISI A, BLAKE A, et al. Bi-layer segmentation of binocular stereo video [ C]// IEEE Computer Society Conference of Computer Vision and Pattern Recognition. Washington: IEEE, 2005, 2:1186 - 1193.
  • 9JUAN O, BOYKOV Y. Active graph cuts [ C]// IEEE Conference on Computer Vision and Pattern Recognition, Washington: IEEE, 2006, 1: 1023- 1029.
  • 10COOK W J, CUNNINGHAM W H, PULLEYBLANK W R, et al. Combinatorial optimization [ M]. New York: John Wiley & Sons Press, 1998.

共引文献4

计算机工程与应用
2013年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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