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.6. SUMMARY OF MODEL APPROXIMATIONS TO BAYESIAN HEUEF PROPAGATION<br />

node instead <strong>of</strong> on the likelihood funciion, A(X). This allows Ihe A messages lo be modulated<br />

by top-down feedback even in regions that have initially flat distribulions, such as the missing<br />

contours in the Kanizsa figure. This modification is shown in Rqualion (4.! 2).<br />

4''("/)-Pl<br />

4.6 Summary <strong>of</strong> model approximations to Bayesian belief propagation<br />

• l-'eedforward recognition results assume a singly-connected tree-structured network (no<br />

loops and one parent per node) so the HMAX operations can be approximated by the<br />

propagation <strong>of</strong> bottom-up X messages. Similar approaches have been used in other relaied<br />

models (Kpshtein et al. 2(X)8. tJcorge and Hawkins 20()'J, Hinlon ei ai. 2006). Preliminary<br />

results suggest a similar invariani recognilion performance can be obtained even when<br />

including the feedback K messages (loopy belief propagation), but the computational<br />

cost associated precludes a comprehensive systematic test over the complete dataset and<br />

parameter space.<br />

• The number <strong>of</strong> input Af,(-r) messages used to compute the hkelihood function X{x) is<br />

hmited to M^ai- in order to prevent the result <strong>of</strong> the product operalion from being outside<br />

<strong>of</strong> Matlab's numeric range. The method has been empirically demonstrated to provide a<br />

relatively good fit to the exact distribution given a moderate value <strong>of</strong> Mmax-<br />

• The A and ;r messages are sum-normalized to 1 and then re-weighted so that the minimum<br />

value <strong>of</strong> the distribution is equal V„i„ — 1/(^/10). This prevents extremely low values<br />

leading to out <strong>of</strong> range solulions during the belief propagalion operations. The overall<br />

shape <strong>of</strong> the distribution remains identical, except for some <strong>of</strong> the elements with smaller<br />

values, which may now exhibit a relatively larger value. However. Ihe states with lowest<br />

values are less likely lo affect the final resuh in a significant way and many <strong>of</strong> ihem will<br />

be discarded anyway during the sampling methods implemented.<br />

• The Ji messages are approximated by the belief al each mxle. The same approach is<br />

188

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

Saved successfully!

Ooh no, something went wrong!