基于引力核密度聚类算法的作物病害叶片区域的快速检测
DOI:
作者:
作者单位:

作者简介:

通讯作者:

中图分类号:

基金项目:

国家自然科学基金项目(61473237);陕西省科学技术厅重点研发项目(2017ZDXM–NY–088)


Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
  • |
  • 文章评论
    摘要:

    针对作物病害叶片图像的复杂性和模糊性,提出一种基于引力核密度聚类算法的作物叶片病害区域快速检测方法:首先,在RGB颜色空间提取病害叶片图像的R通道值,根据R值的特征直方图特性,运用多项式拟合特征直方图曲线,根据导数性质确定拟合特征直方图曲线的峰值点和峰值区域,确定病害叶片图像聚类数和初始聚类中心;根据初步确定的病变叶片图像的聚类中心,运用引力核密度聚类算法快速完成对病害叶片病斑的分割。试验结果表明,基于引力核密度聚类算法的平均分割精度达80%以上,平均检测时间为4.912 s,优于已有病害区域分割算法K–means和Meanshift的性能。

    Abstract:

    In view of the complexity and fuzziness of the diseased leaf image, a fast detection method of diseased area of plant leaf based on gravitational kernel density clustering algorithm is proposed. Firstly, the R-channel value of the diseased leaf image is extracted in RGB color space. According to the characteristic histogram characteristics of the diseased leaf R value, the characteristic histogram curve is fitted by polynomial. The peak point and the peak area of the fitting characteristic histogram curve are determined according to the derivative property. Then, the clustering number and the initial clustering center of diseased leaf images are determined according to the peak area and the peak point. Secondly, according to the preliminarily determined clustering center of the diseased leaves’ image, the gravitational kernel density clustering algorithm proposed in this paper is used to quickly segment diseased leaves. The experimental results show that the average segmentation precision based on gravity kernel density clustering algorithm is more than 80%, and the average detection time is 4.912 s, which is better than the performance of existing disease region segmentation algorithm K-means and Meanshift.

    参考文献
    相似文献
    引证文献
引用本文

刘哲,黄文准,王利平.基于引力核密度聚类算法的作物病害叶片区域的快速检测[J].湖南农业大学学报:自然科学版,2020,46(4):.

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2020-08-17
  • 出版日期: