• DocumentCode
    2973631
  • Title

    Generalized likelihood ratio discriminant analysis

  • Author

    Tahir, Muhammad Atif ; Heigold, Georg ; Plahl, Christian ; Schluter, Ralf ; Ney, Hermann

  • Author_Institution
    Comput. Sci. Dept., RWTH Aachen Univ., Aachen, Germany
  • fYear
    2009
  • fDate
    Nov. 13 2009-Dec. 17 2009
  • Firstpage
    76
  • Lastpage
    81
  • Abstract
    Linear Discriminant Analysis (LDA) has been established as an important means for dimension reduction and decorrelation in speech recognition. The major points of criticism of LDA are that it uses an ad hoc and non-discriminative training criterion, and that the estimation is performed in a separate preprocessing step. This paper presents a new discriminative training method for the estimation of (projecting) linear feature transforms. More precisely, the problem is formulated in the loglinear framework, resulting in a convex optimization problem. Experimental results are provided for a digit string recognition task to compare the performance and robustness of the proposed approach (in combination with ML or MMI optimized acoustic models) with conventional LDA. Also, first experiments for a large vocabulary task are presented.
  • Keywords
    convex programming; correlation methods; pattern classification; speech recognition; statistical analysis; convex optimization problem; digit string recognition task; dimension decorrelation; dimension reduction; discriminative training method; linear discriminant analysis; linear feature transformation; log-linear framework; nondiscriminative training criterion; speech recognition; Acoustic scattering; Computer science; Covariance matrix; Decorrelation; Hidden Markov models; Linear discriminant analysis; Linear matrix inequalities; Speech analysis; Speech recognition; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Automatic Speech Recognition & Understanding, 2009. ASRU 2009. IEEE Workshop on
  • Conference_Location
    Merano
  • Print_ISBN
    978-1-4244-5478-5
  • Electronic_ISBN
    978-1-4244-5479-2
  • Type

    conf

  • DOI
    10.1109/ASRU.2009.5373395
  • Filename
    5373395