Bibliographic record
Abstract
Appearance-based approach is one of the most successful solutions to the face recognition (FR) problem, dominating the literature in the past decade. Its effectiveness, however, is limited by the technical difficulties pertinent to FR applications. It is well-known that the appearance of face object often exhibits considerable variations in illumination, expression, pose and other factors, resulting in a complex distribution of face patterns. At the same time, image samples available for each subject are limited which makes the characterization of face object properties a difficult task. This is the so-called small sample size (SSS) problem that exists in many real-world FR. applications such as surveillance photo identification and forensic identification. In this research, efforts have been focused on the development of appearance-based FR algorithms under the SSS scenario. By combining the strengths of the advanced kernel machine technique and the quadratic discriminant learning solution, a novel nonlinear FR algorithm, denoted as kernel quadratic discriminant analysis, is first proposed to address the problems associated with small sample size and complex face pattern distribution. The proposed method provides a general pattern recognition framework from which a set of novel or traditional learning algorithms can be derived. Following that, an automatic Gaussian kernel parameter determination procedure has been developed to constitute a meaningful contribution to kernel-based learning algorithms. In order to address the one-training-sample (OTS) problem, an extreme SSS case, a novel concept, denoted as generic learning, is introduced. Within the generic learning framework, state-of-the-art FR solutions are extensively studied and evaluated. In addition, a regularized feature selection algorithm is developed within the generic learning framework to make the unsupervised eigenface approach more attractive to classification tasks. Extensive experimentation has been conducted on the well-known data sets such as the FERET, AR and PIE databases, to evaluate the methods presented in this dissertation.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".