|
Viterbi Algorithm
Section 1 - Page 11
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
2d. Back pointers,
's
Consider the trellis
At each intermediate and end state we know the partial
probability,
(i,t). However the aim is to find the most
probable sequence of states through the trellis given an
observation sequence - therefore we need some way of remembering
the partial best paths through the trellis.
|
|