期刊文献+

一种改进的One-Cut交互式图像分割算法 被引量:8

An improved One-Cut interactive image segmentation algorithm
下载PDF
导出
摘要 GrabCut算法作为一种典型的交互式彩色图像分割算法,是计算机图像领域中的重要技术手段。然而随着大数据时代的到来,图像数据种类和数量都呈指数级增长,显著地增加了图像分割的任务量,对图像分割效率提出了更高的要求。针对GrabCut算法图像分割效率及精度低的问题,提出了一种改进的One-Cut交互式图像分割算法。首先采用One-Cut的L_1距离项构建能量函数避免GrabCut算法所面临的NP-hard问题。然后改进能量函数中表观重叠惩罚项,并结合颜色直方图加速技术,优化网络图结构,显著降低网络图的复杂度,从而提高图像分割的效率及精度。实验结果表明,改进后的One-Cut图像分割算法显著提升了图像分割效率,提高了分割精度,得到了较好分割结果。 As a typical interactive color image segmentation method,the Grabcut algorithm is an important technique in the field of computer image.However,with the arrival of big data age,the types and quantities of image data are increasing exponentially.The workload of image segmentation is significantly increasing,and a higher demand is raised for the efficiency of image segmentation algorithms.Aiming at the problem of low efficiency and accuracy of the GrabCut algorithm,we propose an improved One-Cut interactive image segmentation algorithm.Firstly,the energy function is built with the OneCut L1 distance term to avoid the Np-hard problem faced by the GrabCut algorithm.Secondly,the apparent overlap penalty in the energy function is improved and the network structure is optimized by the color histogram acceleration technique.Finally,the complexity of the network diagram is reduced and the image segmentation efficiency and accuracy are improved.Experimental results show that the improved One-Cut interactive image segmentation algorithm can significantly improve the segmentation efficiency and segmentation accuracy and a better segmentation result is obtained.
作者 王栋 唐晶磊 WANG Dong;TANG Jing-lei(College of Information Engineering,Northwest A&F University,Xi'an 712100,China)
出处 《计算机工程与科学》 CSCD 北大核心 2018年第6期1111-1118,共8页 Computer Engineering & Science
基金 西安市科技计划(NC1504(2)) 国家自然科学基金(31101075) 国家863计划(2013AA10230402)
关键词 图像分割 One-Cut 最小割 表观重叠惩罚项 GRABCUT image segmentation One Cut mincut appearance overlap penalty term GrabCut
  • 相关文献

参考文献9

二级参考文献128

  • 1司永胜,刘刚,高瑞.基于K-均值聚类的绿色苹果识别技术[J].农业机械学报,2009,40(S1):100-104. 被引量:50
  • 2林开颜,吴军辉,徐立鸿.彩色图像分割方法综述[J].中国图象图形学报(A辑),2005,10(1):1-10. 被引量:322
  • 3宋健,张铁中,徐丽明,汤修映.果蔬采摘机器人研究进展与展望[J].农业机械学报,2006,37(5):158-162. 被引量:214
  • 4高丽,杨树元,李海强.一种基于标记的分水岭图像分割新算法[J].中国图象图形学报,2007,12(6):1025-1032. 被引量:110
  • 5Szeliski R,Zabih R,Scharstein D,et al.A comparative study of energy minimization methods for markov random fields with smoothness-based priors[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2008,30 (6):1068-1080.
  • 6Ford L,Fulkerson D.Flows in Networks[M].New Jersey:Princeton University Press,1962.
  • 7Boykov Y,Veksler O,Zabih R.Fast approximate energy minimization via graph cuts[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2001,23(11):1222-1239.
  • 8Boykov Y,Kolmogorov V.An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,2004,26(9):1124-1137.
  • 9Boykov Y Y,Jolly M.Interactive graph cut for optimal boundary & region segmentation of objects in N-D images[C].Proceedings of Internation Conference on Computer Vision.Vancouver,Canada:IEEE Computer Society,2001,Ⅰ:105-112.
  • 10Goldberg A V,Tarjan R E.A new approach to the maximum-flow problem[J].Journal of the Association for Computing Machinery,1988,35(4):921-940.

共引文献107

同被引文献65

引证文献8

二级引证文献34

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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