About: Quality Improvements of Zero-Concatenation-Cost Chain Based Unit Selection

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Quality Improvements of Zero-Concatenation-Cost Chain Based Unit Selection Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://link.springer.com/chapter/10.1007%2F978-3-319-11581-8_47
Description	In our previous work, we introduced a zero-concatenation-cost (ZCC) chain based framework of unit-selection speech synthesis. This framework proved to be very fast as it reduced the computational load of a unit-selection system up to hundreds of time. Since the ZCC chain based algorithm principally prefers to select longer segments of speech, an increased number of audible artifacts were expected to occur at concatenation points of longer ZCC chains. Indeed, listening tests revealed a number of artifacts present in synthetic speech; however, the artifacts occurred in a similar extent in synthetic speech produced by both ZCC chain based and standard Viterbi search algorithms. In this paper, we focus on the sources of the artifacts and we propose improvements of the synthetic speech quality within the ZCC algorithm. The quality and computational demands of the improved ZCC algorithm are compared to the unit-selection algorithm based on the standard Viterbi search. In our previous work, we introduced a zero-concatenation-cost (ZCC) chain based framework of unit-selection speech synthesis. This framework proved to be very fast as it reduced the computational load of a unit-selection system up to hundreds of time. Since the ZCC chain based algorithm principally prefers to select longer segments of speech, an increased number of audible artifacts were expected to occur at concatenation points of longer ZCC chains. Indeed, listening tests revealed a number of artifacts present in synthetic speech; however, the artifacts occurred in a similar extent in synthetic speech produced by both ZCC chain based and standard Viterbi search algorithms. In this paper, we focus on the sources of the artifacts and we propose improvements of the synthetic speech quality within the ZCC algorithm. The quality and computational demands of the improved ZCC algorithm are compared to the unit-selection algorithm based on the standard Viterbi search. (en)
Title	Quality Improvements of Zero-Concatenation-Cost Chain Based Unit Selection Quality Improvements of Zero-Concatenation-Cost Chain Based Unit Selection (en)
skos:prefLabel	Quality Improvements of Zero-Concatenation-Cost Chain Based Unit Selection Quality Improvements of Zero-Concatenation-Cost Chain Based Unit Selection (en)
skos:notation	RIV/49777513:23520/14:43923340!RIV15-TA0-23520___
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(TA01030476), S
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Kala, Jiří Matoušek, Jindřich
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Západočeská univerzita v Plzni / Fakulta aplikovaných věd
http://linked.open...dnocenehoVysledku	41027
http://linked.open...ai/riv/idVysledku	RIV/49777513:23520/14:43923340
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	speech synthesis, unit selection, Viterbi algorithm, zero-concatenation- cost chain, duration, F0, ZCC (en)
http://linked.open.../riv/klicoveSlovo	F0 duration speech synthesis unit selection Viterbi algorithm ZCC zero-concatenation- cost chain
http://linked.open...ontrolniKodProRIV	[A6F85D1799B1]
http://linked.open...v/mistoKonaniAkce	Novi Sad, Serbia
http://linked.open...i/riv/mistoVydani	Heidelberg
http://linked.open...i/riv/nazevZdroje	Speech and Computer, 16th International Conference, SPECOM 2014, Novi Sad, Serbia, October 5-9, 2014, Proceedings
http://linked.open...in/vavai/riv/obor	JD
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Intelligent technologies for improving air traffic security
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Kala, Jiří Matoušek, Jindřich
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-10-05 (xsd:date)
issn	0302-9743
number of pages	10 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-319-11581-8_47
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-319-11580-1
http://localhost/t...ganizacniJednotka	23520

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software