wolffd@0: function path = viterbi_path(prior, transmat, obslik) wolffd@0: % VITERBI Find the most-probable (Viterbi) path through the HMM state trellis. wolffd@0: % path = viterbi(prior, transmat, obslik) wolffd@0: % wolffd@0: % Inputs: wolffd@0: % prior(i) = Pr(Q(1) = i) wolffd@0: % transmat(i,j) = Pr(Q(t+1)=j | Q(t)=i) wolffd@0: % obslik(i,t) = Pr(y(t) | Q(t)=i) wolffd@0: % wolffd@0: % Outputs: wolffd@0: % path(t) = q(t), where q1 ... qT is the argmax of the above expression. wolffd@0: wolffd@0: wolffd@0: % delta(j,t) = prob. of the best sequence of length t-1 and then going to state j, and O(1:t) wolffd@0: % psi(j,t) = the best predecessor state, given that we ended up in state j at t wolffd@0: wolffd@0: scaled = 1; wolffd@0: wolffd@0: T = size(obslik, 2); wolffd@0: prior = prior(:); wolffd@0: Q = length(prior); wolffd@0: wolffd@0: delta = zeros(Q,T); wolffd@0: psi = zeros(Q,T); wolffd@0: path = zeros(1,T); wolffd@0: scale = ones(1,T); wolffd@0: wolffd@0: wolffd@0: t=1; wolffd@0: delta(:,t) = prior .* obslik(:,t); wolffd@0: if scaled wolffd@0: [delta(:,t), n] = normalise(delta(:,t)); wolffd@0: scale(t) = 1/n; wolffd@0: end wolffd@0: psi(:,t) = 0; % arbitrary value, since there is no predecessor to t=1 wolffd@0: for t=2:T wolffd@0: for j=1:Q wolffd@0: [delta(j,t), psi(j,t)] = max(delta(:,t-1) .* transmat(:,j)); wolffd@0: delta(j,t) = delta(j,t) * obslik(j,t); wolffd@0: end wolffd@0: if scaled wolffd@0: [delta(:,t), n] = normalise(delta(:,t)); wolffd@0: scale(t) = 1/n; wolffd@0: end wolffd@0: end wolffd@0: [p, path(T)] = max(delta(:,T)); wolffd@0: for t=T-1:-1:1 wolffd@0: path(t) = psi(path(t+1),t+1); wolffd@0: end wolffd@0: wolffd@0: % If scaled==0, p = prob_path(best_path) wolffd@0: % If scaled==1, p = Pr(replace sum with max and proceed as in the scaled forwards algo) wolffd@0: % Both are different from p(data) as computed using the sum-product (forwards) algorithm wolffd@0: wolffd@0: if 0 wolffd@0: if scaled wolffd@0: loglik = -sum(log(scale)); wolffd@0: %loglik = prob_path(prior, transmat, obslik, path); wolffd@0: else wolffd@0: loglik = log(p); wolffd@0: end wolffd@0: end