期刊文献+

基于超像素的Grab cut前景提取算法 被引量:1

Super-pixel based foreground extraction algorithm using Grab cut
原文传递
导出
摘要 针对海量的像素以及迭代更新高斯混合模型参数导致的Grab cut很难兼顾精确分割和实时交互的现象,提出基于超像素的交互式快速分割框架,精简了问题规模,保证了分割的准确度和实时性.首先,采用融合边缘自信度的均值漂移算法将图像分割为一系列保持颜色、空间信息以及边界特性的同质区域;其次,以每个同质区域的RGB均值为结点,构建加权网络图,建立前景和背景两个高斯混合模型;然后,采用EM算法结合一种新的max flow/min cut算法来逼近高斯混合模型参数;最后,本文引入区域项的自适应调整参数来提高分割的准确度.实验结果表明,文中算法对用户交互可以及时做出分割响应,并且分割的结果更加合理. To solve the difficulty to ensure both accuracy and real-time interaction in Grab cut resulting from the massive pixels and iterative updated Gaussian mixture model parameters,a fast interactive segmentation method based on super-pixel is proposed in this paper.The method reduces the scale of the problem while keep accurate and real-time segmentation simultaneously.It is achieved through the following four steps.Firstly,it uses mean shift algorithm with embedded confidence to segment the image into some homogeneous regions which maintain the color information,spatial information as well as the feature of boundaries.Secondly,it constructs the foreground and background GMM with the mean RBG of the homogeneous regions as the network nodes.Then,it combines EM algorithm with a new max flow/min cut to estimate the real GMM parameters.Finally,it automatically adjusts the weights of the region term in order to improve the segmentation accuracy.The experiment results show the algorithm presented can response to user interaction timely and the segmentation results are more reasonable.
出处 《福州大学学报(自然科学版)》 CAS CSCD 北大核心 2013年第2期164-170,共7页 Journal of Fuzhou University(Natural Science Edition)
基金 国家自然科学基金资助项目(61075022) 福建省教育厅科研资助项目(JB07023)
关键词 GRAB CUT 超像素 高斯混合模型 均值漂移 Grab cut super-pixel GMM mean shift
  • 相关文献

参考文献12

  • 1Boykov Y, Jolly M P. Interactive graph cuts for optimal boundary and region segmentation of objects in N - D images [ C ] // IEEE International Conference on Computer Vision and Pattern Recognition. [ s. 1. ] : IEEE, 2001:731 -738.
  • 2Rother C, Kolmogorov V, Blake A. Grabcut -interactive foreground extraction using iterated graph cuts[ J ]. ACM Transactions on Graphics, 2004, 23(3) : 309 -314.
  • 3Li Yin, Sun Jian, Tang Chi -keung, et al. Lazy snapping[ J]. ACM Transactions on Graphics, 2004, 23 (3) : 303 -308.
  • 4Han Shou -dong, Tao Wen - bing, Wu Xiang - lin, et al. Fast image segmentation based on multilevel banded closed form method[J]. Pattern Recognition Letters, 2010, 31(3) : 216-225.
  • 5Boykov 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, 24(9) : 1 124 - 1 137.
  • 6徐秋平,郭敏,王亚荣.基于分水岭变换和图割的彩色图像快速分割[J].计算机工程,2009,35(19):210-212. 被引量:18
  • 7Comaniciu D, Meer P. Mean shift: a robust approach toward feature space analysis[ J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002, 24(5): 603 - 619.
  • 8Bouman C A. Cluster: an unsupervised algorithm for modeling gaussian mixtures[ R]. City of West Lafayette: Charles A Bou- man, 2005 : 1 - 20.
  • 9Wang Jue, Agrawala M, Cohen M F. Soft scissors: an interactive tool for real -time high quality matting[ J ]. ACM Transac- tions on Graphics, 2007, 26 (3) : 9.
  • 10韩守东,赵勇,陶文兵,桑农.基于高斯超像素的快速Graph Cuts图像分割方法[J].自动化学报,2011,37(1):11-20. 被引量:56

二级参考文献22

  • 1Boykov Y, Funka-Lea G. Graph Cuts and Efficient N-D Image Segmentation[J]. International Journal of Computer Vision, 2006, 70(2): 109-131.
  • 2Juan O, Boykov Y. Active Graph Cuts[C]//Proc. of IEEE Computer Society Conference of Computer Vision and Pattern Recognition. Washington D. C., USA: IEEE Press, 2006.
  • 3Xu Ning, Ahuja N, Bansal R. Object Segmentation Using Graph Cuts Based Active Contours[J]. Computer Vision and Image Understanding, 2007, 107(3): 210-224.
  • 4Rother C, Kolmogorov V, Blake A. GrabCut: Interactive Foreground Extraction Using Iterated Graph Cuts[C]//Proc. of SIGGRAPH'04. Los Angeles, California, USA: ACM Press, 2004.
  • 5Li Yin, Sun Jian, Tang Chi-Keung, et al. Lazy Snapping[C]//Proc. of SIGGRAPH'04. Los Angeles, California, USA: ACM Press, 2004.
  • 6Lombaert H, Sun Yiyong, Grady L, et al. A Multilevel Banded Graph Cuts Method for Fast hnage Segmentation[C]//Proc. of International Conference on Computer Vision. Washington D. C., USA: IEEE Press, 2005.
  • 7Boykov Y, Funka-Lea G. Graph cuts and efficient N-D image segmentation. International Journal of Computer Vision, 2006, 70(2): 109-131.
  • 8Han S D, Tao W B, Wang D S, Tai X C, Wu X L. Image segmentation based on grabcut framework integrating multiscale nonlinear structure tensor. IEEE Transactions on Image Processing, 2009, 18(10): 2289-2302.
  • 9Delong A, Boykov Y. A scalable graph-cut algorithm for N-D grids. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. Anchorage, USA: IEEE, 2008. 1-8.
  • 10Han S D, Tao W B, Wu X L, Tai X C, Wang T J. Fast image segmentation based on multilevel banded closed-form method. Pattern Recognition Letters, 2010, 31(3): 216-225.

共引文献70

同被引文献13

  • 1苏金玲,王朝晖.基于Graph Cut和超像素的自然场景显著对象分割方法[J].苏州大学学报(自然科学版),2012,28(2):27-33. 被引量:7
  • 2Jianbo Shi, JIitendra Malik. Normalized cuts and image Segmentation[J]. PAMI, 2000:VOL. 22, NO. $, AUGUST 2000, pp.888-905.
  • 3PEDRO F F, DANIEL P H. Efficient graph-based image Segementation [J].IJCV ,2004:Volume 59, Issue 2, pp 167-181.
  • 4ALASTAIR P M, SIMON P, JONATHAN W, UMAR M, GRAHAM J. Superpixel Lattices[C]. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Anchorage, Alaska, USA, 2008.
  • 5O. Veksler, Y. Buykov, and P. Mehrani. Superpixels and Supervoxels in an Energy Optimization Framework[C]. Proc. European Conf. Computer Vision, pp. 211-224, 2010.
  • 6Ming-Yu Liu, Tuzel O, RamalingamS, ChellappaR. Entropy Rate Superpixel Segmentation[C]. CVPR, pp.2097- 2104,2011.
  • 7Luc Vincent and Pierre Soille. Watersheds in digital spaces: An efficientalgorithm based on immersion simulations[J]. IEEE Transactions on Pattern Analysis and Machine InteLligence, 13 ( 6 ):583-598, 1991.
  • 8D. Comaniciu and P. Meer. Mean shift: a robust approach toward feature space analysis[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24 ( 5 ):603 -619, May 2002.
  • 9A. Vedaldi and Soatto, Quick Shift and Kernel Methods for Mode Seeking[C]. Proc. European Conf. Computer Vision, pp. 705-718, 2008.
  • 10Alex Levinshtein, Adrian Stere, Kiriakos N Kutulakos,David J Fleet, Sven J Dickinson, Kaleem Siddiqi.Turbopixels: Fast superpixels using geometric flows[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI),pp.2290 -2297,2009.

引证文献1

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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