Beruflich Dokumente
Kultur Dokumente
www.ijarcsse.com
Definition
The Hidden Markov Model (HMM) is a variant of a finite
state machine having a set of hidden states Q, an output
alphabet (observations) O, transition probabilities A, output
(emission) probabilities B, and initial state probabilities II.
The current state is not observable. Instead, each state
produces an output with a certain probability (B). Usually
the states Q, and outputs O, are understood, so an HMM is
said to be a triple (A, B, II).
Description of HMM
For the description figure 1 shows an example of Hidden
Markov Model, The model consists of a number of states,
shown as the circles in figure. At time t the model is in one
0.9
0.7
0.6
0.1
0.4
0.1
0.1
A aij
0.9
0
0
0
B b jk
1.0
0.1
0.6
0
0.4
0
0
0
0
0
0.7
0
0
0.3
0.4
0
0.1
0.0
0.7
0.2
0.0
0.4
0.1
0.6
0.8
0.2
0.1
0.8
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0.0
0
0
0
0.6
1.0
0.0
0.0
0.3
0.8
1.0
0.0
Figure 1: A Five State Left-Right, Discrete HMM for Four Output Symbols.
A HMM is characterized by the following:
Page | 401
www.ijarcsse.com
ij
1, i.
j, k and
jk
1, j.
.oT) =
P (o ) .
i
i 1
t (i) max
( q1, q2 .....qT 1 )
Reference:
1.
Anusuya and Katti (2009), Speech Recognition by
Machine: A Review, International Journal of Computer
Science and Information Security, Vol. 6, No. 3, pp.181205.
2.
AbdulKadir K, (2010), Recognition of Human
Speech using q-Bernstein Polynominals, International
Journal of Computer Application, Vol. 2 No. 5, pp. 22-28.
3.
Reddy, R. (1976), Speech Recognition by
Machine: A Review, in proceedings of IEEE transaction ,
Vol. 64, No. 4, pp. 501-531.
4.
Gaikwad, Gawali and Yannawar(2010), A Review
on Speech Recognition Technique, International Journal of
Computer Applications, Vol. 10, No.3, pp. 16-24.
5.
Atal, Bishnu S. and Rabiner, Lawrence R. (1976),
A Pattern Recognition Approach to Voiced- Unvoiced
Classificaton with Application to Speech Recognition, in
proceedings of the IEEE International Conference on
Page | 402
www.ijarcsse.com
Page | 403