Sorting Raisins by Machine Vision System
Bibliographic record
Abstract
In this research, an apparatus for sorting raisins has been designed and fabricated based on machine vision system. This system was composed of conveyor belt, lighting box, controlling and processing system unit and sorting unit. Color feature is the most important parameter in classification and sorting of raisins. In order to carry out image processing and to extract useful features of captured images by machine vision a highly efficient algorithm was developed and implemented in Visual Basic 6.0 environment. The algorithm was consisted of background segmentation, raisin selection and feature extraction. The developed algorithm initially extracts the raisins by removing the background from the taken images. It then sorts the raisins according to their HSI color and size features. By a suitable combination of length and HSI color values raisins were graded it two classes. The final step in the algorithm was the calculation of the center of gravity of each raisin to be later used for automatic sorting and rejection of bad raisins. In order to evaluate the precision of the sorter statistical analysis was carried out. Experimental results indicated the accuracy of the proposed system is about 93 percent. The system can be easily adapted for sorting other agricultural products such as lentil and almond.
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.000 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.006 | 0.003 |
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".