An Improved EigenGAN-based Method for Data Augmentation for Plant Disease Classification
Bibliographic record
Abstract
Plant diseases are caused by a variety of environmental variables, which cause large losses in productivity so the diagnostic systems that are automated play a significant part in agricultural automation.A large number of disease images with appropriate plant village database disease label information must be collected to construct a functional image-based autonomous image diagnostic system.However, manual detection of plant diseases is a time-consuming and error-prone process.Conventional systems showed reasonably good diagnostic performance, however, most of their disease predictions were heavily unfairness owing to "latent similarity" within a dataset (backgrounds, lighting, and/or the separation between the target and the camera) among training and test images, and their genuine diagnosis skills were far lower than stated.To overcome this issue, this paper proposed a Hybrid Fourier Filter De-noising (HFFDF) algorithm and enhanced EigenGAN (Generative Adversarial Network (GAN)), which creates a large number of diverse and large-quality training images and serves as a reliable data supplement for the diagnostic classifier.These produced images may be utilized as resources to improve the efficiency of plant disease diagnostic systems.The results shown that the performance of the new method of HFFDF is effective compared with other denoising filters of Gaussian, Median and wiener filter algorithms.The Experimental result shows that proposed HFFDF and EigenGAN methods clearly outperforms than existing methods.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| 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".