Effective online unsupervised adaptation of Gaussian mixture models and its application to speech classification

Authors:
Yongxin Zhang;Michael S. Scordilis
Affiliations:
Department of Electrical and Computer Engineering, University of Miami, 1251 Memorial Drive, Room 406, Coral Gables, FL 33146-0640, USA;Department of Electrical and Computer Engineering, University of Miami, 1251 Memorial Drive, Room 406, Coral Gables, FL 33146-0640, USA
Venue:
Pattern Recognition Letters
Year:
2008

Citing 2
Cited 4

A view of the EM algorithm that justifies incremental, sparse, and other variants

Learning in graphical models
Statistical Pattern Recognition: A Review

IEEE Transactions on Pattern Analysis and Machine Intelligence

Proposing an interactive speaking improvement system for EFL learners

Expert Systems with Applications: An International Journal
Ellipsoidal decision regions for motif-based patterned fabric defect detection

Pattern Recognition
Online adaptation strategies for statistical machine translation in post-editing scenarios

Pattern Recognition
A noise-robust speech recognition approach incorporating normalized speech/non-speech likelihood into hypothesis scores

Speech Communication

Quantified Score

Hi-index	0.10

Visualization

Abstract

Online unsupervised adaptation of statistical classifiers is attractive for many speech processing applications. In this work, we describe an online unsupervised adaptation method for a four-way speech classifier which is based on modelling the universal background model (UBM)-GMM and using confidence scoring in deriving classification results. The aim of the proposed method is to automatically adapt the classifier to mismatched conditions caused by acoustically adverse backgrounds and speaker variability. Extensive analysis of the experimental learning curves shows that the new online unsupervised adaptation algorithm achieves practical convergence. When compared to batch mode adaptation the proposed technique deals effectively with data sparsity and it has significantly lower computational requirements at the expense of a slight sacrifice in classification performance. The proposed algorithm can be readily extended to other mixture families and different expectation-maximization (EM) alternatives for improved performance.