树形说话人聚类,快速适应说话人

T. Kosaka, S. Sagayama
{"title":"树形说话人聚类,快速适应说话人","authors":"T. Kosaka, S. Sagayama","doi":"10.1109/ICASSP.1994.389309","DOIUrl":null,"url":null,"abstract":"The paper proposes a tree-structured speaker clustering algorithm and discusses its application to fast speaker adaptation. By tracing the clustering tree from top to bottom, adaptation is performed step-by-step from global to local individuality of speech. This adaptation method employs successive branch selection in the speaker clustering tree rather than parameter training and hence achieves fast adaptation using only a small amount of training data. This speaker adaptation method was applied to a hidden Markov network (HMnet) and evaluated in Japanese phoneme and phrase recognition experiments, in which it significantly outperformed speaker-independent recognition methods. In the phrase recognition experiments, the method reduced the error rate by 26.6% using three phrase utterances (approximately 2.7 seconds).<<ETX>>","PeriodicalId":290798,"journal":{"name":"Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"66","resultStr":"{\"title\":\"Tree-structured speaker clustering for fast speaker adaptation\",\"authors\":\"T. Kosaka, S. Sagayama\",\"doi\":\"10.1109/ICASSP.1994.389309\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper proposes a tree-structured speaker clustering algorithm and discusses its application to fast speaker adaptation. By tracing the clustering tree from top to bottom, adaptation is performed step-by-step from global to local individuality of speech. This adaptation method employs successive branch selection in the speaker clustering tree rather than parameter training and hence achieves fast adaptation using only a small amount of training data. This speaker adaptation method was applied to a hidden Markov network (HMnet) and evaluated in Japanese phoneme and phrase recognition experiments, in which it significantly outperformed speaker-independent recognition methods. In the phrase recognition experiments, the method reduced the error rate by 26.6% using three phrase utterances (approximately 2.7 seconds).<<ETX>>\",\"PeriodicalId\":290798,\"journal\":{\"name\":\"Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"66\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASSP.1994.389309\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.1994.389309","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 66

摘要

提出了一种树状结构的说话人聚类算法,并讨论了该算法在说话人快速自适应中的应用。通过从上到下跟踪聚类树,逐步实现从全局到局部的语音个性化适应。该自适应方法采用说话人聚类树的连续分支选择,而不是参数训练,因此只需少量的训练数据即可实现快速自适应。将该方法应用于隐马尔可夫网络(HMnet),并在日语音素和短语识别实验中进行了评价,结果表明该方法明显优于不依赖于说话人的识别方法。在短语识别实验中,该方法使用3个短语(约2.7秒)将错误率降低了26.6%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Tree-structured speaker clustering for fast speaker adaptation
The paper proposes a tree-structured speaker clustering algorithm and discusses its application to fast speaker adaptation. By tracing the clustering tree from top to bottom, adaptation is performed step-by-step from global to local individuality of speech. This adaptation method employs successive branch selection in the speaker clustering tree rather than parameter training and hence achieves fast adaptation using only a small amount of training data. This speaker adaptation method was applied to a hidden Markov network (HMnet) and evaluated in Japanese phoneme and phrase recognition experiments, in which it significantly outperformed speaker-independent recognition methods. In the phrase recognition experiments, the method reduced the error rate by 26.6% using three phrase utterances (approximately 2.7 seconds).<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A new cumulant based parameter estimation method for noncausal autoregressive systems Using Gaussian mixture modeling in speech recognition An evaluation of cross-language adaptation for rapid HMM development in a new language Unsupervised segmentation of radar images using wavelet decomposition and cumulants Improving speech recognition performance via phone-dependent VQ codebooks and adaptive language models in SPHINX-II
×
引用
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