2023
DOI: 10.1016/j.atech.2022.100081
|View full text |Cite
|
Sign up to set email alerts
|

Diagnosis of grape leaf diseases using automatic K-means clustering and machine learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
36
0
2

Year Published

2023
2023
2024
2024

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 109 publications
(38 citation statements)
references
References 52 publications
0
36
0
2
Order By: Relevance
“…The threshold value was considered in the frequency range of 180-130 pixels. RGB Binary space was detected to detect the damaged part of the cucumber leaf surface, which is shown in Figure (6).…”
Section: Results Of Segmentation and Feature Extractionmentioning
confidence: 99%
See 1 more Smart Citation
“…The threshold value was considered in the frequency range of 180-130 pixels. RGB Binary space was detected to detect the damaged part of the cucumber leaf surface, which is shown in Figure (6).…”
Section: Results Of Segmentation and Feature Extractionmentioning
confidence: 99%
“…In [13], a method based on examining the histogram of the image layer and applying morphological filters, as well as examining the histogram of the images in the HSV color model to prevent the spread of internal measles in cucumber greenhouses with 90% accuracy was used. In [6] a novel algorithm for separate the disease area from healthy part in Kmeans clustering automatically proposed. In that study, the texture features of grape leaf diseases, i.e., black measles, black rot, and leaf blight were extracted and SVM classification method was used.…”
Section: Introductionmentioning
confidence: 99%
“…The objects are classified by minimizing the sum of squares of the distance between the object and the corresponding cluster. The K ‐means clustering algorithm can be described by four steps (Javidan et al., 2023): (1) picking the center of the K th cluster either randomly or based on some heuristics; (2) assigning each pixel to a cluster that minimizes the distance between the pixel and the cluster center; (3) computing the cluster centers by averaging all the pixels in the cluster; and finally, (4) repeating steps 2 and 3 until convergence is obtained.…”
Section: Methodsmentioning
confidence: 99%
“…The objects are classified by minimizing the sum of squares of the distance between the object and the corresponding cluster. The K-means clustering algorithm can be described by four steps (Javidan et al, 2023):…”
Section: Symptom Area Segmentation Using K-means Clusteringmentioning
confidence: 99%
See 1 more Smart Citation