期刊文献+

基于改进的Graph Cut算法的羊体图像分割 被引量:7

Sheep image segmentation based on proposed graph cut algorithm
原文传递
导出
摘要 针对羊体图像复杂背景、不均匀光照且含有大量噪声等特点,提出一种融合多尺度分水岭的改进Graph Cut分割模型.引入多尺度分水岭对图像进行预分割,将基于像素级的Graph Cut算法转化为基于区域的算法以提高分割的效率.通过标记前景和背景种子点,利用模糊C均值算法实现前景和背景区域聚类.将多尺度分水岭分割的区域作为图割的顶点,以Lazy Snapping为框架计算图的边界项和数据项,并构造能量函数,通过最大流/最小割算法求解能量函数的最小值,从而实现图像分割.通过使用不同的分割算法进行实验比较,结果表明改进的算法在准确性和高效性方面都具有很好的性能. Sheep images possess the characteristics of complex background,uneven illumination and much noise.The improved graph cut segmentation model combined with multi-scale watershed was proposed. Multi-scale watershed was applied to the pre-segmented regions instead of image pixels,so as to improve the efficiency of segmentation.Via labeling the foreground seeds and background seeds,foreground regions and background regions were clustered using the fuzzy C-means.The regions segmented by multi-scale watershed were regarded as the vertexes of graph,and energy function was built through computing the boundary term and data term based on lazy snapping. Max-flow/min-cut was used to calculate the minimum of energy function. Through the comparison of different segmentation algorithm experiments,results demonstrate the superior performance of the proposed method in terms of segmentation accuracy and computation efficiency.
作者 周艳青 薛河儒 潘新 郜晓晶 Zhou Yanqing Xue Heru Pan Xin Gao Xiaojing(College of Computer and Information Engineering, Inner Mongolia Agricultural University, Hohhot 010018, Chin)
出处 《华中科技大学学报(自然科学版)》 EI CAS CSCD 北大核心 2018年第2期123-127,共5页 Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金 国家自然科学基金资助项目(61461041) 内蒙古自治区博士研究生科研创新项目(B20161012911)
关键词 图像分割 羊体图像 图割算法 多尺度分水岭 模糊C均值 image segmentation sheep images graph cut algorithm multi-scale watershed fuzzy C-means
  • 相关文献

参考文献7

二级参考文献116

  • 1杨艳,滕光辉,李保明,施正香.基于计算机视觉技术估算种猪体重的应用研究[J].农业工程学报,2006,22(2):127-131. 被引量:42
  • 2吴昊,刘正熙,罗以宁,杨勇.改进多尺度分水岭算法在医学图像分割中的应用研究[J].计算机应用,2006,26(8):1975-1976. 被引量:8
  • 3KASS M, WITKIN A, TERZOLPOULOS D. Snakes: active contour models[J]. International Journal of Computer Vision, 1988, 1(4): 321-331.
  • 4YUNRI Y, JOLLY B M P. Interactive graph cuts for optimal boundary and region segmentation of objects in ND images[C]//Proceedings of International Conference on Computer Vision. Vancouver, Canada, 2001, 1: 105-112.
  • 5ROTHER C, KOLMOGOROV V, BLAKE A. Grabcutinteractive foreground extraction using iterated graph cuts [J]. ACM Transactions on Graphics, 2004, 23(3): 309-314.
  • 6LI Yin, SUN Jian, TANG Chikeung, et al. Lazy snapping[C]//Computer Graphics Proceedings, Annual Conference Series(ACM SIGGRAPH). Los Angeles, USA, 2004: 303-308.
  • 7VICENTE A, KOLMOGOROV V, ROTHER C. Graph cut based image segmentation with connectivity priors[C]//Proceeding of IEEE International Conference on CVPR.[S.l.], 2008: 1-8.
  • 8COMANICIU 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.
  • 9RHEMANN C, ROTHER C, WANG J. A perceptually motivated online benchmark for image matting[C]// Proceedings of IEEE International Conference on CVPR. 2009: 1826-1833.
  • 10YUNRI Y, BOYKOV, 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.

共引文献168

同被引文献82

引证文献7

二级引证文献35

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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