Auto-Encoders Derivatives on Different Occluded Face Images: Comprehensive Review and New Results
Bibliographic record
Abstract
This paper presents a novel approach for improving occluded face recognition performance using a family of autoencoders (AE) architectures. The proposed structures include four stages: image preprocessing, feature extraction using autoencoder derivatives, classification via a convolutional neural network (CNN), and evaluation on occluded, non-occluded, and unseen datasets. Three deep autoencoder variants with combinational loss terms have been introduced to extract features from images: Convolutional Autoencoder (CAE), Self-Supervised Convolutional Autoencoder (SSCAE), and Smooth Convolutional Autoencoder (SCAE). A Masked Convolutional Autoencoder (MCAE) is also introduced to evaluate the capability of our convolutional autoencoder model in reconstructing images from masked inputs. Seven public datasets have been utilized to evaluate the performance of the proposed methods: the Extended Yale Dataset B, FERET, CMU Multi-PIE, Occluded ORL, Masked LFW (MLFW), AR, and RMFRD. Occluded ORL is used to analyze the performance of the proposed autoencoder derivatives on severely occluded images. MLFWis used to test the generalization of the proposed methods as an unseen dataset for the encoder part of the autoencoder variants. The recognition accuracies of 100% for FERET, 99.89% for the Extended Yale B, 99.45% for the CMU Multi-PIE, and 94.2% for unseen MLFW, and the ability to reconstruct masked ORL with 90% of masking, demonstrate that the proposed methods achieve significant improvement in accuracy for face recognition with acceptable computational cost in comparison to the state-of-the-art. To the best of our knowledge, this study is the first work where convolutional autoencoder architectures achieve such performance on occluded datasets without incorporating any occlusion-specific design.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
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 teacher head, 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".