Scribd
Upload
22 views19 pages

Applications of Basic Problems For HMMs

This document discusses three main applications of hidden Markov models (HMMs): 1) state sequence decoding using the Viterbi algorithm to find the most likely hidden state sequence for an observed sequence, 2) observation sequence evaluation to calculate the probability of an observation sequence, and 3) other applications of HMMs such as speech recognition and modeling genetic sequences. Examples of using HMMs for dice experiments, coin tossing, and spoken digit recognition are provided.

Uploaded by

Nam Quân
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
22 views19 pages

Applications of Basic Problems For HMMs

This document discusses three main applications of hidden Markov models (HMMs): 1) state sequence decoding using the Viterbi algorithm to find the most likely hidden state sequence for an observed sequence, 2) observation sequence evaluation to calculate the probability of an observation sequence, and 3) other applications of HMMs such as speech recognition and modeling genetic sequences. Examples of using HMMs for dice experiments, coin tossing, and spoken digit recognition are provided.

Uploaded by

Nam Quân
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Applications of Basic

Problems for HMMs

Team 4 13es
Tran Nam Quan Nguyen Viet Minh Tue
Le Dinh Hoai Loc Le Tu Chanh Tri
Outline
1. State Sequence Decoding
Example: Dice & coins.
2.Observation Sequence
Evaluation
Example: Spoken digit recognition.
3. Other applications of HMMs

2
State Sequence Decoding
The aim of decoding is to discover the hidden state
sequence that most likely describes a given observation
sequence.
One solution to this problem is to use the Viterbi
algorithm, which finds the single best state sequence for
an observation sequence.
Parameter : The probability of the most probable
state path for the partial observation sequence:
Dice experiment State
sequence decoding
Matlab Viterbi algorithm
Observation Sequence
Evaluation
Observation Sequence
Evaluation
Using Matlab
Digit Recognition Example
Digit Recognition Example
Digit Recognition Example
Digit Recognition Example
Observation Sequence
Evaluation
Observation Sequence
Evaluation
Other applications of
HMMs
Other applications of
HMMs
Other applications of
HMMs
Other applications of
HMMs
References
Rabiner, L.R.; , "A tutorial on hidden Markov models and
selected applications in speech recognition," Proceedings of
the IEEE , vol.77, no.2, pp.257-286, Feb 1989.
John R. Deller, John, and John H. L. Hansen. Discrete-Time
Processing of Speech Signals. Prentice Hall, New Jersey,
1987.
Barbara Resch (modified Erhard and Car Line Rank and
Mathew Magimai-doss); Hidden Markov Models A Tutorial
for the Course Computational Intelligence.
Henry Stark and John W. Woods. Probability and Random
Processes with Applications to Signal Processing (3rd
Edition). Prentice Hall, 3 edition, August 2001.
HTKBook: http://htk.eng.cam.ac.uk/docs/docs.shtml

You might also like