Smart Edge Computing Framework for Real-Time Brinjal Harvest Decision Optimization
Bibliographic record
Abstract
Modernizing and mechanizing agriculture are vital to increasing productivity and meeting the growing global food demand. Timely harvesting decisions, traditionally based on farmers’ experience, are crucial for crop management. This study introduces the Brinjal Harvesting Decision System (BHDS), an automated, real-time framework designed to optimize harvesting decisions using a portable, low-power edge computing device. Unlike conventional object detection models, which require substantial pre-training and curated datasets, the BHDS integrates automated data acquisition and dynamic image quality assessment, enabling effective operation with minimal data input. Tested on diverse farm layouts, the BHDS achieved 95.53% accuracy in data collection and captured quality images within an average of 3 s, reducing both time and energy for dataset creation. The brinjal detection algorithm employs pixel-based methods, including background elimination, K-means clustering, and symmetry testing for precise identification. Implemented on a portable edge device and tested in actual farmland, the system demonstrated 79% segmentation accuracy, 87.48% detection precision, and an F1-score of 87.53%, with an average detection time of 3.5 s. The prediction algorithm identifies ready-to-harvest brinjals with 89.80% accuracy in just 0.029 s. Moreover, the system’s low energy consumption, operating for over 7 h on a 10,000 mAh power bank, demonstrates its practicality for agricultural edge applications. The BHDS provides an efficient, cost-effective solution for automating harvesting decisions, minimizing manual data processing, reducing computational overhead, and maintaining high precision and operational efficiency.
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.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".