MétaCan
Menu
Back to cohort
Record W2023618638 · doi:10.1109/icassp.2013.6638210

Design of a Hamming-distance classifier for ECG biometrics

2013· article· en· W2023618638 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.
aboutThe title or abstract carries a Canadian signal from the geographic lexicon.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMedicine
TopicECG Monitoring and Analysis
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsBiometricsHamming distanceClassifier (UML)Computer scienceEuclidean distancePattern recognition (psychology)Artificial intelligenceFeature extractionHamming codeDecoding methodsAlgorithm

Abstract

fetched live from OpenAlex

In existing ECG-based biometric recognition systems, the feature extraction and matching are performed in Euclidean spaces. However, there are many scenarios (e.g., biometric template encryption for privacy protection, or low-complexity classification in an identification mode of operation) in which it is useful to binarize the feature vectors. The main contribution of this paper is a Hamming-distance classifier for ECG biometrics based on SPEC-Hashing. The proposed system was evaluated over a database of ECG signals from 52 different subjects that were collected at the Biometrics Security Laboratory of the University of Toronto. The EER of the Hamming-distance classifier was found to be 5.5% for closed-set matching and 14.82% for open set matching.

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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.790
Threshold uncertainty score0.178

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.067
GPT teacher head0.306
Teacher spread0.239 · 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

Quick stats

Citations12
Published2013
Admission routes2
Has abstractyes

Explore more

Same topicECG Monitoring and AnalysisFrench-language works237,207