InforLorV4, PascalFrancis, Corpus, bibRecord, 000A60

Automatic pitch marking for speech transformations via TD-PSOLA

Identifieur interne : 000A60 ( PascalFrancis/Corpus ); précédent : 000A59; suivant : 000A61

Automatic pitch marking for speech transformations via TD-PSOLA

Auteurs : Y. Laprie ; V. Colotte

Source :

RBID : Pascal:00-0169058

Descripteurs français

Pascal (Inist)
- Traitement parole, Reconnaissance automatique, Tonie, Repérage, Optimisation, Programmation dynamique, Time domain pitch synchronous overlap-add.

English descriptors

KwdEn :
- Automatic recognition, Dynamic programming, Marking, Optimization, Pitch(acoustics), Speech processing.

Abstract

This paper describes an automatic pitch marking method which can be used in the context of modifying speech signals with TD-PSOLA (Time Domain Pitch Synchronous Overlap-Add). Unlike other approaches where glottal closure instants are searched directly in the speech signal, our approach exploits results of a pitch extraction algorithm. The principle is to optimize the propagation of pitch marks from one pitch period to the following by means of dynamic programming. The first step consists of extracting extrema on regularly spaced segments, the size of which is the smallest pitch period in the signal under investigation. Then, an optimal subset of extrema, which represent pitch marks, is found by a dynamic programming algorithm which derives from a smoothing algorithm proposed by Ney. Pitch marks obtained through this post-synchronization algorithm allow very good speech signal transformations. Furthermore, this algorithm has the advantage that it is independent from the pitch determination step which allows it to be easily combined with any algorithm for pitch extraction.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A08	`01`	`1`	`ENG`	`@1 Automatic pitch marking for speech transformations via TD-PSOLA`
A09	`01`	`1`	`ENG`	`@1 Signal processing IX : theories and applications : Rhodes, 8-11 September 1998`
A11	`01`	`1`		`@1 LAPRIE (Y.)`
A11	`02`	`1`		`@1 COLOTTE (V.)`
A12	`01`	`1`		`@1 THEODORIDIS (S.) @9 ed.`
A12	`02`	`1`		`@1 PITAS (I.) @9 ed.`
A12	`03`	`1`		`@1 STOURAITIS (A.) @9 ed.`
A12	`04`	`1`		`@1 KALOUPTSIDIS (N.) @9 ed.`
A14	`01`			`@1 LORIA, Bâtiment LORIA, Campus scientifique, B.P. 239 @2 54506 Vandoeuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut.`
A18	`01`	`1`		`@1 University of Athens @3 GRC @9 patr.`
A18	`02`	`1`		`@1 Computer Technology Institute @2 Patras @3 GRC @9 patr.`
A18	`03`	`1`		`@1 European Association for Signal Processing @2 Lausanne @3 CHE @9 patr.`
A20				`@1 1133-1136`
A21				`@1 1998`
A23	`01`			`@0 ENG`
A25	`01`			`@1 Typorama @2 Patras`
A26	`01`			`@0 960-7620-05-4`
A30	`01`	`1`	`ENG`	`@1 Eusipco : European signal processing conference @2 9 @3 Rhodes GRC @4 1998-09-08`
A43	`01`			`@1 INIST @2 Y 32493 @5 354000080066042790`
A44				`@0 0000 @1 © 2000 INIST-CNRS. All rights reserved.`
A45				`@0 6 ref.`
A47	`01`	`1`		`@0 00-0169058`
A60				`@1 C`
A61				`@0 A`
A66	`01`			`@0 GRC`
C01	`01`		`ENG`	@0 This paper describes an automatic pitch marking method which can be used in the context of modifying speech signals with TD-PSOLA (Time Domain Pitch Synchronous Overlap-Add). Unlike other approaches where glottal closure instants are searched directly in the speech signal, our approach exploits results of a pitch extraction algorithm. The principle is to optimize the propagation of pitch marks from one pitch period to the following by means of dynamic programming. The first step consists of extracting extrema on regularly spaced segments, the size of which is the smallest pitch period in the signal under investigation. Then, an optimal subset of extrema, which represent pitch marks, is found by a dynamic programming algorithm which derives from a smoothing algorithm proposed by Ney. Pitch marks obtained through this post-synchronization algorithm allow very good speech signal transformations. Furthermore, this algorithm has the advantage that it is independent from the pitch determination step which allows it to be easily combined with any algorithm for pitch extraction.
C02	`01`	`X`		`@0 001D04A05B`
C02	`02`	`X`		`@0 001D02C04`
C03	`01`	`X`	`FRE`	`@0 Traitement parole @5 01`
C03	`01`	`X`	`ENG`	`@0 Speech processing @5 01`
C03	`01`	`X`	`SPA`	`@0 Tratamiento palabra @5 01`
C03	`02`	`X`	`FRE`	`@0 Reconnaissance automatique @5 02`
C03	`02`	`X`	`ENG`	`@0 Automatic recognition @5 02`
C03	`02`	`X`	`SPA`	`@0 Reconocimiento automático @5 02`
C03	`03`	`X`	`FRE`	`@0 Tonie @5 03`
C03	`03`	`X`	`ENG`	`@0 Pitch(acoustics) @5 03`
C03	`03`	`X`	`SPA`	`@0 Altura sonida @5 03`
C03	`04`	`X`	`FRE`	`@0 Repérage @5 04`
C03	`04`	`X`	`ENG`	`@0 Marking @5 04`
C03	`04`	`X`	`SPA`	`@0 Marcación @5 04`
C03	`05`	`X`	`FRE`	`@0 Optimisation @5 05`
C03	`05`	`X`	`ENG`	`@0 Optimization @5 05`
C03	`05`	`X`	`SPA`	`@0 Optimización @5 05`
C03	`06`	`X`	`FRE`	`@0 Programmation dynamique @5 06`
C03	`06`	`X`	`ENG`	`@0 Dynamic programming @5 06`
C03	`06`	`X`	`SPA`	`@0 Programación dinámica @5 06`
C03	`07`	`X`	`FRE`	`@0 Time domain pitch synchronous overlap-add @4 INC @5 72`
N21				`@1 122`

Format Inist (serveur)

NO :	PASCAL 00-0169058 INIST
ET :	Automatic pitch marking for speech transformations via TD-PSOLA
AU :	LAPRIE (Y.); COLOTTE (V.); THEODORIDIS (S.); PITAS (I.); STOURAITIS (A.); KALOUPTSIDIS (N.)
AF :	LORIA, Bâtiment LORIA, Campus scientifique, B.P. 239/54506 Vandoeuvre-lès-Nancy/France (1 aut., 2 aut.)
DT :	Congrès; Niveau analytique
SO :	Eusipco : European signal processing conference/9/1998-09-08/Rhodes GRC; Grèce; Patras: Typorama; Da. 1998; Pp. 1133-1136; ISBN 960-7620-05-4
LA :	Anglais
EA :	This paper describes an automatic pitch marking method which can be used in the context of modifying speech signals with TD-PSOLA (Time Domain Pitch Synchronous Overlap-Add). Unlike other approaches where glottal closure instants are searched directly in the speech signal, our approach exploits results of a pitch extraction algorithm. The principle is to optimize the propagation of pitch marks from one pitch period to the following by means of dynamic programming. The first step consists of extracting extrema on regularly spaced segments, the size of which is the smallest pitch period in the signal under investigation. Then, an optimal subset of extrema, which represent pitch marks, is found by a dynamic programming algorithm which derives from a smoothing algorithm proposed by Ney. Pitch marks obtained through this post-synchronization algorithm allow very good speech signal transformations. Furthermore, this algorithm has the advantage that it is independent from the pitch determination step which allows it to be easily combined with any algorithm for pitch extraction.
CC :	001D04A05B; 001D02C04
FD :	Traitement parole; Reconnaissance automatique; Tonie; Repérage; Optimisation; Programmation dynamique; Time domain pitch synchronous overlap-add
ED :	Speech processing; Automatic recognition; Pitch(acoustics); Marking; Optimization; Dynamic programming
SD :	Tratamiento palabra; Reconocimiento automático; Altura sonida; Marcación; Optimización; Programación dinámica
LO :	INIST-Y 32493.354000080066042790
ID :	00-0169058

Links to Exploration step

Pascal:00-0169058

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Automatic pitch marking for speech transformations via TD-PSOLA</title>
<author><name sortKey="Laprie, Y" sort="Laprie, Y" uniqKey="Laprie Y" first="Y." last="Laprie">Y. Laprie</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, Bâtiment LORIA, Campus scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Colotte, V" sort="Colotte, V" uniqKey="Colotte V" first="V." last="Colotte">V. Colotte</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, Bâtiment LORIA, Campus scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">00-0169058</idno>
<date when="1998">1998</date>
<idno type="stanalyst">PASCAL 00-0169058 INIST</idno>
<idno type="RBID">Pascal:00-0169058</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000A60</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Automatic pitch marking for speech transformations via TD-PSOLA</title>
<author><name sortKey="Laprie, Y" sort="Laprie, Y" uniqKey="Laprie Y" first="Y." last="Laprie">Y. Laprie</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, Bâtiment LORIA, Campus scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Colotte, V" sort="Colotte, V" uniqKey="Colotte V" first="V." last="Colotte">V. Colotte</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA, Bâtiment LORIA, Campus scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Automatic recognition</term>
<term>Dynamic programming</term>
<term>Marking</term>
<term>Optimization</term>
<term>Pitch(acoustics)</term>
<term>Speech processing</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Traitement parole</term>
<term>Reconnaissance automatique</term>
<term>Tonie</term>
<term>Repérage</term>
<term>Optimisation</term>
<term>Programmation dynamique</term>
<term>Time domain pitch synchronous overlap-add</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper describes an automatic pitch marking method which can be used in the context of modifying speech signals with TD-PSOLA (Time Domain Pitch Synchronous Overlap-Add). Unlike other approaches where glottal closure instants are searched directly in the speech signal, our approach exploits results of a pitch extraction algorithm. The principle is to optimize the propagation of pitch marks from one pitch period to the following by means of dynamic programming. The first step consists of extracting extrema on regularly spaced segments, the size of which is the smallest pitch period in the signal under investigation. Then, an optimal subset of extrema, which represent pitch marks, is found by a dynamic programming algorithm which derives from a smoothing algorithm proposed by Ney. Pitch marks obtained through this post-synchronization algorithm allow very good speech signal transformations. Furthermore, this algorithm has the advantage that it is independent from the pitch determination step which allows it to be easily combined with any algorithm for pitch extraction.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA08 i1="01" i2="1" l="ENG"><s1>Automatic pitch marking for speech transformations via TD-PSOLA</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Signal processing IX : theories and applications : Rhodes, 8-11 September 1998</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>LAPRIE (Y.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>COLOTTE (V.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>THEODORIDIS (S.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>PITAS (I.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="03" i2="1"><s1>STOURAITIS (A.)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="04" i2="1"><s1>KALOUPTSIDIS (N.)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA, Bâtiment LORIA, Campus scientifique, B.P. 239</s1>
<s2>54506 Vandoeuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14>
<fA18 i1="01" i2="1"><s1>University of Athens</s1>
<s3>GRC</s3>
<s9>patr.</s9>
</fA18>
<fA18 i1="02" i2="1"><s1>Computer Technology Institute</s1>
<s2>Patras</s2>
<s3>GRC</s3>
<s9>patr.</s9>
</fA18>
<fA18 i1="03" i2="1"><s1>European Association for Signal Processing</s1>
<s2>Lausanne</s2>
<s3>CHE</s3>
<s9>patr.</s9>
</fA18>
<fA20><s1>1133-1136</s1>
</fA20>
<fA21><s1>1998</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA25 i1="01"><s1>Typorama</s1>
<s2>Patras</s2>
</fA25>
<fA26 i1="01"><s0>960-7620-05-4</s0>
</fA26>
<fA30 i1="01" i2="1" l="ENG"><s1>Eusipco : European signal processing conference</s1>
<s2>9</s2>
<s3>Rhodes GRC</s3>
<s4>1998-09-08</s4>
</fA30>
<fA43 i1="01"><s1>INIST</s1>
<s2>Y 32493</s2>
<s5>354000080066042790</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2000 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>6 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>00-0169058</s0>
</fA47>
<fA60><s1>C</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA66 i1="01"><s0>GRC</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>This paper describes an automatic pitch marking method which can be used in the context of modifying speech signals with TD-PSOLA (Time Domain Pitch Synchronous Overlap-Add). Unlike other approaches where glottal closure instants are searched directly in the speech signal, our approach exploits results of a pitch extraction algorithm. The principle is to optimize the propagation of pitch marks from one pitch period to the following by means of dynamic programming. The first step consists of extracting extrema on regularly spaced segments, the size of which is the smallest pitch period in the signal under investigation. Then, an optimal subset of extrema, which represent pitch marks, is found by a dynamic programming algorithm which derives from a smoothing algorithm proposed by Ney. Pitch marks obtained through this post-synchronization algorithm allow very good speech signal transformations. Furthermore, this algorithm has the advantage that it is independent from the pitch determination step which allows it to be easily combined with any algorithm for pitch extraction.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D04A05B</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D02C04</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Traitement parole</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Speech processing</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Tratamiento palabra</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Reconnaissance automatique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Automatic recognition</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Reconocimiento automático</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Tonie</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Pitch(acoustics)</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Altura sonida</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Repérage</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Marking</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Marcación</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Optimisation</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Optimization</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Optimización</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Programmation dynamique</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Dynamic programming</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Programación dinámica</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Time domain pitch synchronous overlap-add</s0>
<s4>INC</s4>
<s5>72</s5>
</fC03>
<fN21><s1>122</s1>
</fN21>
</pA>
</standard>
<server><NO>PASCAL 00-0169058 INIST</NO>
<ET>Automatic pitch marking for speech transformations via TD-PSOLA</ET>
<AU>LAPRIE (Y.); COLOTTE (V.); THEODORIDIS (S.); PITAS (I.); STOURAITIS (A.); KALOUPTSIDIS (N.)</AU>
<AF>LORIA, Bâtiment LORIA, Campus scientifique, B.P. 239/54506 Vandoeuvre-lès-Nancy/France (1 aut., 2 aut.)</AF>
<DT>Congrès; Niveau analytique</DT>
<SO>Eusipco : European signal processing conference/9/1998-09-08/Rhodes GRC; Grèce; Patras: Typorama; Da. 1998; Pp. 1133-1136; ISBN 960-7620-05-4</SO>
<LA>Anglais</LA>
<EA>This paper describes an automatic pitch marking method which can be used in the context of modifying speech signals with TD-PSOLA (Time Domain Pitch Synchronous Overlap-Add). Unlike other approaches where glottal closure instants are searched directly in the speech signal, our approach exploits results of a pitch extraction algorithm. The principle is to optimize the propagation of pitch marks from one pitch period to the following by means of dynamic programming. The first step consists of extracting extrema on regularly spaced segments, the size of which is the smallest pitch period in the signal under investigation. Then, an optimal subset of extrema, which represent pitch marks, is found by a dynamic programming algorithm which derives from a smoothing algorithm proposed by Ney. Pitch marks obtained through this post-synchronization algorithm allow very good speech signal transformations. Furthermore, this algorithm has the advantage that it is independent from the pitch determination step which allows it to be easily combined with any algorithm for pitch extraction.</EA>
<CC>001D04A05B; 001D02C04</CC>
<FD>Traitement parole; Reconnaissance automatique; Tonie; Repérage; Optimisation; Programmation dynamique; Time domain pitch synchronous overlap-add</FD>
<ED>Speech processing; Automatic recognition; Pitch(acoustics); Marking; Optimization; Dynamic programming</ED>
<SD>Tratamiento palabra; Reconocimiento automático; Altura sonida; Marcación; Optimización; Programación dinámica</SD>
<LO>INIST-Y 32493.354000080066042790</LO>
<ID>00-0169058</ID>
</server>
</inist>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000A60 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000A60 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Corpus
   |type=    RBID
   |clé=     Pascal:00-0169058
   |texte=   Automatic pitch marking for speech transformations via TD-PSOLA
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

Automatic pitch marking for speech transformations via TD-PSOLA

Automatic pitch marking for speech transformations via TD-PSOLA

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri