MétaCan
Menu
Back to cohort
Record W2113119678 · doi:10.1109/ispa.2005.195405

Robust recognition of 3-D faces based on analytic forms and spectral analysis

2005· article· en· W2113119678 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational symposium on image and signal processing and analysis/ISPA ... · 2005
Typearticle
Languageen
FieldComputer Science
TopicFace and Expression Recognition
Canadian institutionsNational Research Council Canada
Fundersnot available
KeywordsFacial recognition systemArtificial intelligenceComputer sciencePattern recognition (psychology)Robustness (evolution)Face (sociological concept)Computer visionThree-dimensional face recognitionNoise (video)Facial expressionCoding (social sciences)Speech recognitionFace detectionMathematicsImage (mathematics)

Abstract

fetched live from OpenAlex

One of the main objectives of face recognition is to determine whether an acquired face belongs to a reference database and to subsequently identify the corresponding individual. Face recognition has application in, for instance, forensic science and security. A face recognition algorithm, to be useful in real applications, must discriminate in between individuals, process data in real-time and be robust against occlusion, facial expression and noise. A new method for robust recognition of three-dimensional faces is presented. The method is based on harmonic coding, Hilbert transform and spectral analysis of 3-D depth distributions. Experimental results with three-dimensional faces, which were scanned with a laser scanner, are presented The proposed method recognises a face with various facial expressions in the presence of occlusion, has a good discrimination, is able to compare a face against a large database of faces in real-time and is robust against shot noise and additive noise.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.867
Threshold uncertainty score0.641

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.015
GPT teacher head0.246
Teacher spread0.231 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it