期刊文献+

基于先验知识水平集方法的草莓图像分割

Strawberry Image Segmentation Based on Level Set Method
下载PDF
导出
摘要 在实际应用中,当目标本身含有一些固有的颜色纹理特征时,可将这些特征作为一种先验信息,这样可以大大提高分割的准确性.为此,本文提出了一种基于先验信息的改进水平集图像分割方法.首先,利用传统的C-V模型能量项的构造思想构建了基于颜色信息的局部能量项,该项是用于处理彩色图像;然后将颜色分量引入到传统的结构张量中构建出新的扩展型结构张量,该项是用于处理纹理信息;最后,将上述新构造的能量项以及Li模型约束项引入到传统C-V模型中得到新的水平集模型.鉴于草莓果实所具有的颜色信息和纹理信息,本文将上述改进水平集方法应用到农业自动化应用中草莓果实分割中.对实验室环境与草莓生长环境下的草莓图像进行分别实验,结果显示该方法能够不仅能够分割出草莓果实且能够很好地处理草莓表面的纹理信息.另还与OTSU算法、传统C-V模型、改进C-V模型对草莓图像作对比实验,结果表明本文算法均比上述三种算法具有更好的分割效果. In practical applications, when the object itself contains some inherent color or texture features, these features can be used as a priori information, which can greatly improve the accuracy of the segmentation. Therefore, this paper proposes an improved level set method which is based on prior information. Firstly, we use the thought of the energy structure of C-V model to construct an energy function that contains of color information to segment color image. Then, we put the color component into the traditional structure tensor for the texture image segmentation. Finally, we get the new level set model from the traditional C-V model with the new energy structure and the penalty term of Li model. In view of the color and the texture information of strawberry fruit, the improved level set method has been applied to the segmentation of fruit image in agriculture. By experiment on laboratory and nature, the result shows that the improved can not only segment out strawberry, but also segment texture on the surface of strawberry. Comparing with the OTSU algorithm, the traditional C-V model and improved C-V model, the experimental results show that the proposed method has better segmentation result.
出处 《计算机系统应用》 2016年第2期124-129,共6页 Computer Systems & Applications
基金 中科院合肥物质科学研究院"十二五"重点培育方向课题 国家自然基金项目(31401293) 国家科技支撑计划(2013BAD15B03) 安徽省教育厅自然科学基金(KJ2013B230)
关键词 图像分割 水平集方法 先验信息 结构张量 OTSU image segmentation level set method prior information structure tensor OTSU
  • 相关文献

参考文献12

  • 1Osher S, Sethian JA. Fronts propagating with curvature- dependent speed: algorithms based on Hamilton-Jacobi formulations. Journal of Computational Physics, 1988, 79(1): 12-49.
  • 2Mumford D, Shah J. Optimal approximations by piecewise smooth functions and associated variational problems. Communications on Pure and Applied Mathematics, 1989, 42(5): 577-685.
  • 3Caselles V, Kimmel R, Sapiro G Geodesic active contours. International journal of computer vision, 1997, 22( 1): 61-79.
  • 4Chan TF, Vese LA. Active contours without edges. IEEE Trans. on Image Processing, 2001, 10(2): 266-277.
  • 5Li C, Xu C, Gui C, et al. Level set evolution without re-initialization: a new variational formulation. IEEE Computer Society Conference on Computer Vision and Pattern Recognition(CVPR 2005). IEEE. 2005, 1. 430-436.
  • 6袁媛,李淼,梁青,胡秀珍,张伟.基于水平集的作物病叶图像分割方法[J].农业工程学报,2011,27(2):208-212. 被引量:22
  • 7Wang XF, Huang DS, Du JX, et al. Classification of plant leaf images with complicated background. Applied Mathematics and Computation, 2008, 205(2): 916-926.
  • 8赵红雨,吴乐华,史燕军,王志中.基于HSV颜色空间的运动目标检测方法[J].现代电子技术,2013,36(12):45-48. 被引量:24
  • 9Feddern C, Weickert J, Burgeth B. Level-set methods for tensor-valued images. Proc. Second IEEE Workshop on Geometric and Level Set Methods in Computer Vision. 2003.65-72.
  • 10Lee SM, Abbott AL, Clark NA, et al. Active contours on statistical manifolds and texture segmentation. IEEE International Conference on Image Processing (ICIP 2005). IEEE. 2005, 3. III-828-31.

二级参考文献52

共引文献64

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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