Beruflich Dokumente
Kultur Dokumente
http://scgwww.epfl.ch/courses
Dr. Andrzej Drygajlo, ELE 233
andrzej.drygajlo@epfl.ch
Speech Processing and Biometrics Group (GTPB)
Laboratoire de lIDIAP (LIDIAP)
Signal Processing Institute (ITS)
Swiss Federal Institute of Technology Lausanne (EPFL)
National Center of Competence in Research (NCCR)
Interactive Multimodal Information Management (IM)2
IDIAP Research Institute, Martigny
Examen
Question 1
Production et perception de la parole
Analyse et modlisation de la parole
Question 2
Reconnaissance de la parole et du locuteur
Synthse de la parole
Compression et codage de la parole
Question 3
Calcul
20 minutes de prparatifs et 20 minutes de rponses
Question 1
tonie)
3. Effet de masque simultan (frquentiel)
4. Bandes critiques (chelles Bark et mel)
Question 1
Question 2
3.
4.
5.
6.
Question 2
Synthse de la parole
7. Synthtiseur formants
8. Synthtiseur prdiction lineaire
9. Synthse de messages et synthse partir du
texte
Synthse par diphones
Synthse par rgles
Question 2
Question 3
Calcul
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Spectrogramme
Coefficients cepstraux
Coefficients de prdiction linaire et dnergie
rsiduelle de prdiction
Frquence centrale du formant
Coefficients de corrlation partielle
Distance accumule
Probabilit totale et maximale dmission
Restimation de paramtres du modle
"Segment list generation
Allocation de bits
Spectrogramme (1)
Spectrogramme (2)
Coefficients cepstraux
x ( n ) = n , n = 0, , N 1
avec = 0.5, N = 4, p = 1
Ce signal est produit par un systme autorgressif dordre 1:
1
X (z)
=
T (z) =
U ( z ) 1 + a (1) z 1
x ( n ) = a (1) x ( n 1) + u ( n )
ou
u (n) = (n)
et
a (1) = = 0.5
+ k3
r (2) r (1) r (0) r (1)
E3
E2
0
= + k3 =
0
E 0
2
Distance accumule
Dterminez un chemin w qui donne une distance accumule D( I , J )
minimale entre un mot de test T(I=5) et un mot de rfrence
R(J=3), si le contraintes locales sont de type C:
D (i 1, j )
D (i, j 1)
D(1,1) = 2 d (1,1)
Probabilit totale
a 22 = 1 .0 b22 ( 2) = 0.7
La probabilit en avant
1 .0 0 .3
0 .0
a12 = 0 .4
b12 (1) = 0.5
b (2) = 0.5
12
1 .0 0 .3
0 .2
1
a11 = 0 .6 b (1) = 0.8
11
b (2) = 0.2
11
1 .0 0 .7
0.76
0 .4 0 .5
0 .6 0 .8
j (t )
0.16
0 .4 0 .5
0 .6 0 .8
0 .4 0 .5
0 .6 0 .2
1.0
0.48
0 .23
0 .03
t=0
t =1
t=2
t =3
x1
1 t =0 j=I
j (t ) = (t 1) a B ( X (t )) t > 0
i
ij
ij
x1
x2
La probabilit totale
F ( L ) = PTOT ( X ) = P ( X W )
Probabilit maximale
a 22 = 1 .0 b22 ( 2) = 0.7
1 .0 0 .3
0 .0
a12 = 0 .4
b12 (1) = 0.5
b (2) = 0.5
12
1 .0 0 .3
0 .2
0.09
0 .4 0 .5
0 .6 0 .8
1 .0 0 .7
0.06
0 .4 0 .5
0 .6 0 .8
0 .4 0 .5
0 .6 0 .2
1.0
0.48
0 .23
0 .03
t=0
t =1
t=2
t =3
x1
x1
x2
p j (t ) = max [ p i (t 1) a ij ] bij ( x (t ))
i
Restimation de a11
a 22 = 1 .0 b22 ( 2) = 0.7
1.0
a12 = 0 .4
b12 (1) = 0.5
b (2) = 0.5
12
0 .6 0 .8
1.0
0.24
t=0
t =1
x1
11 (1) =
0 .0
t=2
x1
t =3
x2
Restimation de a11
a 22 = 1 .0 b22 ( 2) = 0.7
1.0
a12 = 0 .4
b12 (1) = 0.5
b ( 2) = 0.5
12
0 .6 0 .8
1.0
0.48
0 .2
0 .0
t=0
t =1
t=2
t =3
x1
11 (2) =
x1
x2
Restimation de a11
a 22 = 1 .0 b22 ( 2) = 0.7
a12 = 0 .4
b12 (1) = 0.5
b ( 2) = 0.5
12
0 .6 0 .2
1.0
0.48
0 .23
0 .0
t=0
t =1
t=2
t =3
x1
x1
x2
a11 =
t =1
t =1
11
11
(t )
(t ) + 12 (t )
0.996
= 0.51
0.996 + 0.97
11 (2) =
Duration of sub-segments
_s
#100
#50
sI
#30
#90
I_
#90
#200
Allocation de bits
Dcomposition en deux sous-bandes
1 2
a) = = x
2
16 2
1 2
2
2
b) x0 = x and x1 = x
17
17
2
x0
Pour
b N = 3 2 = 6
2
x1
trouvez
b0 et b1
x2 2
1
=3
a) b0 = 3 + log 2
12
2
2
2
[( x 2)( x 2)]
16 x2 17
1
=4
b) b0 = 3 + log 2
12
2
2
2
[(16 x 17 )( x 17 )]
b0 + b1 = b N
Contenu