Hyperspectral face recognition with log‐polar Fourier features and collaborative representation based voting classifiers
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 imagery analysis has become a popular topic for improving face recognition accuracy. Nevertheless, it encounters difficulty in data acquisition, low signal‐to‐noise ratio, and high dimensionality. As a result, there exists a need to develop better algorithms in order to achieve higher classification rates. In this study, the authors propose a new method for hyperspectral face recognition with very competitive experimental results. Since there is a significant amount of noise in every spectral band, they reduce noise adaptively from each spectral band by using any image denoising method, e.g. block matching and 3D filtering. They then crop each face according to its eye coordinates so that translation invariance can be achieved. They conduct log‐polar transform to each cropped face image and extract 2D Fourier spectrum from them. In this way, the extracted features are approximately invariant to translation, rotation, and scaling. They use the collaborative representation‐based classifier with voting for hyperspectral face recognition. They perform some experiments to test the authors’ new method for hyperspectral face recognition with very promising results.
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.001 | 0.004 |
| 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