DocumentCode
2173682
Title
Subspace constrained LU decomposition of FMLLR for rapid adaptation
Author
Jia, Lei ; Yu, Dong ; Xu, Bo
Author_Institution
Digital Media Content Technol. Res. Center, Chinese Acad. of Sci., China
fYear
2011
fDate
22-27 May 2011
Firstpage
4448
Lastpage
4451
Abstract
This paper describes subspace constrained feature space maximum likelihood linear regression (FMLLR) for rapid adaptation. The test speaker´s FMLLR rotation matrix is decomposed into the product of two triangular matrices which are restricted to lie in two subspaces spanned by upper and lower triangular matrix basis. The basis matrices could be obtained from training speaker´s FMLLR matrices by maximum likelihood (ML) transformation selection and then LU decomposition with available adaptation data. The basis weights could be estimated efficiently by solving two convex optimization problems alternatively aiming to maximize the likelihood of adaptation data. Experimental results show that the method could get significant improvement over full MLLR and Eigenspace-based MLLR[1] while keeping advantages of FMLLR for rapid adaptation in ASR application for car-navigation.
Keywords
matrix algebra; maximum likelihood estimation; regression analysis; speech recognition; ASR application; ML transformation selection; car-navigation; feature space maximum likelihood linear regression; rapid adaptation; speech recognition applications; subspace constrained LU decomposition; test speaker FMLLR rotation matrix; Adaptation models; Hidden Markov models; Interpolation; Mathematical model; Matrix decomposition; Optimization; Training data; LU decomposition; rapid adaptation; subspace constrained feature space transformation;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech and Signal Processing (ICASSP), 2011 IEEE International Conference on
Conference_Location
Prague
ISSN
1520-6149
Print_ISBN
978-1-4577-0538-0
Electronic_ISBN
1520-6149
Type
conf
DOI
10.1109/ICASSP.2011.5947341
Filename
5947341
Link To Document