Fast approach to speaker identification for large population using MLLR and sufficient statistics

A. K. Sarkar, S. Rath, S. Umesh
{"title":"Fast approach to speaker identification for large population using MLLR and sufficient statistics","authors":"A. K. Sarkar, S. Rath, S. Umesh","doi":"10.1109/NCC.2010.5430206","DOIUrl":null,"url":null,"abstract":"In speaker identification, most of the computational processing time is required to calculate the likelihood of the test utterance of the unknown speaker with respect to the speaker models in the database. When number of speakers in the database is in the order of 10,000 or more, then computational complexity becomes very high. In this paper, we propose a Maximum Likelihood Linear Regression (MLLR) based fast method to calculate the likelihood from the speaker model using the MLLR matrix. The proposed technique will help to quickly find the best N speakers during identification. After that final speaker identification task can be done within the N selected speakers using any conventional method of speaker identification. The comparative study of the proposed method is done in terms of processing time with the state-of-the-art GMM-UBM based system on NIST 2004 SRE. The proposed technique performs faster than GMM-UBM based system with some degradation in system accuracy.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 National Conference On Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2010.5430206","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In speaker identification, most of the computational processing time is required to calculate the likelihood of the test utterance of the unknown speaker with respect to the speaker models in the database. When number of speakers in the database is in the order of 10,000 or more, then computational complexity becomes very high. In this paper, we propose a Maximum Likelihood Linear Regression (MLLR) based fast method to calculate the likelihood from the speaker model using the MLLR matrix. The proposed technique will help to quickly find the best N speakers during identification. After that final speaker identification task can be done within the N selected speakers using any conventional method of speaker identification. The comparative study of the proposed method is done in terms of processing time with the state-of-the-art GMM-UBM based system on NIST 2004 SRE. The proposed technique performs faster than GMM-UBM based system with some degradation in system accuracy.
基于MLLR和充分统计量的大群体说话人识别方法
在说话人识别中,大部分计算处理时间用于计算未知说话人的测试话语相对于数据库中的说话人模型的似然。当数据库中的说话人数量达到10,000或更多时,计算复杂度变得非常高。本文提出了一种基于最大似然线性回归(MLLR)的快速方法,利用MLLR矩阵从说话人模型中计算似然。提出的技术将有助于在识别过程中快速找到最佳的N个说话人。之后,可以使用任何传统的说话人识别方法在N个选定的说话人中完成最终的说话人识别任务。在处理时间方面,与NIST 2004 SRE上最先进的基于GMM-UBM的系统进行了比较研究。该技术比基于GMM-UBM的系统运行速度快,但系统精度有所下降。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信