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

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