期刊文献+

结合CS-LBP纹理特征的快速图割算法 被引量:9

Fast Image Segmentation Algorithm Combining CS-LBP Texture Features
下载PDF
导出
摘要 图割算法是目前最有效的交互式图像分割方法之一。针对当前景和背景颜色相似时容易发生分割错误并产生shrinking bias现象,以及基于像素的计算导致交互效率不高的问题,提出一种结合纹理特征的改进算法。该算法首先利用Mean Shift算法对图像进行预分割,构建区域邻接图,然后用累计直方图、CS-LBP纹理描述子对每个区域进行颜色和纹理特征的提取,通过在能量函数中引入纹理约束项以及局部自适应的正则化参数,有效改善了分割效果和shrinking bias现象。实验结果表明,本算法交互效率得到了提高,分割结果更加精确。 Graph cuts algorithm is one of the most effective interactive image segmentation methods. But it is prone to produce segmentation errors and shrinking bias phenomena when the color of foreground and background is similar and its interaction efficiency is not high due to pixel-based calculation. To improve these problems, an algorithm combining CS-LBP texture features was proposed in this paper. First the mean shift algorithm is applied to pre-segment the origi- nal image into regions to construct region adjacency graph. Then cumulative histogram and CS-LBP texture descriptor are used to extract color and texture features form each region. A new term of texture constraint is added to the energy function and local adaptive regularization parameter is used. So the segmentation effect and shrinking bias phenomenon are improved efficiently. The experiments show that interactivity efficiency and segmentation accuracy are improved.
出处 《计算机科学》 CSCD 北大核心 2013年第5期300-302,314,共4页 Computer Science
基金 中国数字化虚拟人切片图像分割研究(60805003)资助
关键词 图割 GRABCUT 均值漂移 累积直方图 中心对称局部二值模式 Graph cuts GrabCut Mean shift Cumulative histogram CS-LBP
  • 相关文献

参考文献15

  • 1Boykov Y,Jolly M P. Interactive graph cuts for optimal bounda- ry & region segmentation of objects in N-D images[C]//Pre- ceedings of Computer Vision. 2001 ( 1 ) : 105-112.
  • 2Boykov Y, Funka-Lea G. Graph cuts and efficient N-D image segmentation[J]. International Journal of Computer Vision, 2006,70(2) : 109-131.
  • 3Vicente S, Kolmogorov V, Rother C. Graph cut based image seg- mentation with connectivity priors [C] // Preceedings of Com- puter Vision and Pattern Recognition. 2008 : 1-8.
  • 4韩守东,赵勇,陶文兵,桑农.基于高斯超像素的快速Graph Cuts图像分割方法[J].自动化学报,2011,37(1):11-20. 被引量:56
  • 5刘技,康晓东,贾富仓.基于图割与均值漂移算法的脊椎骨自动分割[J].计算机应用,2011,31(3):760-762. 被引量:7
  • 6Peng Bo, Zhang Lei, Zhang D, et al. Image segmentation by item- ted region merging with localized graph cuts[J]. Pattern Reco-gni- tion, 201 1, 44 ( 10/11 ) : 2527-2538.
  • 7徐秋平,郭敏,王亚荣.基于分水岭变换和图割的彩色图像快速分割[J].计算机工程,2009,35(19):210-212. 被引量:18
  • 8Veksler O, Boykov Y, Mehrani P. Superpixels and Supervoxels in an Energy Optimization Framework[C]//Preceedings of Eu- ropean Conference on Computer Vision(ECCV' 10). 2010: 211- 224.
  • 9Heikki: M, Pietikainen M, Schmid C. Description of Interest Re- gions with Center-Symmetric Local Binary Patterns [C] //Pre- ceedings of ICVGIP. 2006:58-69.
  • 10Comaniciu D, Meet P. Mean Shift: A Robust Approach Toward Feature Space Analysis[J]. IEEE Transactions on Pattern Anal- ysis and Machine Intelligence, 2002,24(5) : 603-619.

二级参考文献33

  • 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.

共引文献75

同被引文献93

引证文献9

二级引证文献78

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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