首页 | 本学科首页   官方微博 | 高级检索  
     

基于循环最大期望修正算法的与文本无关话者识别研究
引用本文:谢建平,成新民.基于循环最大期望修正算法的与文本无关话者识别研究[J].声学技术,2008,27(5):708-711.
作者姓名:谢建平  成新民
作者单位:1. 丽水学院计算机与信息工程学院,浙江丽水,323000
2. 湖州师范学院信息工程学院,浙江湖州,313000
摘    要:话者识别中目标模型的最大期望算法存在着出现奇异阵的重大缺陷,而最大似然估计虽然不会出现奇异阵,但识别率比较低。提出了一种循环最大期望修正算法,采用最大似然估计所得模型为初始模型,然后用最大期望算法中每步的模型,通过α值控制修正比例对其进行修正。实验结果表明,该修正算法较好地克服了奇异阵的出现,同时提高了识别率。

关 键 词:话者识别  最大期望算法  循环最大期望修正算法
收稿时间:2007/8/5 0:00:00
修稿时间:2007/12/11 0:00:00

Text-independent speaker recognition based on recurring expectation maximum adjustment algorithm
XIE Jian-ping and CHENG Xin-min.Text-independent speaker recognition based on recurring expectation maximum adjustment algorithm[J].Technical Acoustics,2008,27(5):708-711.
Authors:XIE Jian-ping and CHENG Xin-min
Affiliation:XIE Jian-ping, CHENG Xin-min (1. School of Computer and Information Engineering, Lishui College, Lishui 323000, Zhejiang, China; 2. School of Information Engineering, Huzhou Teachers College, Huzhou 313000, Zhejiang, China)
Abstract:For the expectation fantastic array, the targeted model in speaker recognition maximum algorithm, and although the there is fatal default of fantastic array about maximum likelihood estimate can't appear but there is lower rate of recognition. A recurring expectation maximum adjustment algorithm is proposed to utilize the maximum likelihood estimate to gain the initial models. These initial models are modified according to controlling adjustment rate with every model in the expectation maximum algorithm. Then more optimal models can be obtained. The results of the experiments show that the adjustment algorithm can conquer fantastic array well, and improve rate of recognition.
Keywords:speaker recognition  EM algorithm  recurring EM adjustment algorithm
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《声学技术》浏览原始摘要信息
点击此处可从《声学技术》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号