Bernal S D_2010.pdf - University of Plymouth

4.2. ARCHITECTURES
S4
f
C3
S3
I
C2
S2
I
o
B.'i
o
o
P(C2.„,^,,„|C3)
1 node
K^ states
(= 60 objects)
P(C3|S4) I
1 node
^j.i.l^*^M
Kc, states
P(S3b..^yJC3)
I ,-a
J \ T7 T
0!Q
WW O !«
'Nt,
^'A*"'«
Oi
**'»'••'«
O!
•»«"•••'>»
O!
««
Oi
••!« n'Mr"^r\
OI
*»'A*".
E j = 1
o/
P(S2t,j,j,5, j„ I C2i^ ,^.,5,)
00
o
>,•<
|o ofO "lo o;5'-!o oB "lo o» to oa "]o o;ti io o;6 lo
o o o o
E,. = 2 S,,-3
O O
o o
£ii = l
o o
o o I o o
£;;-B £„-S t,,-7
E,.
256 nodes
Kg] states
(=1000
features)
32B nodes
^i4il.nw..
2.463 nodes
O Ks2 states
(= 1000
features)
Figure 4.(5; Bayesian nelwork reproducing Ihe structure and funclionality of the 4-level
HMAX model (Serre ei al. 2007b). The number of nodes ai each layer and hand
depend on the size of ihe input image and the pooling (AN) and sampling (C) parameters.
The figure show.s the inial number of nodes ai each layer a.ssuming an
inpui image of I6()xl6() pixels, and the parameters defined by Table 4.4. Hach
node in the nelwork has an associated CPT which links it with its parent n(«les.
Similarly, eacii node performs the same internal operations, shown in Figure 4.3.
which correspond lo the dislribuicd implementation ot belief propagation.
156