MétaCan
Menu
Back to cohort
Record W2737080044 · doi:10.1145/3102163.3102239

Time series matching for biometric visual passwords

2017· article· en· W2737080044 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicUser Authentication and Security Systems
Canadian institutionsConcordia University
Fundersnot available
KeywordsBiometricsPasswordComputer scienceMatching (statistics)Series (stratigraphy)Artificial intelligenceComputer visionPattern recognition (psychology)Speech recognitionComputer securityMathematicsStatistics

Abstract

fetched live from OpenAlex

User authentication through silent utterance of a secret phrase, a biometric visual password, has been previously attempted mainly using image based features extracted from video. Using state of the art face tracking, this problem can be framed as a high dimensional time series matching problem covering the motion of a select set of lip points. One major advantage is the small amount of training data needed. We deploy the time and shape correspondence (TSC) matching algorithm given its superior performance when dealing with multidimensional signals with shape and in the presence of noise. We report the results of a user study with 22 participants uttering the password "siggraph rocks". This data base along with other human action data bases we created for gait and gestures are made publicly available for comparison studies by other researchers.

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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.888
Threshold uncertainty score0.783

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.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
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.022
GPT teacher head0.303
Teacher spread0.281 · 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

Citations4
Published2017
Admission routes1
Has abstractyes

Explore more

Same topicUser Authentication and Security SystemsFrench-language works237,207