arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.04034eess.AS

针对抗欺骗攻击的说话人验证优化 a-DCF

Optimizing a-DCF for Spoofing-Robust Speaker Verification

Oğuzhan Kurnaz, Jagabandhu Mishra, Tomi H. Kinnunen, Cemal Hanilçi

AI总结:

本文提出一种直接优化a-DCF的抗欺骗ASV系统,结合BCE与阈值优化及分数融合技术,在ASVspoof2019数据集上显著降低了最小a-DCF,提升了系统鲁棒性。

摘要:

自动说话人验证(ASV)系统容易受到欺骗攻击。我们提出了一种抗欺骗的ASV系统,直接针对最近引入的架构无关检测代价函数(a-DCF)进行优化,该函数允许在用户便利性和抗欺骗鲁棒性这两个矛盾目标之间设定所需的权衡。我们将a-DCF与二元交叉熵(BCE)以及一种新颖直接的阈值优化技术相结合。我们在ASVspoof2019数据集上使用嵌入融合系统的结果表明,相较于仅使用BCE训练的系统,相对提升了13%(最小a-DCF从0.1445降至0.1254)。使用一种替代的非线性分数融合方法,相对提升了43%(最小a-DCF从0.0508降至0.0289)。

英文摘要:

Automatic speaker verification (ASV) systems are vulnerable to spoofing attacks. We propose a spoofing-robust ASV system optimized directly for the recently introduced architecture-agnostic detection cost function (a-DCF), which allows targeting a desired trade-off between the contradicting aims of user convenience and robustness to spoofing. We combine a-DCF and binary cross-entropy (BCE) with a novel straightforward threshold optimization technique. Our results with an embedding fusion system on ASVspoof2019 data demonstrate relative improvement of $13\%$ over a system trained using BCE only (from minimum a-DCF of $0.1445$ to $0.1254$). Using an alternative non-linear score fusion approach provides relative improvement of $43\%$ (from minimum a-DCF of $0.0508$ to $0.0289$).

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑