Discrete Cosine Transform-Based Kernel Discriminant Analysis for Enhanced Biometric Recognition
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
This study presents a comprehensive exploration of the Discrete Cosine Transform (DCT) and its application in biometric recognition systems, with a specific focus on improving the discriminative capabilities of existing methods.The inherent properties of the DCT are leveraged, and the traditional Linear Discriminant Analysis (LDA) framework is extended to nonlinear scenarios through the design of a novel DCT-based Kernel Discriminant Analysis (DCT-KDA) algorithm.The proposed approach integrates the advantages of DCT with the flexibility of kernel methods to achieve enhanced feature extraction and classification performance.Rigorous experiments are conducted using the FERET and AR face databases to evaluate the effectiveness of the algorithm under various conditions.Results demonstrate that the DCT-KDA method consistently outperforms conventional techniques such as standard KDA and DCT-LDA, delivering superior recognition accuracy and faster computational performance.These improvements highlight the potential of the proposed DCT-KDA framework for real-time biometric applications.By providing a robust, efficient, and scalable solution, this research contributes to advancing the field of biometric recognition, offering insights into both theoretical developments and practical implementations.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.003 | 0.009 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| 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