Privacy Preserving Ear Recognition System Using Transfer Learning in Industry 4.0
Bibliographic record
Abstract
This article presents an Industry 4.0 compliant ear biometric recognition technique using dense convolutional network (DenseNet), a well-known convolutional neural network model. Compared to other biometric traits, ear recognition has been a challenge due to the unavailability of a large number of images and, therefore, the improvements due to deep learning application are still unexplored. Additionally, ear biometrics has the natural advantage of privacy preservation through excellent feature encoding, which is not yet explored. In this article, the performance of DenseNet is initially tested on typically challenging benchmarks, such as street view house numbers, Canadian Institute for advanced research, and ImageNet, achieving state-of-the-art results and requiring minimal computation time and memory. All the experiments are performed on six popular ear databases namely mathematical analysis of images, annotated web ears (AWE), extended AWE (AWE-X), computer vision laboratory ear (CVLE), Indian Institute of Technology-Delhi, and West Pomeranian University of Technology, indicating that the proposed algorithm achieves a better performance over state-of-the-art. Due to less trainable parameters and fast processing, this Industry 4.0 compliant proposed recognition method can be widely used over Internet of Biometric Things, ensuring the privacy preservation.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 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".