Mercurial > hg > camir-aes2014
comparison toolboxes/FullBNT-1.0.7/bnt/inference/dynamic/@kalman_inf_engine/marginal_nodes.m @ 0:e9a9cd732c1e tip
first hg version after svn
author | wolffd |
---|---|
date | Tue, 10 Feb 2015 15:05:51 +0000 |
parents | |
children |
comparison
equal
deleted
inserted
replaced
-1:000000000000 | 0:e9a9cd732c1e |
---|---|
1 function marginal = marginal_nodes(engine, nodes, t) | |
2 % MARGINAL_NODES Compute the marginal on the specified query nodes (kalman) | |
3 % marginal = marginal_nodes(engine, nodes, t) | |
4 % | |
5 % 't' specifies the time slice of the earliest node in 'nodes'. | |
6 % 'nodes' cannot span more than 2 time slices. | |
7 % | |
8 % Example: | |
9 % Consider a DBN with 2 nodes per slice. | |
10 % Then t=2, nodes=[1 3] refers to node 1 in slice 2 and node 1 in slice 3, | |
11 % i.e., nodes 3 and 5 in the unrolled network, | |
12 | |
13 if nargin < 3, t = 1; end | |
14 | |
15 bnet = bnet_from_engine(engine); | |
16 ss = length(bnet.intra); | |
17 if all(nodes <= ss) | |
18 bigpot = engine.one_slice_marginal{t}; | |
19 else | |
20 bigpot = engine.two_slice_marginal{t}; | |
21 end | |
22 | |
23 nodes = nodes + (t-1)*ss; | |
24 pot = marginalize_pot(bigpot, nodes); | |
25 marginal = pot_to_marginal(pot); |