arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.03416eess.SPcs.LGcs.SDeess.AS

唤醒还是不唤醒:通过逐步细化降低关键词误报

To Wake-up or Not to Wake-up: Reducing Keyword False Alarm by Successive Refinement

Samsung Research America(三星美国研究院)

Yashas Malur Saidutta, Rakshith Sharma Srinivasa, Ching-Hua Lee, Chouchang Yang, Yilin Shen, Hongxia Jin

AI总结:

本文提出基于全概率定律的逐步细化方法,通过语音、关键词、具体关键词的三阶段分类降低关键词检测系统的误报率,且该方法即插即用,适用于任意深度模型。

摘要:

关键词检测系统持续处理音频流以检测关键词。设计此类系统时最具挑战性的任务之一是降低误报(FA),即当关键词未被说出时系统错误地记录了关键词。本文提出了一种简单而优雅的解决方案,该方案源自全概率定律。我们表明,现有的深度关键词检测机制可以通过逐步细化来改进:系统首先分类输入音频是否为语音,接着分类输入是否类似于关键词,最后分类说出了哪个关键词。我们在多个模型上进行了实验,模型规模从13K参数到2.41M参数不等,结果表明逐步细化技术在域内保留的FA数据上将FA降低至多8倍,在域外(OOD)FA数据上降低至多7倍。此外,我们提出的方法是“即插即用”的,可应用于任何深度关键词检测模型。

英文摘要:

Keyword spotting systems continuously process audio streams to detect keywords. One of the most challenging tasks in designing such systems is to reduce False Alarm (FA) which happens when the system falsely registers a keyword despite the keyword not being uttered. In this paper, we propose a simple yet elegant solution to this problem that follows from the law of total probability. We show that existing deep keyword spotting mechanisms can be improved by Successive Refinement, where the system first classifies whether the input audio is speech or not, followed by whether the input is keyword-like or not, and finally classifies which keyword was uttered. We show across multiple models with size ranging from 13K parameters to 2.41M parameters, the successive refinement technique reduces FA by up to a factor of 8 on in-domain held-out FA data, and up to a factor of 7 on out-of-domain (OOD) FA data. Further, our proposed approach is "plug-and-play" and can be applied to any deep keyword spotting model.

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

↑