A new spectral smoothing algorithm for unit concatenating speech synthesis

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 319
  • Download : 2
Speech unit concatenation with a large database is presently the most popular method for speech synthesis. In this approach, the mismatches at the unit boundaries are unavoidable and become one of the reasons for quality degradation. This paper proposes an algorithm to reduce undesired discontinuities between the subsequent units. Optimal matching points are calculated in two steps. Firstly, the Kullback-Leibler distance measurement is utilized for the spectral matching, then the unit sliding and the overlap windowing are used for the waveform matching. The proposed algorithm is implemented for the corpus-based unit concatenating Korean text-to-speech system that has an automatically labeled database. Experimental results show that our algorithm is fairly better than the raw concatenation or the overlap smoothing method.
Publisher
SPRINGER-VERLAG BERLIN
Issue Date
2005
Language
English
Article Type
Article; Proceedings Paper
Citation

AI 2005: ADVANCES IN ARTIFICIAL INTELLIGENCE BOOK SERIES: LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, v.3809, pp.550 - 556

ISSN
0302-9743
URI
http://hdl.handle.net/10203/14621
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0