MétaCan
Menu
Back to cohort
Record W4405843673 · doi:10.1038/s41598-024-82223-y

Enhancing practicality and efficiency of deepfake detection

2024· article· en· W4405843673 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

VenueScientific Reports · 2024
Typearticle
Languageen
FieldComputer Science
TopicDigital Media Forensic Detection
Canadian institutionsComputer Research Institute of Montréal
FundersNatural Sciences and Engineering Research Council of CanadaMinistère de l'Économie, de l’Innovation et des Exportations du Québec
KeywordsComputer scienceData science

Abstract

fetched live from OpenAlex

The proliferation of deepfake generation has become increasingly widespread. Current solutions for automatically detecting and classifying generated content require substantial computational resources, making them impractical for use by the average non-expert individual, particularly from edge computing applications. In this paper, we propose a series of techniques to accelerate the inference speed of deepfake detection on video data. We also draw inspiration from steganalysis approaches to expose deepfakes as any secret payloads encoded in the image. Furthermore, some key considerations were identified to significantly reduce the size of the core convolutional neural network. The experiment yielded competitive results when evaluated on two second-generation deepfake datasets, namely Celeb-DFv2 and DFDC, while requiring only a fraction of the typical computational cost and resources.

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.002
metaresearch head score (Gemma)0.001
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.561
Threshold uncertainty score0.706

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
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.009
GPT teacher head0.244
Teacher spread0.235 · 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