Hyperspectral face recognition with minimum noise fraction, histogram of oriented gradient features and collaborative representation-based classifier
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.
Bibliographic record
Abstract
Hyperspectral imaging provides new opportunities for improving face recognition accuracy. However, it poses such challenges as difficulty in data acquisition, low signal to noise ratio (SNR), and high dimensionality. In this paper, we propose a novel method for hyperspectral face recognition with good recognition rates. We first reduce noise adaptively from each spectral band and then crop each face. We perform minimum noise fraction (MNF) transform to the cropped face data cube in order to extract a number of MNF bands. We extract histogram of oriented gradients (HOG) features from each MNF band. We conducted some experiments to test this new method for hyperspectral face recognition with very promising results. For Hong Kong Polytechnic University Hyperspectral Face Database (PolyU-HSFD), we achieved an average correct recognition rate of 95.4% with standard deviation of 2.6 (95.4% ±2.6). For CMU Hyperspectral Face Database (CMU-HSFD), we achieved an average correct recognition rate of 98.1% with standard deviation of 0.8 (98.1% ±0.8). The reasons why we choose MNF for hyperspectral face recognition are because it can separate noise from fine features in the face data cube and at the same time reduce the dimensionality of the face data cube. In this way, our proposed face recognition method will be faster than those methods without dimensionality reduction.
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 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.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it