|
wolffd@0
|
1 function CPT = CPD_to_CPT(CPD)
|
|
wolffd@0
|
2 % Compute the big CPT for an HHMM Q node (including F parents)
|
|
wolffd@0
|
3 % by combining internal transprob and startprob
|
|
wolffd@0
|
4 % function CPT = CPD_to_CPT(CPD)
|
|
wolffd@0
|
5
|
|
wolffd@0
|
6 Qsz = CPD.Qsz;
|
|
wolffd@0
|
7
|
|
wolffd@0
|
8 if ~isempty(CPD.Fbelow_ndx)
|
|
wolffd@0
|
9 if ~isempty(CPD.Fself_ndx) % general case
|
|
wolffd@0
|
10 error('not implemented')
|
|
wolffd@0
|
11 else % no F from self, hence no startprob (top level)
|
|
wolffd@0
|
12 nps = length(CPD.dom_sz)-1; % num parents
|
|
wolffd@0
|
13 CPT = 0*myones(CPD.dom_sz);
|
|
wolffd@0
|
14 % when Fself=1, the CPT(i,j) = delta(i,j) for all k
|
|
wolffd@0
|
15 for k=1:prod(CPD.Qpsizes)
|
|
wolffd@0
|
16 Qps_vals = ind2subv(CPD.Qpsizes, k);
|
|
wolffd@0
|
17 ndx = mk_multi_index(nps+1, [CPD.Fbelow_ndx CPD.Qps_ndx], [1 Qps_vals]);
|
|
wolffd@0
|
18 CPT(ndx{:}) = eye(Qsz); % CPT(:,2,k,:) or CPT(:,k,2,:) etc
|
|
wolffd@0
|
19 end
|
|
wolffd@0
|
20 ndx = mk_multi_index(nps+1, CPD.Fbelow_ndx, 2);
|
|
wolffd@0
|
21 CPT(ndx{:}) = CPD.transprob; % we assume transprob is in topo order
|
|
wolffd@0
|
22 end
|
|
wolffd@0
|
23 else % no F signal from below
|
|
wolffd@0
|
24 if ~isempty(CPD.Fself_ndx) % bottom level
|
|
wolffd@0
|
25 nps = length(CPD.dom_sz)-1; % num parents
|
|
wolffd@0
|
26 CPT = 0*myones(CPD.dom_sz);
|
|
wolffd@0
|
27 ndx = mk_multi_index(nps+1, CPD.Fself_ndx, 1);
|
|
wolffd@0
|
28 CPT(ndx{:}) = CPD.transprob;
|
|
wolffd@0
|
29 ndx = mk_multi_index(nps+1, CPD.Fself_ndx, 2);
|
|
wolffd@0
|
30 CPT(ndx{:}) = CPD.startprob;
|
|
wolffd@0
|
31 else % no F from self
|
|
wolffd@0
|
32 error('An hhmmQ node without any F parents is just a tabular_CPD')
|
|
wolffd@0
|
33 end
|
|
wolffd@0
|
34 end
|
|
wolffd@0
|
35
|
