A Novel Fingerprint Recognition Framework with Attention Mechanism Based on Domain Adaptation for Improving Applicability in Overpressured Situations
Bibliographic record
Abstract
Fingerprint recognition is a widely adopted biometric technology, valued for its reliability and precision in identifying individuals. However, traditional recognition methods relying on handcrafted features struggle under challenging scenarios such as overpressured fingerprints, where excessive pressure distorts ridge patterns, significantly affecting performance. To address these challenges, this study proposes a novel framework combining domain adaptation techniques and an attention mechanism. The framework aligns feature distributions between source and target domains, enhancing the model's generalizability to diverse datasets and acquisition conditions. Additionally, the attention mechanism emphasizes critical regions of the fingerprint, improving robustness to distortions. Experimental results demonstrate that the proposed model significantly outperforms the original ResNet, achieving a reduced Equal Error Rate (EER) of 0.0837 compared to 0.1840 for the baseline. Grad-CAM visualizations further validate the model's ability to focus on essential fingerprint features, even under distorted conditions. This study highlights the effectiveness of integrating domain adaptation and attention mechanisms in overcoming real-world challenges in fingerprint recognition.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".