Modern Problems of Face Recognition Systems and Ways of Solving Them
Bibliographic record
Abstract
Currently, the face recognition system is applied in various fields such as classified materials, file transferring, and general human interaction and innovative technologies, including cell phones with owner recognition function. The relevance of this research lies in the need to consider problems touching upon the increase in the efficiency of such technologies. The objective of this study was to improve the algorithm of the face identification system from different sides in order to demonstrate appropriate results. In the course of the study, a method based upon deep neural networks was applied through the projection of layers. As a result, a receiver operating characteristic curve was constructed to evaluate the quality of binary classification, and loss functions for deep learning, data distribution, and algorithm accuracy were demonstrated. Proceeding from the results obtained, it was found that the selected face identification system is resistant to each of the influencing factors (make-up, lighting, posture, etc.) considered separately in the work. The operation principle represents an original technical solution for face recognition problems when images in the database have discrepancies, which is a typical scenario in the actual world. The testing accuracy in this work reaches 95.04%.
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.003 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.003 | 0.003 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".