Easy, Interpretable, Effective: openSMILE for voice deepfake detection

In this paper, we demonstrate that attacks in the latest ASVspoof5 dataset—a de facto standard in the field of voice authenticity and deepfake detection—can be identified with surprising accuracy using a small subset of very simplistic features. These are derived from the openSMILE library, and are scalar-valued, easy to compute, and human interpretable. For example, attack A10’s unvoiced segments have a mean length of 0.09 ± 0.02, while bona fide instances have a mean length of 0.18 ± 0.07. Using this feature alone, a threshold classifier achieves an Equal Error Rate (EER) of 10.3% for attack A10. Similarly, across all attacks, we achieve up to 0.8% EER, with an overall EER of 15.7 ± 6.0%.We explore the generalization capabilities of these features and find that some of them transfer effectively between attacks, primarily when the attacks originate from similar Text-to-Speech (TTS) architectures. This finding may indicate that voice anti-spoofing is, in part, a problem of identifying and remembering signatures or fingerprints of individual TTS systems. This allows to better understand anti-spoofing models and their challenges in real-world application.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10890543
Citations
2
Primary Topic
Speech Recognition and Synthesis
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Easy, Interpretable, Effective: openSMILE for voice deepfake detection

Dan Oneaţă, Horia Cucu, Octavian Pascu, N Müller
2 citations
Speech Recognition and Synthesis
4.96
article

Easy, Interpretable, Effective: openSMILE for voice deepfake detection

Dan Oneaţă, Horia Cucu, Octavian Pascu, N Müller
article en
2 citations

Abstract

In this paper, we demonstrate that attacks in the latest ASVspoof5 dataset—a de facto standard in the field of voice authenticity and deepfake detection—can be identified with surprising accuracy using a small subset of very simplistic features. These are derived from the openSMILE library, and are scalar-valued, easy to compute, and human interpretable. For example, attack A10’s unvoiced segments have a mean length of 0.09 ± 0.02, while bona fide instances have a mean length of 0.18 ± 0.07. Using this feature alone, a threshold classifier achieves an Equal Error Rate (EER) of 10.3% for attack A10. Similarly, across all attacks, we achieve up to 0.8% EER, with an overall EER of 15.7 ± 6.0%.We explore the generalization capabilities of these features and find that some of them transfer effectively between attacks, primarily when the attacks originate from similar Text-to-Speech (TTS) architectures. This finding may indicate that voice anti-spoofing is, in part, a problem of identifying and remembering signatures or fingerprints of individual TTS systems. This allows to better understand anti-spoofing models and their challenges in real-world application.

Fraunhofer Institute for Applied and Integrated Security (DE), Universitatea Națională de Știință și Tehnologie Politehnica București (RO)
Openalex Percentile: Top 6%
Speech Recognition and Synthesis
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.