MétaCan
Menu
Back to cohort
Record W2797490324 · doi:10.1049/iet-bmt.2017.0128

Fast and efficient minutia‐based palmprint matching

2018· article· en· W2797490324 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueIET Biometrics · 2018
Typearticle
Languageen
FieldComputer Science
TopicBiometric Identification and Security
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsMinutiaeComputer scienceMatching (statistics)Artificial intelligenceOrientation (vector space)Pattern recognition (psychology)Process (computing)Field (mathematics)Blossom algorithmComputer visionFingerprint recognitionMathematicsFingerprint (computing)

Abstract

fetched live from OpenAlex

Using the palmprint in recognition systems has received a lot of interest during the last two decades. Some of these systems are based on first‐level features, such as the existing lines and creases in palmprint images, and others use second‐level features, such as minutiae, which are more reliable in comparison with the first group. Owing to a large number of minutiae in a palmprint, ∼1000 minutiae, the matching process is time consuming. In this study, a new minutia‐based matching strategy is proposed to make the matching process faster and more efficient. First, an orientation field estimation algorithm based on region‐growing is proposed, which emphasises selecting seed points with higher quality. Second, the estimated orientation field is used to align palmprint images to the same coordinate system, resulting in fewer computations during minutia matching. Finally, a new minutia descriptor based on the orientation field is designed to distinguish minutiae with different local orientation structures. This descriptor helps to find two mated minutiae much faster, speeding up the matching process. The proposed palmprint matching algorithm has been evaluated on the THUPALMLAB database, and the results show the superiority of the proposed algorithm over most of the state‐of‐the‐art algorithms.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.924
Threshold uncertainty score0.565

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0030.012
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.023
GPT teacher head0.260
Teacher spread0.237 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it