Facial Expression Recognition in the Wild using Artificial Rabbits Optimizer based Residual Neural Network
Bibliographic record
Abstract
In affective computing, emotion acknowledgement in the wild is a much-studied area. Although there have been advancements, the difficulty of emotion acknowledgement in the wild due to head movement, face deformation, illumination fluctuation, etc. remains an open subject. To improve the model's simplification ability and, by extension, its performance across a variety of learning tasks, it is crucial that a wide variety of features be extracted by the deep neural network. Interest in facial expression detection in natural settings has grown in recent years despite the difficulty of obtaining discriminative and informative characteristics from partially obscured photos. In the first stage of this paper's pre-processing, the noisy pictures are enhanced by Contrast Limited Adaptive Histogram Equalization (CLAHE). After that, Residual Neural Network (ResNet) features extraction is used, and the same method serves as an emotion classifier. An iterative technique called stochastic gradient descent (SGD) is utilized to refine the ResNet model's objective function. Finally, the Artificial Rabbits Optimization Algorithm (ARO) is used to choose the best value for, thereby enhancing the reliability of the categorization. The suggested method is effective, as evidenced by experimental findings on three popular facial expression recognition in-the-wild datasets: AffectNet, AFEW Dataset, and RAF-DB, where it accomplishes state-of-the-art presentation with 96% accuracy and improves upon existing models by roughly 5% to 8%.
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.001 | 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.001 |
| Open science | 0.000 | 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".