A NEURAL BASED HUMAN FACE RECOGNITION SYSTEM USING AN EFFICIENT FEATURE EXTRACTION METHOD WITH PSEUDO ZERNIKE MOMENT
Bibliographic record
Abstract
This paper introduces an efficient method for the recognition of human faces in 2D digital images using a feature extraction technique that combines the global and local information in frontal view of facial images. The proposed feature extraction includes human face localization derived from the shape information. Efficient parameters are defined to eliminate irrelevant data while Pseudo Zernike Moments (PZM) with a new moment orders selection method is introduced as face features. The proposed method while yields better recognition rate, also reduces the classifier complexity. This paper also examines application of various feature domains as face features using the face localization method. These include Principle Component Analysis (PCA) and Discrete Cosine Transform (DCT). The Radial Basis Function (RBF) neural network has been used as the classifier and we have shown that the proposed feature extraction method requires an RBF neural network classifier with a simpler structure and faster training phase that is less sensitive to select training and testing images. Simulation results on the Olivetti Research Laboratory (ORL) database and comparison with other techniques indicate the effectiveness of the proposed method.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".