matthiasm@43
|
1
|
matthiasm@43
|
2 #include "viterbi.h"
|
matthiasm@43
|
3 #include <iostream>
|
matthiasm@43
|
4
|
matthiasm@106
|
5 std::vector<int> ViterbiPath(std::vector<double> init, std::vector<vector<double> > trans, std::vector<vector<double> > obs, double *delta, vector<double> *scale) {
|
matthiasm@43
|
6
|
matthiasm@43
|
7 int nState = init.size();
|
matthiasm@43
|
8 int nFrame = obs.size();
|
matthiasm@43
|
9
|
matthiasm@43
|
10 // check for consistency
|
matthiasm@43
|
11 if (trans[0].size() != nState || trans.size() != nState || obs[0].size() != nState) {
|
matthiasm@43
|
12 cerr << "ERROR: matrix sizes inconsistent." << endl;
|
matthiasm@43
|
13 }
|
mail@119
|
14
|
matthiasm@43
|
15 vector<vector<int> > psi; // "matrix" of remembered indices of the best transitions
|
matthiasm@43
|
16 vector<int> path = vector<int>(nFrame, nState-1); // the final output path (current assignment arbitrary, makes sense only for Chordino, where nChord-1 is the "no chord" label)
|
matthiasm@43
|
17
|
matthiasm@43
|
18 double deltasum = 0;
|
matthiasm@43
|
19
|
matthiasm@43
|
20 /* initialise first frame */
|
matthiasm@43
|
21 for (int iState = 0; iState < nState; ++iState) {
|
matthiasm@94
|
22 delta[iState] = init[iState] * obs[0][iState];
|
matthiasm@50
|
23 deltasum += delta[iState];
|
matthiasm@43
|
24 }
|
matthiasm@50
|
25 for (int iState = 0; iState < nState; ++iState) delta[iState] /= deltasum; // normalise (scale)
|
matthiasm@106
|
26 scale->push_back(1.0/deltasum);
|
matthiasm@43
|
27 psi.push_back(vector<int>(nState,0));
|
matthiasm@43
|
28
|
matthiasm@43
|
29 /* rest of the forward step */
|
matthiasm@43
|
30 for (int iFrame = 1; iFrame < nFrame; ++iFrame) {
|
matthiasm@43
|
31 deltasum = 0;
|
matthiasm@43
|
32 psi.push_back(vector<int>(nState,0));
|
mail@119
|
33 /* every state wants to know which previous state suits it best */
|
matthiasm@43
|
34 for (int jState = 0; jState < nState; ++jState) {
|
matthiasm@43
|
35 int bestState = nState - 1;
|
matthiasm@43
|
36 double bestValue = 0;
|
matthiasm@44
|
37 if (obs[iFrame][jState] > 0) {
|
matthiasm@44
|
38 for (int iState = 0; iState < nState; ++iState) {
|
matthiasm@50
|
39 double currentValue = delta[(iFrame-1) * nState + iState] * trans[iState][jState];
|
matthiasm@44
|
40 if (currentValue > bestValue) {
|
matthiasm@44
|
41 bestValue = currentValue;
|
matthiasm@44
|
42 bestState = iState;
|
matthiasm@44
|
43 }
|
matthiasm@43
|
44 }
|
matthiasm@43
|
45 }
|
mail@119
|
46
|
matthiasm@50
|
47 delta[iFrame * nState + jState] = bestValue * obs[iFrame][jState];
|
matthiasm@50
|
48 deltasum += delta[iFrame * nState + jState];
|
matthiasm@43
|
49 psi[iFrame][jState] = bestState;
|
matthiasm@43
|
50 }
|
matthiasm@43
|
51 if (deltasum > 0) {
|
matthiasm@43
|
52 for (int iState = 0; iState < nState; ++iState) {
|
matthiasm@50
|
53 delta[iFrame * nState + iState] /= deltasum; // normalise (scale)
|
matthiasm@43
|
54 }
|
matthiasm@106
|
55 scale->push_back(1.0/deltasum);
|
matthiasm@43
|
56 } else {
|
matthiasm@43
|
57 for (int iState = 0; iState < nState; ++iState) {
|
matthiasm@50
|
58 delta[iFrame * nState + iState] = 1.0/nState;
|
matthiasm@43
|
59 }
|
matthiasm@106
|
60 scale->push_back(1.0);
|
matthiasm@43
|
61 }
|
matthiasm@43
|
62
|
matthiasm@43
|
63 }
|
matthiasm@43
|
64
|
matthiasm@43
|
65 /* initialise backward step */
|
matthiasm@109
|
66 double bestValue = 0;
|
matthiasm@43
|
67 for (int iState = 0; iState < nState; ++iState) {
|
matthiasm@50
|
68 double currentValue = delta[(nFrame-1) * nState + iState];
|
matthiasm@109
|
69 if (currentValue > bestValue) {
|
matthiasm@43
|
70 bestValue = currentValue;
|
matthiasm@43
|
71 path[nFrame-1] = iState;
|
matthiasm@43
|
72 }
|
matthiasm@43
|
73 }
|
matthiasm@43
|
74
|
matthiasm@43
|
75 /* rest of backward step */
|
matthiasm@43
|
76 for (int iFrame = nFrame-2; iFrame > -1; --iFrame) {
|
matthiasm@43
|
77 path[iFrame] = psi[iFrame+1][path[iFrame+1]];
|
matthiasm@43
|
78 }
|
matthiasm@43
|
79
|
matthiasm@43
|
80 return path;
|
matthiasm@43
|
81 }
|