{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/t-dcf-a-detection-cost-function-for-the","title":"t-DCF: a Detection Cost Function for the Tandem Assessment of Spoofing Countermeasures and Automatic Speaker Verification","arxiv_id":"1804.09618","date":"2018-04-25","proceeding":null,"authors":["Tomi Kinnunen","Kong Aik Lee","Hector Delgado","Nicholas Evans","Massimiliano Todisco","Md Sahidullah","Junichi Yamagishi","Douglas A. Reynolds"],"abstract":"The ASVspoof challenge series was born to spearhead research in anti-spoofing\nfor automatic speaker verification (ASV). The two challenge editions in 2015\nand 2017 involved the assessment of spoofing countermeasures (CMs) in isolation\nfrom ASV using an equal error rate (EER) metric. While a strategic approach to\nassessment at the time, it has certain shortcomings. First, the CM EER is not\nnecessarily a reliable predictor of performance when ASV and CMs are combined.\nSecond, the EER operating point is ill-suited to user authentication\napplications, e.g. telephone banking, characterised by a high target user prior\nbut a low spoofing attack prior. We aim to migrate from CM- to ASV-centric\nassessment with the aid of a new tandem detection cost function (t-DCF) metric.\nIt extends the conventional DCF used in ASV research to scenarios involving\nspoofing attacks. The t-DCF metric has 6 parameters: (i) false alarm and miss\ncosts for both systems, and (ii) prior probabilities of target and spoof trials\n(with an implied third, nontarget prior). The study is intended to serve as a\nself-contained, tutorial-like presentation. We analyse with the t-DCF a\nselection of top-performing CM submissions to the 2015 and 2017 editions of\nASVspoof, with a focus on the spoofing attack prior. Whereas there is little to\nchoose between countermeasure systems for lower priors, system rankings derived\nwith the EER and t-DCF show differences for higher priors. We observe some\nranking changes. Findings support the adoption of the DCF-based metric into the\nroadmap for future ASVspoof challenges, and possibly for other biometric\nanti-spoofing evaluations.","url_abs":"http://arxiv.org/abs/1804.09618v2","url_pdf":"http://arxiv.org/pdf/1804.09618v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"t-dcf-a-detection-cost-function-for-the","repo_url":"https://github.com/magnumresearchgroup/auxiliaryrawnet","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"speaker-verification","task_name":"Speaker Verification"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"magnumresearchgroup/auxiliaryrawnet","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b66d1aed43acb6854f40a12fb2a44215bd6126e25ee42b8d0759c8906a50a60d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}