loading...
Robustness of Linear Discriminant Analysis in Automatic Speech Recognition
Quebec City, QC, Canada August 11-August 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2002.104792116th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Marcel Katz, Otto-von-Guericke University, University of Applied Science Düsseldorf and Philips Research Laboratories
Hans-Günter Meier, University of Applied Science Düsseldorf
Hans Dolfing, Philips Research Laboratories
Dietrich Klakow, Philips Research Laboratories
This paper focuses on the problem of a robust estimation of different transformation matrices based on the well known linear discriminant analysis (LDA) as it is used in automatic speech recognition systems. We investigate the effect of class distributions with artificial features and compare the resulting Fisher criterion. This paper shows that it is not very helpful to use only the Fisher criterion for an assessment of class separability. Furthermore we address the problem of dealing with too many additional dimensions in the estimation. Special experiments performed on subsets of the Wallstreet Journal database (WSJ) indicate that a minimum of about 2000 feature vectors per class is needed for robust estimations with monophones. Finally we make a prediction to future experiments on the LDA matrix estimation with more classes.
Citation:
Marcel Katz, Hans-Günter Meier, Hans Dolfing, Dietrich Klakow, "Robustness of Linear Discriminant Analysis in Automatic Speech Recognition," icpr, vol. 3, pp.30371, 16th International Conference on Pattern Recognition (ICPR'02) - Volume 3, 2002
Usage of this product signifies your acceptance of the Terms of Use.


Suggestions