Image feature extraction via local binary patterns for marbling score classification in beef cattle using tree-based algorithms
Notice bibliographique
Résumé
The objective of this study was to investigate the potential of creating a pipeline to classify the marbling score obtained from ribeye area (REA) images using computer vision and machine learning methods. Our database consisted of images and measurements (N = 2,446) from the transversal cut between the 12th and 13th ribs of the Longissimus dorsi muscle from carcasses of a beef cattle population (Bos taurus). Each sample was previously labeled by the industry using a low, medium or high marbling score. The prediction accuracies of two tree-based Machine Learning (ML) algorithms (Decision Tree - DT and Random Forest - RF) were compared, as well as different measures for extracting features from the REA images, which were used as input for the ML algorithms. In order to extract features based on detectable color patterns and textures contained in smaller parts of the grayscale image, we proposed the application of the local binary pattern (LBP) method prior to the adoption of ML methods. Mean classification accuracies for the test set ranged from 45.78% to 91.25% for different test scenarios. The results were mostly impacted by the feature extraction metrics, ML methods, potential subjectivity during the classification process by the industry, and the number of classes evaluated together. The best prediction accuracy results were achieved after performing the cross-validation (20% in each balanced group, 5 folds, and 10 repetitions), considering solely the extreme groups (low and high marbling scores) and pre-selecting from each group the 400 most visually representative samples. The RF algorithm outperformed the DT for most scenarios. After increasing the number of images to 580 samples for the same two groups, the highest testing accuracies were reduced to 83.05% for RF and 75.58% for DT. Such a decrease in the classification accuracies may be associated with the addition of erroneously classified images, due to the subjective nature of the industry evaluation. In conclusion, our preliminary studies showed the LBP method as a powerful feature extraction strategy considering a scenario where the labels were well defined. Our results revealed high accuracies for the classification of marbling extremes, but there is an evident need to improve the understanding of the biological and visual aspects that led to a sharp drop in classification accuracy after the insertion of the intermediate groups of marbling. In addition, the authors highlight the importance of an accurate labeling process for achieving better classification accuracy when applying supervised classification methods.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,001 | 0,001 |
| Bibliométrie | 0,002 | 0,001 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,001 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».