MétaCan
Menu
Back to cohort
Record W2165832997 · doi:10.1109/ccece.2009.5090085

Discriminative SIFT features for face recognition

2009· article· en· W2165832997 on OpenAlexaff
Angshul Majumdar, Rabab Ward

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Image and Video Retrieval Techniques
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsScale-invariant feature transformArtificial intelligencePattern recognition (psychology)Discriminative modelFacial recognition systemComputer scienceCognitive neuroscience of visual object recognitionFeature extractionThree-dimensional face recognition3D single-object recognitionComputer visionComputationFace (sociological concept)Invariant (physics)Feature (linguistics)MathematicsFace detectionAlgorithm

Abstract

fetched live from OpenAlex

SIFT (Scale Invariant Feature Transform) features are widely used in object recognition. These features are invariant to changes in scale, 2D translation and rotation transformations. To a limited extent they are also robust to 3D projection transformations. SIFT Features however, are of very high dimension and large number of SIFT features are generated from an image. The large computational effort associated with matching all the SIFT features for recognition tasks, limits its application to face recognition problems. In this work we propose a discriminative ranking of SIFT features that can be used to prune the number of SIFT features for face recognition. Our method checks the number of irrelevant features to be matched thereby reducing the computational complexity. In the process it also increases the recognition accuracy. We show that the reduction in the number of computations is more than 4 times and increase in the recognition accuracy is 1% on average. Experimental results confirm that our proposed recognition method is robust to changes in head pose, illumination, facial expression and partial occlusion.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.009
Threshold uncertainty score0.029

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0090.005

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.033
GPT teacher head0.325
Teacher spread0.291 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designBench or experimental
Domainnot available
GenreEmpirical

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

Quick stats

Citations43
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Image and Video Retrieval TechniquesFrench-language works237,207