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.5. FEEDBACK PROCESSING<br />

is proportional lo V^i„.<br />

4.5 Feedback processing<br />

Section 4.4 describes how for the feedforward object recognition simulations the network was<br />

assumed lo he singly-connected and tree-structured during the initial boitom-up propagation <strong>of</strong><br />

evidence. This wa-s done in order to simplify the computations and facilitate the approximation<br />

to the HMAX selectivity and invariance operations.<br />

For the feedback simulations the network is not restricted by this assumption, and is thu.s al­<br />

lowed lo maintain its multiply connected structure (multiple parents with loops). Evidence<br />

propagates simultaneously in both directions (up and down), at all layers <strong>of</strong> the network. The<br />

combination <strong>of</strong> parent mes.sages is approximated using the weighted sum <strong>of</strong> compatible parental<br />

coijfifjuralions method. To deal with loops, belief propagalion becomes lotipy belief propaga­<br />

tion, which provides an approximation to the exact beliefs after several iterations. Further<br />

details <strong>of</strong> the feedback implementation and the approximations required due lo the large dimen­<br />

sions <strong>of</strong> the network are included in this section.<br />

4.5.1 Approximating n messages as beliefs<br />

As shown in Fquaiion 3.31, the outward it message generated at each node can be obtained as<br />

a function <strong>of</strong> its belief. The only difference is that the message from node X lo Cj, i.e. Ttc^lA')<br />

includes ail incoming messages to X, except the one arriving from the destination node. i.e.<br />

Ac (X). This is done in order to avoid the circulation <strong>of</strong> duplicate information in the network.<br />

However, for the purpose <strong>of</strong> simplification and increased computational performance, and only<br />

when the number <strong>of</strong> incoming messages is high, the outgoing ^:j{X) message can be approx­<br />

imated by the belief, Hel{X). This approximation implies Jk-,{X) also includes the evidence<br />

contained in h:^{X). However, ntj(-X) is calculated by combining messages from a total <strong>of</strong><br />

N -j- M nodes (all parent and children nodes), so the overall effect <strong>of</strong> one single message on<br />

the final message is proportional to I /(A' -I- M). This justifies the approximation in the present<br />

model where the values <strong>of</strong> N and M are in the order <strong>of</strong> hundreds or thousands. The same ap­<br />

proximation is employed by other similar belief propagation mcxiels (Litvak and Ullman 2{X)9.<br />

176

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

Saved successfully!

Ooh no, something went wrong!