MétaCan
Menu
Back to cohort
Record W1978510438 · doi:10.1109/wac.2014.6935767

A neural network based human face recognition of low resolution images

2014· article· en· W1978510438 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and ELM
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsArtificial intelligenceBilinear interpolationFacial recognition systemComputer scienceBicubic interpolationDiscrete cosine transformPattern recognition (psychology)Block (permutation group theory)Face (sociological concept)Interpolation (computer graphics)Computer visionImage resolutionk-nearest neighbors algorithmArtificial neural networkImage (mathematics)MathematicsLinear interpolation

Abstract

fetched live from OpenAlex

In this work, a human face recognition algorithm based on Block-based Discrete Cosine Transform (BBDCT) and Extreme Learning Machine (ELM) is proposed for low resolution input images. We also investigate the effect of image resolution on the recognition rate of the proposed face recognition system. Furthermore to improve the low resolution input images, three interpolation schemes, namely, Nearest-Neighbor, Bilinear, and Bicubic, are used as a pre-processing step to obtain better recognition rate. The experiments are conducted on the ORL database to demonstrate the performance of the proposed algorithm.

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: none
Teacher disagreement score0.896
Threshold uncertainty score0.213

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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

Quick stats

Citations4
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and ELMFrench-language works237,207