# A Tutorial on Hidden Markov Models and Selected Applications

@article{Rabiner1989ATO, title={A Tutorial on Hidden Markov Models and Selected Applications}, author={Lawrence R. Rabiner}, journal={Proceedings of the IEEE}, year={1989} }

The fabric comprises a novel type of netting which will have particular utility in screening out mosquitoes and like insects and pests. The fabric is defined of voids having depth as well as width and length. The fabric is usable as a material from which to form clothing for wear, or bed coverings, or sleeping bags, etc., besides use simply as a netting.

## Figures and Tables from this paper

## 24,933 Citations

Investigating hidden Markov models' capabilities in 2D shape classification

- Computer ScienceIEEE Transactions on Pattern Analysis and Machine Intelligence
- 2004

The results of tests show that the proposed system is able to accurately classify objects that were translated, rotated, occluded, or deformed by shearing, also in the presence of noise.

An Exponential Representation in the API Algorithm for Hidden Markov Models Training

- Computer ScienceArtificial Evolution
- 2005

A transformation of the search space that preserves API's vectorial moves is introduced and it is shown how an efficient ant based algorithm, called API, can be adapted to the difficult problem of Hidden Markov Models training.

A Hidden Markov Model with Controlled Non-parametric Emissions

- Computer ScienceICAISC
- 2016

A novel nonparametric model is introduced to model and control emission densities of a non-ergodic hidden Markov model that allows the vocabulary of trained patterns to grow without any concern about growing into a negative set.

A generalized risk-based approach to segmentation based on hidden Markov models

- Computer ScienceArXiv
- 2010

Simple modifications of the classical optimization criteria for hidden path inference lead to a new class of hidden path estimators that are more explicit and have clear interpretations, and bypass the issue of numerical scaling, which can be particularly valuable for applications.

Classifying bags of keypoints using HMMs

- Computer ScienceACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010
- 2010

A Hidden Markov Models is used to classify bags of SURF keypoints descriptors of a given class and a prospective of expanding this application to include the detection and classification of moving objects in a video stream using optical flow and Self Organizing Maps (SOM).

The orl active floor

- Computer Science
- 1997

In this article a novel type of sensor system called the Active Floor is presented that allows the time varying spatial weight distribution of the active office environment to be captured. The…

Dynamic Texture Recognition using a Hybrid Generative-Discriminative Approach with Hidden Markov Models and Support Vector Machines

- Computer Science2019 IEEE Global Conference on Signal and Information Processing (GlobalSIP)
- 2019

This paper proposes the use of Fisher kernels with Dirichlet based and Beta-Liouville based hidden Markov models (HMM) for dynamic textures recognition and demonstrates promising results on the DynTeX Alpha dataset.

Simultaneous Feature and Model Selection for Continuous Hidden Markov Models

- Computer ScienceIEEE Signal Processing Letters
- 2012

In this letter, a novel approach of simultaneous feature and model selection for continuous hidden Markov model (CHMM) is proposed, using a variational Bayesian framework to infer the feature saliencies, the number of hidden states, and the parameters of the CHMM simultaneously.

Some Experiments with Hidden Markov Models Project Report : CAP 6610

- Computer Science
- 2005

The basic functionality of HMM is studied and the limits of the model are explored by testing the model on synthetically generated data belonging to increasingly complex probability distributions.

Interactive hidden Markov models and their applications

- Computer Science
- 2007

This paper proposes an Interactive Hidden Markov Model (IHMM), in which the observable states are affected directly by the hidden states, but not vice versa, and develops an efficient estimation method for the model parameters.

## References

SHOWING 1-10 OF 98 REFERENCES

Maximum-likelihood estimation for mixture multivariate stochastic observations of Markov chains

- MathematicsAT&T Technical Journal
- 1985

The scope of the original reestimation algorithm is expanded and the previous assumptions of log concavity or ellipsoidal symmetry are obviated, thereby enhancing the modeling capability of the technique.

Maximum likelihood estimation for multivariate mixture observations of markov chains

- MathematicsIEEE Trans. Inf. Theory
- 1986

To use probabilistic functions of a Markov chain to model certain parameterizations of the speech signal, we extend an estimation technique of Liporace to the eases of multivariate mixtures, such as…

A probabilistic distance measure for hidden Markov models

- Computer ScienceAT&T Technical Journal
- 1985

We propose a probabilistic distance measure for measuring the dissimilarity between pairs of hidden Markov models with arbitrary observation densities. The measure is based on the Kullback-Leibler…

Maximum likelihood estimation for multivariate observations of Markov sources

- MathematicsIEEE Trans. Inf. Theory
- 1982

Parameter estimation for multivariate functions of Markov chains, a class of versatile statistical models for vector random processes, is discussed, and a powerful representation theorem by Fan is employed to generalize the analysis of Baum, et al. to a larger class of distributions.

Some properties of continuous hidden Markov model representations

- Computer ScienceAT&T Technical Journal
- 1985

It is shown that the Baum-Welch reestimation method can be generalized to handle mixtures of elliptically symmetric pdf's, and any continuous pdf can be approximated to any desired accuracy by such mixtures, in particular, by mixture of multivariate Gaussian pdf's.

A minimum discrimination information approach for hidden Markov modeling

- Computer ScienceIEEE Trans. Inf. Theory
- 1989

The MDI approach is shown to be a descent algorithm for the discrimination information measure, and its local convergence is proved.

An introduction to the application of the theory of probabilistic functions of a Markov process to automatic speech recognition

- Computer ScienceThe Bell System Technical Journal
- 1983

This paper presents several of the salient theoretical and practical issues associated with modeling a speech signal as a probabilistic function of a (hidden) Markov chain, and focuses on a particular class of Markov models, which are especially appropriate for isolated word recognition.

Recognition of isolated digits using hidden Markov models with continuous mixture densities

- Computer ScienceAT&T Technical Journal
- 1985

In this paper we extend previous work on isolated-word recognition based on hidden Markov models by replacing the discrete symbol representation of the speech signal with a continuous Gaussian…

An inequality with applications to statistical estimation for probabilistic functions of Markov processes and to a model for ecology

- Mathematics
- 1967

1. Summary. The object of this note is to prove the theorem below and sketch two applications, one to statistical estimation for (proba-bilistic) functions of Markov processes [l] and one to…

On the application of vector quantization and hidden Markov models to speaker-independent, isolated word recognition

- Computer ScienceThe Bell System Technical Journal
- 1983

In this paper we present an approach to speaker-independent, isolated word recognition in which the well-known techniques of vector quantization and hidden Markov modeling are combined with a linear…