检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:何蕊伽 夏秀渝[1] HE Ruijia;XIA Xiuyu(College of Electronic and Information Engineering,Sichuan University,Chengdu 610065,China)
出 处:《计算机与网络》2022年第2期64-69,共6页Computer & Network
摘 要:为快速、准确地判断语音流中是否含有关键词,提出一种基于LSTM两步检索的关键词识别系统。将连续语音流分割成独立音节,然后采用过零率直方图进行初步检索,基于过零率直方图的相似度比较的计算量小,可快速排除非关键词。对初检时判断为关键词的音频片段进行精检,使用基于LSTM的分级系统进行音素识别,通过贪心搜索算法解码以确认是否为目标关键词。仿真结果表明,基于LSTM的网络能更有效提取音素特征,基于两步检索LSTM的关键词识别系统计算量小、速度快、识别率较高,且易于动态扩展目标关键词,具有较好的实时性。A two-step keyword recognition system based on LSTM is proposed to quickly and accurately determine whether there are keywords in speech stream.Firstly,the continuous speech stream is segmented into independent syllables,and then the zero-crossing histogram is used for initial retrieval.The similarity calculation based on the zero-crossing histogram computes less,and non-keywords can be eliminated quickly.Then the speech fragment which is judged as the key word is carefully examined.The phoneme is recognized by the classification system based on LSTM,and then the speech fragment is confirmed as the keyword by greedy search algorithm.The simulation results show that the LSTM network is more effective in extracting phoneme feature.The two-step keyword recognition system based on LSTM has the advantages of small computation,high speed,high recognition rate,easy dynamic expansion of target keywords,and good real-time performance.
关 键 词:关键词识别 语音分割 音素识别 循环神经网络 过零率直方图
分 类 号:TP391.4[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.144.193.1