08.02.2013 Views

Bernal S D_2010.pdf - University of Plymouth

Bernal S D_2010.pdf - University of Plymouth

Bernal S D_2010.pdf - University of Plymouth

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

4.1. HMAX AS A BAYESIAN NETWORK<br />

NodeX<br />

Message to<br />

parents <strong>of</strong> X<br />

(U, U^)<br />

Ax(U^)... Ax(U^)<br />

A(X)<br />

A(X)^n^c.(X)<br />

Ac.(X)...^c„(X)<br />

Message from<br />

children <strong>of</strong> X<br />

(C, CJ<br />

n^(U,)-Bel(U,)/MU,:<br />

Message from<br />

parents o( X<br />

(Ui U,}<br />

Bel(UM ... Bel(U^)<br />

TTx(UO TTX(UM)<br />

n(X)= ^ P(X|U ,U,)n"-(lJ'<br />

n(X)<br />

Bei(X)-a.A(X).TT{X)<br />

T^<br />

Bel(X)<br />

Message to<br />

children <strong>of</strong> X<br />

_4______j<br />

F/jjiiw J..J; Inienial structure <strong>of</strong> a node implemeniing belief propagation in a Bayesian network<br />

wilh a polyiree slruciure (more ihan one parent per node). F.acli node combines<br />

the bollom-up A messages from cfiild nodes willi itie top-down n messages from<br />

the parent nodes lo culcuJaie the teliet and the oulpui A messages to the parent<br />

nodes. Nole that the lop-down ouipui messages <strong>of</strong> the node are made equivalent<br />

lo the belief <strong>of</strong> the node. Therefore, inpul top-down messages to a ni>de need to<br />

he divided hy the output A message to ohlaiii the eorresponding n' message from<br />

the node above (Pearl 1988). The operations performed correspond to Equations<br />

(3.27) lo (3-31), and were described in detail in Section 3.3,3.<br />

149

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!