Low Rank Graph Regularization Embedding for 2D+3D Facial Expression Recognition
Bibliographic record
Abstract
In this paper, a novel low rank graph regularization embedding for 3D facial expression recognition (LRGREFER) approach is proposed, in which the core tensor is utilized to characterize the low-rank attribute among the samples combined with the factor matrices with the graph regularization embedding. At first, a model based on a 4D tensor is constructed from the facial expression data. By Tucker decomposing the constructed 4D tensor, a resulting core tensor and factor matrices in different tensor modes are utilized to characterize the low-rankness among samples. Because of the loss of information during modelling the 4D tensor, the missing data from partly observed facial expression data are recovered by embedding the tensor completion. Finally, the proposed model is handled and solved by adopting the alternating direction method of multipliers (ADMM). Meanwhile, the classification prediction of facial expressions are implemented by Multi-class-SVM. Numerical experiments are conducted on BU-3DFE database. The experiment results have been verified that our proposed approach is more competitive.
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.000 |
| Science and technology studies | 0.001 | 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".