scispace - formally typeset
Open AccessJournal Article

A gentle tutorial of the em algorithm and its application to parameter estimation for Gaussian mixture and hidden Markov models

Reads0
Chats0
TLDR
In this paper, the authors describe the EM algorithm for finding the parameters of a mixture of Gaussian densities and a hidden Markov model (HMM) for both discrete and Gaussian mixture observation models.
Abstract
We describe the maximum-likelihood parameter estimation problem and how the ExpectationMaximization (EM) algorithm can be used for its solution. We first describe the abstract form of the EM algorithm as it is often given in the literature. We then develop the EM parameter estimation procedure for two applications: 1) finding the parameters of a mixture of Gaussian densities, and 2) finding the parameters of a hidden Markov model (HMM) (i.e., the Baum-Welch algorithm) for both discrete and Gaussian mixture observation models. We derive the update equations in fairly explicit detail but we do not prove any convergence properties. We try to emphasize intuition rather than mathematical rigor.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Detecting and classifying blurred image regions

TL;DR: This paper revisits the image partial blur detection and classification problem and proposes several new or enhanced local blur measures using different types of image information including color, gradient and spectral information, which demonstrate stronger discriminative power, better across-image stability or higher computational efficiency than previous ones.
Proceedings ArticleDOI

A novel networked traffic parameter forecasting method based on Markov chain model

TL;DR: A novel networked traffic parameter forecasting method that can obtain all the predicted traffic parameters of all the link in the road network using the Markov chain model to predict the traffic parameter.
Proceedings ArticleDOI

Automatic Profiling of Network Event Sequences: Algorithm and Applications

TL;DR: This paper proposes a new method which automatically learns a mixture model which fully captures the sequence behavior including both event pattern and duration between events, and two network management applications are proposed based on the method.
Journal ArticleDOI

Mapping between acoustic and articulatory gestures

TL;DR: A definition for articulatory as well as acoustic gestures is proposed along with a method to segment the measured articulatory trajectories and acoustic waveforms into gestures and a method based on the error in estimated critical points is suggested.
Journal ArticleDOI

A Gaussian Mixture Model Smoother for Continuous Nonlinear Stochastic Dynamical Systems: Theory and Scheme

TL;DR: A novel subspace smoothing methodology for high-dimensional stochastic fields governed by general nonlinear dynamics is obtained, using the fundamental equations and forward–backward algorithms of new Gaussian Mixture Model (GMM) smoothers for both the full state space and dynamic subspace.
References
More filters
Book

The Nature of Statistical Learning Theory

TL;DR: Setting of the learning problem consistency of learning processes bounds on the rate of convergence ofLearning processes controlling the generalization ability of learning process constructing learning algorithms what is important in learning theory?
Book

Matrix computations

Gene H. Golub

Statistical learning theory

TL;DR: Presenting a method for determining the necessary and sufficient conditions for consistency of learning process, the author covers function estimates from small data pools, applying these estimations to real-life problems, and much more.
Book

The Fractal Geometry of Nature

TL;DR: This book is a blend of erudition, popularization, and exposition, and the illustrations include many superb examples of computer graphics that are works of art in their own right.