A Progressive Weighted Average Weight Optimisation Ensemble Technique for Fruit and Vegetable Classification
Bibliographic record
Abstract
Image classification of fruit and vegetables at supermarket self-checkouts is a complex problem. Significant variations in the size, shape and colour of objects are involved, along with potentially large variations in the environmental conditions, must be accommodated to implement such a robust and effective system. Convolution Neural Networks (CNNs) have shown promising results for object classifications. However, the scarcity of training datasets due to the diversity of varieties and applications of fruit and vegetable classification is a significant limitation to the CNN implementation for this task. To overcome this, we propose the use of transfer learning and ensemble technique. Specifically, a transfer learning based weighted average weight optimisation ensemble technique is applied to the weights of GoogleNet and MobileNet by transfer learning the pre-trained CNNs using a custom dataset. Two hyperparameter optimisation techniques have been applied in a sequential way to identify the effective weights progressively. The optimised weights are used as an input to a normalised exponential softmax layer to estimate the final probability distribution for classification. A comparative evaluation among standalone GoogleNet, MobileNet and different levels of ensemble has been presented, which supports the adoption of this technique as a solution in a real-world supermarket environment.
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.002 |
| 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".