Analysis of Face Emotion Identification and Recognition Using State-of-the-Art Deep Learning Models
Bibliographic record
Abstract
The application of several DL approaches for FER has been a focus of many researchers worldwide.Many Deep Learning algorithms are available to do this task, but the absence of large online datasets prevents any of them from achieving better accuracy.Researchers have decided to transfer learning as a solution to this problem after increasing prediction accuracy.This research presents a comparative examination of different DL pre-trained models for face emotion identification that may be applied in different real-world scenarios.Using deep learning approaches, this research endeavour gives a comparative assessment of recognising emotions of faces.The study aims to compare and assess the performance of two advanced DL models: transfer learning pre-trained models and CNNs.The well-known FER-2013 dataset, which consists of various emotion classes for classification, was utilised for this study.Phases of automated emotion identification, including data preprocessing, categorization, and visualisation, are presented.The models were assessed in the experimental work according to their F1-score, recall, accuracy, and precision.The CNN model gets 75.47% accuracy for the facial expression recognition, which outperforms other transfer learning models.The report summarises previous research on emotion recognition with deep learning models and compares and contrasts various methods.The study's results can help people who study and work in areas of data processing, DL, and facial emotion detection.
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.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".