MétaCan
Menu
Back to cohort
Record W3049178586 · doi:10.1145/3389683

Deep Learning for Multi-instance Biometric Privacy

2020· article· en· W3049178586 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueACM Transactions on Management Information Systems · 2020
Typearticle
Languageen
FieldComputer Science
TopicBiometric Identification and Security
Canadian institutionsUniversity of Calgary
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsBiometricsComputer scienceArtificial intelligenceRandom projectionConvolutional neural networkModality (human–computer interaction)Deep learningAuthentication (law)Identification (biology)Machine learningSupport vector machinePattern recognition (psychology)Computer security

Abstract

fetched live from OpenAlex

The fundamental goal of a revocable biometric system is to defend a user’s biometrics from being compromised. This research explores the application of deep learning or Convolutional Neural Networks to multi-instance biometrics. Modality features are transformed into revocable templates through the application of random projection. During the user authentication phase, we employ Support Vector Machines, chosen over three other alternative classifiers after carrying out a comparative study. Comparison of the proposed method over other standard deep learning models and performance evaluation before and after revocability have also been discussed. Results demonstrate ability to improve identification accuracy and provide sound template security. The system was validated on three multi-instance iris and fingervein databases.

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.000
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: Methods · Consensus signal: none
Teacher disagreement score0.918
Threshold uncertainty score0.629

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.004
Science and technology studies0.0000.000
Scholarly communication0.0010.002
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.062
GPT teacher head0.277
Teacher spread0.215 · 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