基于KSVD的声学聚类快速在线自适应

S. Shahnawazuddin, R. Sinha
{"title":"基于KSVD的声学聚类快速在线自适应","authors":"S. Shahnawazuddin, R. Sinha","doi":"10.1109/INDCON.2013.6725938","DOIUrl":null,"url":null,"abstract":"In this work, the issues of on-line adaptation for real-time applications are addressed. In such systems, unsupervised adaptation has to performed with a very small amount of adaptation data. Furthermore, in such tasks, the computational complexity involved should be as low as possible to keep the system latency in check. To address both these issues, a model interpolation based fast adaptation procedure, employing speaker cluster models as bases, is presented in this work. It is observed that the acoustic clustering of the training speakers to derive the bases greatly reduces the complexity in comparison to the techniques which employ speaker adapted models as bases. Apart from this, a KSVD based acoustic clustering scheme is also proposed. Acoustic clustering in supervised as well unsupervised mode is explored in this work. The proposed on-line adaptation procedure employing the KSVD clustering, is found to result in a relative improvement of 6% in WER on an LVCSR task.","PeriodicalId":313185,"journal":{"name":"2013 Annual IEEE India Conference (INDICON)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Fast on-line adaptation using KSVD based acoustic clustering\",\"authors\":\"S. Shahnawazuddin, R. Sinha\",\"doi\":\"10.1109/INDCON.2013.6725938\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, the issues of on-line adaptation for real-time applications are addressed. In such systems, unsupervised adaptation has to performed with a very small amount of adaptation data. Furthermore, in such tasks, the computational complexity involved should be as low as possible to keep the system latency in check. To address both these issues, a model interpolation based fast adaptation procedure, employing speaker cluster models as bases, is presented in this work. It is observed that the acoustic clustering of the training speakers to derive the bases greatly reduces the complexity in comparison to the techniques which employ speaker adapted models as bases. Apart from this, a KSVD based acoustic clustering scheme is also proposed. Acoustic clustering in supervised as well unsupervised mode is explored in this work. The proposed on-line adaptation procedure employing the KSVD clustering, is found to result in a relative improvement of 6% in WER on an LVCSR task.\",\"PeriodicalId\":313185,\"journal\":{\"name\":\"2013 Annual IEEE India Conference (INDICON)\",\"volume\":\"60 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Annual IEEE India Conference (INDICON)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDCON.2013.6725938\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Annual IEEE India Conference (INDICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDCON.2013.6725938","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在这项工作中,解决了实时应用的在线适应问题。在这样的系统中,无监督的适应必须用非常少的适应数据来完成。此外,在这类任务中,所涉及的计算复杂性应该尽可能低,以控制系统延迟。为了解决这两个问题,本文提出了一种基于模型插值的快速自适应方法,该方法以说话人聚类模型为基础。结果表明,利用训练说话人的声学聚类来推导基库的方法与使用说话人适应模型作为基库的方法相比,大大降低了基库的复杂性。此外,还提出了一种基于KSVD的声学聚类方案。本研究探讨了有监督和无监督模式下的声学聚类。采用KSVD聚类的在线自适应过程在LVCSR任务上相对提高了6%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Fast on-line adaptation using KSVD based acoustic clustering
In this work, the issues of on-line adaptation for real-time applications are addressed. In such systems, unsupervised adaptation has to performed with a very small amount of adaptation data. Furthermore, in such tasks, the computational complexity involved should be as low as possible to keep the system latency in check. To address both these issues, a model interpolation based fast adaptation procedure, employing speaker cluster models as bases, is presented in this work. It is observed that the acoustic clustering of the training speakers to derive the bases greatly reduces the complexity in comparison to the techniques which employ speaker adapted models as bases. Apart from this, a KSVD based acoustic clustering scheme is also proposed. Acoustic clustering in supervised as well unsupervised mode is explored in this work. The proposed on-line adaptation procedure employing the KSVD clustering, is found to result in a relative improvement of 6% in WER on an LVCSR task.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Analysis of sleep mode operation with modified non-exhaustive vacation queuing Performance analysis of next generation 3-D OFDM based optical access networks under various system impairments Hardware realization of high speed elliptic curve point multiplication using multiple Point Doublers and point adders Lifetime of a CDMA wireless sensor network with route diversity RF based train collision avoidance system
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1