|
Viterbi Algorithm
Section 1 - Page 10
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
Generalising the above expression, the probability of the
partial best path to a state i at time t when the observation kt
is seen, is :
Here, we are assuming knowledge of the previous state, using the
transition probabilites and multiplying by the appropriate
observation probability. We then select the maximum such.
|
|