annotate toolboxes/FullBNT-1.0.7/bnt/examples/dynamic/HHMM/pretty_print_hhmm_parse.m @ 0:e9a9cd732c1e tip

first hg version after svn
author wolffd
date Tue, 10 Feb 2015 15:05:51 +0000
parents
children
rev   line source
wolffd@0 1 function pretty_print_hhmm_parse(mpe, Qnodes, Fnodes, Onode, alphabet)
wolffd@0 2 % function pretty_print_hhmm_parse(mpe, Qnodes, Fnodes, Onode, alphabet)
wolffd@0 3 %
wolffd@0 4 % mpe(i,t) is the most probable value of node i at time t
wolffd@0 5 % Qnodes(1:D), Fnodes = [F2 .. FD], Onode contain the node ids
wolffd@0 6 % alphabet(i) is the i'th output symbol, or [] if don't want displayed
wolffd@0 7
wolffd@0 8 T = size(mpe,2);
wolffd@0 9 ncols = 20;
wolffd@0 10 t1 = 1; t2 = min(T, t1+ncols-1);
wolffd@0 11 while (t1 < T)
wolffd@0 12 %fprintf('%d:%d\n', t1, t2);
wolffd@0 13 if iscell(mpe)
wolffd@0 14 print_block_cell(mpe(:,t1:t2), Qnodes, Fnodes, Onode, alphabet, t1);
wolffd@0 15 else
wolffd@0 16 print_block(mpe(:,t1:t2), Qnodes, Fnodes, Onode, alphabet, t1);
wolffd@0 17 end
wolffd@0 18 fprintf('\n\n');
wolffd@0 19 t1 = t2+1; t2 = min(T, t1+ncols-1);
wolffd@0 20 end
wolffd@0 21
wolffd@0 22 %%%%%%
wolffd@0 23
wolffd@0 24 function print_block_cell(mpe, Qnodes, Fnodes, Onode, alphabet, start)
wolffd@0 25
wolffd@0 26 D = length(Qnodes);
wolffd@0 27 T = size(mpe, 2);
wolffd@0 28 fprintf('%3d ', start:start+T-1); fprintf('\n');
wolffd@0 29 for d=1:D
wolffd@0 30 for t=1:T
wolffd@0 31 if (d > 1) & (mpe{Fnodes(d-1),t} == 2)
wolffd@0 32 fprintf('%3d|', mpe{Qnodes(d), t});
wolffd@0 33 else
wolffd@0 34 fprintf('%3d ', mpe{Qnodes(d), t});
wolffd@0 35 end
wolffd@0 36 end
wolffd@0 37 fprintf('\n');
wolffd@0 38 end
wolffd@0 39 if ~isempty(alphabet)
wolffd@0 40 a = cell2num(mpe(Onode,:));
wolffd@0 41 %fprintf('%3c ', alphabet(mpe{Onode,:}));
wolffd@0 42 fprintf('%3c ', alphabet(a))
wolffd@0 43 fprintf('\n');
wolffd@0 44 end
wolffd@0 45
wolffd@0 46
wolffd@0 47 %%%%%%
wolffd@0 48
wolffd@0 49 function print_block(mpe, Qnodes, Fnodes, Onode, alphabet, start)
wolffd@0 50
wolffd@0 51 D = length(Qnodes);
wolffd@0 52 T = size(mpe, 2);
wolffd@0 53 fprintf('%3d ', start:start+T-1); fprintf('\n');
wolffd@0 54 for d=1:D
wolffd@0 55 for t=1:T
wolffd@0 56 if (d > 1) & (mpe(Fnodes(d-1),t) == 2)
wolffd@0 57 fprintf('%3d|', mpe(Qnodes(d), t));
wolffd@0 58 else
wolffd@0 59 fprintf('%3d ', mpe(Qnodes(d), t));
wolffd@0 60 end
wolffd@0 61 end
wolffd@0 62 fprintf('\n');
wolffd@0 63 end
wolffd@0 64 if ~isempty(alphabet)
wolffd@0 65 fprintf('%3c ', alphabet(mpe(Onode,:)));
wolffd@0 66 fprintf('\n');
wolffd@0 67 end