Tomato Leaf Disease Detection through Machine Learning based Parallel Convolutional Neural Networks
Bibliographic record
Abstract
Agriculture is the primary economic activity in a significant number of nations. Yet, plant-related illnesses are the most difficult obstacle for farmers to overcome. The leaf is the portion of the plant that is noticed the most, but the process of segmenting an image of a sick lesion on a leaf suffers from challenges related to uneven lighting and a crowded, complicated natural environment. The combination of colour balancing and superpixel is the foundation of the approach that has been suggested as a solution to these issues. To begin, the picture that is being read in will be converted into a color-balanced image so that the effects of uneven lighting may be removed. Second, using the superpixel operation, compact areas are produced from the modified picture. An experimentally calculated threshold is then applied to the Histogram of Gradients (HOG) and colour channels of the superpixel to separate the undesirable backdrop from the image of the leaf. In order to identify a sick or contaminated picture, K-means clustering is employed. Pyramid of HOG (PHOG), an expanded version of HOG, together with Grey Level Co-occurrence Matrix (GLCM) characteristics are used to depict a sick infected portion of the body. In the end, many disease classifiers are evaluated against one another, and Random Forest (RF) is chosen as the best option. An experiment is carried out to verify the effectiveness of the proposed approach’s accuracy using natural photographs obtained from a variety of farms, images downloaded from the internet, and the Plant-Village colour dataset. This is done so that the resilience of the method can be evaluated.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".