Daniel@0: function CPD = update_CPT(CPD)
Daniel@0: % Compute the big CPT for an HHMM Q node (including F parents) given internal transprob and startprob
Daniel@0: % function CPD = update_CPT(CPD)
Daniel@0: 
Daniel@0: Qsz = CPD.Qsz;
Daniel@0: Qpsz = CPD.Qpsz;
Daniel@0: 
Daniel@0: if ~isempty(CPD.Fbelow_ndx)
Daniel@0:   if ~isempty(CPD.Fself_ndx) % general case
Daniel@0:     % Fb(t-1) Fself(t-1)  P(Q(t)=j| Q(t-1)=i, Qps(t)=k)
Daniel@0:     % ------------------------------------------------------
Daniel@0:     % 1        1         delta(i,j)
Daniel@0:     % 2        1         transprob(i,k,j)
Daniel@0:     % 1        2         impossible
Daniel@0:     % 2        2         startprob(k,j)
Daniel@0:     CPT = zeros(Qsz, 2, 2, Qpsz, Qsz);
Daniel@0:     I = repmat(eye(Qsz), [1 1 Qpsz]); % i,j,k
Daniel@0:     I = permute(I, [1 3 2]); % i,k,j
Daniel@0:     CPT(:, 1, 1, :, :) = I;
Daniel@0:     CPT(:, 2, 1, :, :) = CPD.transprob;
Daniel@0:     CPT(:, 1, 2, :, :) = I;
Daniel@0:     CPT(:, 2, 2, :, :) = repmat(reshape(CPD.startprob, [1 Qpsz Qsz]), ...
Daniel@0: 				[Qsz 1 1]); % replicate  over i 
Daniel@0:   else % no F from self, hence no startprob
Daniel@0:     % Fb(t-1) P(Q(t)=j| Q(t-1)=i, Qps(t)=k)
Daniel@0:     % ------------------------------------------------------
Daniel@0:     % 1       delta(i,j)
Daniel@0:     % 2       transprob(i,k,j)
Daniel@0:     
Daniel@0:     nps = length(CPD.dom_sz)-1; % num parents
Daniel@0:     CPT = 0*myones(CPD.dom_sz);
Daniel@0:     %CPT = zeros(Qsz, 2, Qpsz, Qsz); % assumes CPT(Q(t-1), F(t-1), Qps, Q(t))
Daniel@0:     % but a member of Qps may preceed Q(t-1) or F(t-1) in the ordering
Daniel@0: 
Daniel@0:     for k=1:CPD.Qpsz
Daniel@0:       Qps_vals = ind2subv(CPD.Qpsizes, k);
Daniel@0:       ndx = mk_multi_index(nps+1, [CPD.Fbelow_ndx CPD.Qps_ndx], [1 Qps_vals]);
Daniel@0:       CPT(ndx{:}) = eye(Qsz); % CPT(:,2,k,:) or CPT(:,k,2,:) etc
Daniel@0:     end
Daniel@0:     ndx = mk_multi_index(nps+1, CPD.Fbelow_ndx, 2);
Daniel@0:     CPT(ndx{:}) = CPD.transprob; % we assume transprob is in topo order
Daniel@0:   end
Daniel@0: else % no F signal from below
Daniel@0:   if ~isempty(CPD.Fself_ndx)
Daniel@0:     % Q(t-1), Fself(t-1), Qps, Q(t)
Daniel@0:     
Daniel@0:     % Fself(t-1)  P(Q(t-1)=i, Qps(t)=k -> Q(t)=j)
Daniel@0:     % ------------------------------------------------------
Daniel@0:     % 1         transprob(i,k,j)
Daniel@0:     % 2         startprob(k,j)
Daniel@0:     
Daniel@0:     nps = length(CPD.dom_sz)-1; % num parents
Daniel@0:     CPT = 0*myones(CPD.dom_sz);
Daniel@0:     ndx = mk_multi_index(nps+1, CPD.Fself_ndx, 1);
Daniel@0:     CPT(ndx{:}) = CPD.transprob;
Daniel@0:     if CPD.fullstartprob
Daniel@0:       ndx = mk_multi_index(nps+1, CPD.Fself_ndx, 2);
Daniel@0:       CPT(ndx{:}) = CPD.startprob;
Daniel@0:     else
Daniel@0:       for i=1:CPD.Qsz
Daniel@0: 	ndx = mk_multi_index(nps+1, [CPD.Fself_ndx CPD.old_self_ndx], [2 i]);
Daniel@0: 	CPT(ndx{:}) = CPD.startprob;
Daniel@0:       end
Daniel@0:     end
Daniel@0:   else % no F from self
Daniel@0:     error('An hhmmQ node without any F parents is just a tabular_CPD')
Daniel@0:   end
Daniel@0: end
Daniel@0: 
Daniel@0: CPD = set_fields(CPD, 'CPT', CPT);