Learned dictionaries for sparse representation based unit selection speech synthesis

Pulkit Sharma, V. Abrol, A. Sao
{"title":"Learned dictionaries for sparse representation based unit selection speech synthesis","authors":"Pulkit Sharma, V. Abrol, A. Sao","doi":"10.1109/NCC.2016.7561084","DOIUrl":null,"url":null,"abstract":"In this paper, we have employed learned dictionaries to compute sparse representation of speech utterances, which will be used to reduce the footprint of unit selection based speech synthesis (USS) systems. Speech database labeled at phoneme level is used to obtain multiple examples of the same phoneme, and all the examples (of each phoneme) are then used to learn a single overcomplete dictionary for the same phoneme. Two dictionary learning algorithms namely KSVD (K-singular value decomposition) and GAD (greedy adaptive dictionary) are employed to obtain respective sparse representations. The learned dictionaries are then used to compute the sparse vector for all the speech units corresponding to a speech utterance. Significant coefficients (along with their index locations) of the sparse vector and the learned dictionaries are stored instead of entire speech utterance. During synthesis, the speech waveform is synthesized using the significant coefficients of sparse vector and the corresponding dictionary. Experimental results demonstrate that the quality of the synthesized speech is better using the proposed approach while it achieves comparable compression to the existing compression methods employed in the USS systems.","PeriodicalId":279637,"journal":{"name":"2016 Twenty Second National Conference on Communication (NCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Twenty Second National Conference on Communication (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2016.7561084","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, we have employed learned dictionaries to compute sparse representation of speech utterances, which will be used to reduce the footprint of unit selection based speech synthesis (USS) systems. Speech database labeled at phoneme level is used to obtain multiple examples of the same phoneme, and all the examples (of each phoneme) are then used to learn a single overcomplete dictionary for the same phoneme. Two dictionary learning algorithms namely KSVD (K-singular value decomposition) and GAD (greedy adaptive dictionary) are employed to obtain respective sparse representations. The learned dictionaries are then used to compute the sparse vector for all the speech units corresponding to a speech utterance. Significant coefficients (along with their index locations) of the sparse vector and the learned dictionaries are stored instead of entire speech utterance. During synthesis, the speech waveform is synthesized using the significant coefficients of sparse vector and the corresponding dictionary. Experimental results demonstrate that the quality of the synthesized speech is better using the proposed approach while it achieves comparable compression to the existing compression methods employed in the USS systems.
学习字典稀疏表示为基础的单位选择语音合成
在本文中,我们使用学习字典来计算语音的稀疏表示,这将用于减少基于单元选择的语音合成(USS)系统的内存占用。在音素级别标记的语音数据库用于获得相同音素的多个示例,然后使用所有(每个音素的)示例来学习同一音素的单个过完整字典。采用KSVD (k -奇异值分解)和GAD(贪婪自适应字典)两种字典学习算法分别获得稀疏表示。然后使用学习到的字典来计算与语音话语对应的所有语音单元的稀疏向量。稀疏向量和学习字典的显著系数(以及它们的索引位置)被存储,而不是存储整个语音。在合成过程中,利用稀疏向量的显著系数和相应的字典合成语音波形。实验结果表明,采用该方法合成的语音质量更好,压缩效果与现有的USS系统压缩方法相当。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信