Localizing Facial Keypoints with Global Descriptor Search, Neighbour Alignment and Locally Linear Models
Bibliographic record
Abstract
We present our technique for facial key point localization in the wild submitted to the 300-W challenge. Our approach begins with a nearest neighbour search using global descriptors. We then employ an alignment of local neighbours and dynamically fit a locally linear model to the global key point configurations of the returned neighbours. Neighbours are also used to define restricted areas of the input image in which we apply local discriminative classifiers. We then employ an energy function based minimization approach to combine local classifier predictions with the dynamically estimated joint key point configuration model. % Our method is able place 68 key points on in the wild facial imagery with an average localization error of less than 10% of the inter-ocular distance for almost 50% of the challenge test examples. Our model therein increased the yield of low error images over the baseline AAM result provided by the challenge organizers by a factor of 2.2 for the 68 key point challenge. Our method improves the 51 key point baseline result by a factor of 1.95, yielding key points for more than 50% of the test examples with error of less than 10% of inter-ocular distance.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.004 |
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".