Whisper to Neutral Mapping Using I-Vector Space Likelihood and a Cosine Similarity Based Iterative Optimization for Whispered Speaker Verification

Abinay Reddy Naini, Achuth Rao M V, P. Ghosh
{"title":"Whisper to Neutral Mapping Using I-Vector Space Likelihood and a Cosine Similarity Based Iterative Optimization for Whispered Speaker Verification","authors":"Abinay Reddy Naini, Achuth Rao M V, P. Ghosh","doi":"10.1109/NCC55593.2022.9806732","DOIUrl":null,"url":null,"abstract":"In this work, we propose an iterative optimization algorithm to learn a feature mapping (FM) from the whispered to neutral speech features. Such an FM can be used to improve the performance of speaker verification (SV) systems when presented with a whispered speech. In one of previous works, the equal error rate (EER) in an SV task has been shown to improve by ~24%. based on an FM network trained using a cosine similarity based loss function over that using a mean squared error based objective function. As the mapped whispered features obtained in this manner may not lie in the trained i-vector space, we, in this work, iteratively optimize the i-vector space likelihood (by updating T-matrix) and a cosine similarity based loss function for learning the parameters of the FM network. The proposed iterative optimization improves the EER by ~26% compared to when the FM network parameters are learned based on only cosine similarity based loss function without any T-matrix update, which is a special case of the proposed iterative optimization.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC55593.2022.9806732","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this work, we propose an iterative optimization algorithm to learn a feature mapping (FM) from the whispered to neutral speech features. Such an FM can be used to improve the performance of speaker verification (SV) systems when presented with a whispered speech. In one of previous works, the equal error rate (EER) in an SV task has been shown to improve by ~24%. based on an FM network trained using a cosine similarity based loss function over that using a mean squared error based objective function. As the mapped whispered features obtained in this manner may not lie in the trained i-vector space, we, in this work, iteratively optimize the i-vector space likelihood (by updating T-matrix) and a cosine similarity based loss function for learning the parameters of the FM network. The proposed iterative optimization improves the EER by ~26% compared to when the FM network parameters are learned based on only cosine similarity based loss function without any T-matrix update, which is a special case of the proposed iterative optimization.
基于i -向量空间似然和余弦相似度的耳语到中立映射的耳语说话者验证迭代优化
在这项工作中,我们提出了一种迭代优化算法来学习从耳语到中性语音特征的特征映射(FM)。这样的调频可以用来提高说话人验证(SV)系统的性能,当呈现低声语音。在先前的一项研究中,SV任务的等错误率(EER)提高了约24%。基于基于余弦相似度的损失函数和基于均方误差的目标函数训练的FM网络。由于以这种方式获得的映射低语特征可能不在训练的i向量空间中,因此我们在这项工作中迭代优化i向量空间的似然(通过更新t矩阵)和基于余弦相似度的损失函数来学习FM网络的参数。与仅基于余弦相似度的损失函数而不进行t矩阵更新的FM网络参数学习相比,本文提出的迭代优化方法将EER提高了约26%,这是本文提出的迭代优化方法的一个特例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信