Combing modified Grabcut, K-means clustering and sparse representation classification for weed recognition in wheat field

被引:21
|
作者
Zhang, Shanwen [1 ]
Huang, Wenzhun [1 ]
Wang, Zuliang [1 ]
机构
[1] XiJing Univ, Dept Informat Engn, Xian 710123, Peoples R China
关键词
Weed recognition; Grabcut; Modified Grabcut; Adaptive fuzzy dynamic K-means clustering; Sparse representation classification (SRC); PROBABILISTIC NEURAL-NETWORKS; FINDING ARBITRARY ROOTS; POLYNOMIALS; IDENTIFICATION; SEGMENTATION; ALGORITHM; FEATURES; MODEL; COLOR;
D O I
10.1016/j.neucom.2020.06.140
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Weeding is beneficial to the growth of the crops in field. At present, weeding in China mainly relies on chemical herbicide spraying on a large area, which leads to environmental pollution. Combined with digital image processing and pattern recognition technology, weed species identification in wheat seedling stage in field is of great significance to realize the variable spraying of herbicide, reduce the cost and protect the ecological environment. Weed species identification in field by machine vision is one of the challenging and hard topics because of the diversity and changeability of the weed in field. A weed species recognition approach is proposed combining modified Grabcut, adaptive fuzzy dynamic K-means algorithms and sparse representation classification (SRC). First, the original weed images are enhanced and noise is suppressed using filtering technique, and in the segmentation phase, each weed image is coarsely segmented by the modified GrabCut algorithm to remove most of background of the original image captured in the field, which can reduce the computing cost and recognition time. The original weed image is segmented by adaptive fuzzy dynamic K-means. Finally the weed species is recognized by SRC. Compared with the other weed recognition methods, the proposed method integrated the advantages of three approaches, (1) the improved Grabcut method does not require human interaction and can automatically segment the background, (2) the dynamic K-means algorithm introduces fitness function to evaluate clustering, which reduces the dependence of traditional K-means clustering algorithm on the initial value of clustering center to a certain extent, and avoids the problems such as dead zone center and center redundancy caused by local extremum, (3) SRC is utilized to classify the weed species. To test the proposed method, a lot of experiments are carried on the wheat weed image dataset. The results validate that the proposed method is effective for the weed species recognition, which can be used as a preliminary step for precision applying pesticide. CO 2020 Published by Elsevier B.V.
引用
收藏
页码:665 / 674
页数:10
相关论文
共 50 条
  • [21] Modeling object recognition in visual cortex using multiple firing k-means and non-negative sparse coding
    Wang, Yanjiang
    Deng, Limiao
    SIGNAL PROCESSING, 2016, 124 : 198 - 209
  • [22] Stroke localization and classification using microwave tomography with k-means clustering and support vector machine
    Guo, Lei
    Abbosh, Amin
    BIOELECTROMAGNETICS, 2018, 39 (04) : 312 - 324
  • [23] Spectral-spatial classification of hyperspectral images with k-means plus plus partitional clustering
    Kazanskiy, Nikolay L.
    Serafimovich, Pavel G.
    Zimichev, Evgeniy A.
    OPTICAL TECHNOLOGIES FOR TELECOMMUNICATIONS 2014, 2015, 9533
  • [24] Visual seabed classification using k-means clustering, CIELAB colors and Gabor-filters
    Saastamoinen, Kalle
    Penttinen, Sari
    KNOWLEDGE-BASED AND INTELLIGENT INFORMATION & ENGINEERING SYSTEMS (KSE 2021), 2021, 192 : 2471 - 2478
  • [25] Classification Model of Municipal Management in Local Governments of Peru based on K-means Clustering Algorithms
    Morales, Jose
    Vargas, Nakaday
    Coyla, Mario
    Huanca, Jose
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2020, 11 (07) : 568 - 576
  • [26] City classification for municipal solid waste prediction in mainland China based on K-means clustering
    Du, Xingyu
    Niu, Dongjie
    Chen, Yu
    Wang, Xin
    Bi, Zhujie
    WASTE MANAGEMENT, 2022, 144 : 445 - 453
  • [27] DDoS Detection Using Modified K-Means Clustering with Chain Initialization Over Landmark Window
    Pramana, Made Indra Wira
    Purwanto, Yudha
    Suratman, Fiky Yosef
    2015 INTERNATIONAL CONFERENCE ON CONTROL, ELECTRONICS, RENEWABLE ENERGY AND COMMUNICATIONS (ICCEREC), 2015, : 7 - 11
  • [28] A modified K-means clustering for mining of multimedia databases based on dimensionality reduction and similarity measures
    Jiang, Xiaoping
    Li, Chenghua
    Sun, Jing
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2018, 21 (01): : 797 - 804
  • [29] A modified Bee Colony Optimization (MBCO) and its hybridization with k-means for an application to data clustering
    Das, Pranesh
    Das, Dushmanta Kumar
    Dey, Shouvik
    APPLIED SOFT COMPUTING, 2018, 70 : 590 - 603
  • [30] Modified ensemble machine learning-based plant leaf disease detection model with optimized K-Means clustering
    Viswanathan, Vijayaganth
    Murugasamy, Krishnamoorthi
    NETWORK-COMPUTATION IN NEURAL SYSTEMS, 2024,