text-dependent speaker recognition with long-term features

18
Text-Dependent Speaker Recognition with Long-term Features Based on Functional Data Analysis Chenhao Zhang 2012/11/18 1

Upload: others

Post on 08-Feb-2022

5 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Text-Dependent Speaker Recognition with Long-term Features

Text-Dependent Speaker Recognition with Long-term Features Based on

Functional Data Analysis

Chenhao Zhang

2012/11/18

1

Page 2: Text-Dependent Speaker Recognition with Long-term Features

Outline • Introduction

• MFCC-FDA Feature Extraction Framework

• The Distance Measures

• Experiments

• Conclusions

2

Page 3: Text-Dependent Speaker Recognition with Long-term Features

Introduction • Text-Dependent Speaker Recognition (TDSR)

o Speech feature dynamics are exploited to identify different

speakers

o Dynamic Time Warping (DTW)/HMM

• Speech feature vector plays a key role in

TDSR o The short-term speech feature, like MFCC

1. Capture the highly local portion of the significant temporal

dynamics

2. Not reflect some certain overall statistical characteristics

hidden behind the sentences

3

Page 4: Text-Dependent Speaker Recognition with Long-term Features

Introduction • Functional Data Analysis (FDA)

o Formulate the problem to statistical thinking and analysis

o The way to combine the short-term features and the extra information obtained by looking at all the data as a whole

o FDA theory shows good performance on the speech feature analysis and speech re-synthesis

• Jim Ramsay and Bernard Silverman introduced FDA in the late 1990's

• M. Gubian, “Functional Data Analysis for Speech Research”, InterSpeech 2011

4

Page 5: Text-Dependent Speaker Recognition with Long-term Features

MFCC-FDA Feature Extraction

Framework

5

Page 6: Text-Dependent Speaker Recognition with Long-term Features

The Basis Functions • The basis functions 𝜙𝑘 , 𝑘 = 1,⋯ ,𝐾 are combined

linearly, the function 𝑥𝑖 𝑡 which will be represent

the data is defined in mathematical notation as

𝑥𝑖 𝑡 = 𝑐𝑖𝑘𝜙𝑘 𝑡 = 𝒄𝒊′𝝓(𝒕)

𝐾

𝑘=1

and called a basis function expansion, 𝑐𝑖1, 𝑐𝑖2,⋯ , 𝑐𝑖𝐾 are the coefficients of the expansion

• The Fourier basis functions will be used to simulate

the MFCC feature. Fourier basis functions will be:

𝜙0 𝑡 = 1, 𝜙2𝑟−1 𝑡 = sin 𝑟𝜔𝑡, 𝜙2𝑟 𝑡 = cos 𝑟𝜔𝑡 .

6

Page 7: Text-Dependent Speaker Recognition with Long-term Features

The Calculation of Coefficients c • Defining data fitting as the minimization of the sum

of squared errors or residuals:

min 𝑆𝑆𝐸 𝑦𝑖 𝑐 = 𝑦𝑖𝑗 − 𝑐𝑖𝑘𝜙𝑘 𝑡𝑗

𝐾

𝑘=1

2𝑛

𝑗=1

• The overfitting problem or the underfitting problem: o Make sure the closeness of the fit is good enough.

o Make sure the overfitting will not exist, that is, no dramatic changes in a

local range.

7

Page 8: Text-Dependent Speaker Recognition with Long-term Features

Roughness Penalty Method

• The integration of square of the second derivate

𝑃𝐸𝑁2 𝑥 = 𝐷2𝑥 𝑠 2𝑑𝑠 = 𝐷2𝑥 2

• The two goals are opposite, so the middle ground of SSE

and 𝑃𝐸𝑁2 should be taken, the criterion can be built as:

𝑃𝐸𝑁𝑆𝑆𝐸𝜆 = 𝑦𝑖 − 𝑥 𝑡𝑗2+ 𝜆 ∗ 𝑃𝐸𝑁2 𝑥

𝑗

• The solution of the criterion should be Generalized Cross-

Validation o G. H. Golub, M. Heath and G. Wahba, “Generalized Cross-Validation as a

Method for Choosing a Good Ridge Parameter”, Technometrics ,Vol. 21, No. 2,

May, 1979

8

Page 9: Text-Dependent Speaker Recognition with Long-term Features

Functional Principle Component

Analysis • The original data 𝑥𝑖1, 𝑥𝑖2, ⋯ , 𝑥𝑖𝑝 is converted into function

𝑥𝑖 𝑡 , FPCA provides a way to compress the functional

data information as :

𝑓𝑖 = 𝛽 𝑠 𝑥𝑖 𝑠 𝑑𝑠 = 𝜷𝒙𝒊

𝑇

𝑜

• 𝑓𝑖 is the i-th functional principal component for the

functional data 𝑥𝑖 𝑡 , so this problem can be abstracted

as the formulate as:

max 𝑉𝑎𝑟 𝑓′ =1

𝑁 𝜷𝒙𝒊

2𝑁

𝑖=1

𝑠. 𝑡 𝛽 𝑠 2𝑑𝑠 = 𝜷 2 = 1

9

Page 10: Text-Dependent Speaker Recognition with Long-term Features

The Distance Meatures • The MFCC-FDA feature

o The short-term time dynamics

o The overall envelop information

• Different distance measures have different space

description properties (Amplitude distance/ Angle)

𝑑𝑀𝑖𝑛𝑘 = 𝑥1𝑘 − 𝑥2𝑘𝑃

𝑛

𝑘=1

𝑃

𝑆𝑐𝑜𝑠 = 𝑥1𝑘𝑥2𝑘𝑛𝑘=1

𝑥1𝑘2𝑛

𝑘=1 𝑥2𝑘2𝑛

𝑘=1

10

Page 11: Text-Dependent Speaker Recognition with Long-term Features

Experiments o Database : The noisy data was recorded by Sony Computer

Entertainment America with PlaystationEye at three-meter

distance in an office fan noise environment

• 5 different speakers / 240 different short words /3 times

• 16 kHz sampling rate with 16-bit width

o Conditions

• 32 –dimensional MFCC feature vector

• The number of basis functions 𝐾 is 17

• The smoothing parameter 𝜆 is 10e-4

11

Page 12: Text-Dependent Speaker Recognition with Long-term Features

Results and Analysis • Baseline System: Dynamic Time Warping method

with MFCC feature

• It can be found that compared with the classic

MFCC-DTW system, the performance of directly

using the FDA coefficients as the new feature is not

good enough

Method EER

MFCC-DTW (Baseline) 6.13%

MFCC-FDA 9.54%

12

Page 13: Text-Dependent Speaker Recognition with Long-term Features

FPCA Results • The Performance after applying the functional PCA

• FPCA shows great improvement over just FDA coefficients, it effectively reduces the redundant information

• The MFCC-FPCA plus Euclidean Distance can achieve an equivalent performance as the classic MFCC-DTW TDSR system.

MFCC-FPCA (nharm)

1 3 5 7 9

EER (%) 11.80 7.95 6.31 6.15 6.01

13

Page 14: Text-Dependent Speaker Recognition with Long-term Features

The influence of distance measures

Similarity Measuremen

t

Euclidean Distance

Manhattan

Distance

Chebyshev Distance

Cosine Similarit

y

EER (%) 7.31 7.06 9.62 2.49

• MFCC-FPCA plus cosine similarity gave the best

performance

• The angle between the coefficient vectors shows

more significance than the difference between the

amplitude of the vectors

14

Page 15: Text-Dependent Speaker Recognition with Long-term Features

Conclusions • The new text-dependent speaker recognition

method based on the FDA theory and the MFCC

feature gave better performance over DTW

method

• This method combines the advantage of short-term

speech dynamics and the global statistical

information

• The MFCC-FDA feature will work better with the

cosine similarity measure

15

Page 16: Text-Dependent Speaker Recognition with Long-term Features

FDA are much more than that • Pre-Processing

o Local weighting smoothing methods

o Roughness penalty: Regularization Basis Function

• Registration o Continuous Registration

• Functional linear models for Scale/Functional

Responses

• Functional canonical correlation and discriminant

analysis

• Functional cluster analysis

16

Page 17: Text-Dependent Speaker Recognition with Long-term Features

References • [1]. Ramsay, J. O. and B. W. Silverman (2005).

Functional Data Analysis, Second Edition.New York: Springer.

• [2]. Functional Data Analysis with R and Matlab, Ramsay, JO, Hooker, Giles, and Graves, Spencer, Springer 2009

• [3]. A Tutorial on Functional Data Analysis for Speech Research, Michele Gubian, interspeech 2011, http://lands.let.ru.nl/FDA/FDA_Tutorials.htm

• [4].The study on the methods of functional data analysis and their application, Liurui Qin, Xiamen University, PHD thesis

17

Page 18: Text-Dependent Speaker Recognition with Long-term Features

Thank you!

18