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

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

6.J. ANALYSIS OFRBSULTS<br />

model could benefit from greater interactions among the lower level scale hands, which are<br />

currently processed in parallel. Purthennore, the HMAX design doesn't take into account the<br />

constraints <strong>of</strong> Bayesian networks, which may perform more efficiently using, for example, a<br />

smaller number <strong>of</strong> stales per node.<br />

Bayesian methods, such as the Expectation-Maximization algorithm, allow the optimum struc­<br />

ture and parameters <strong>of</strong> a Bayesian network to he learned, given some data (Jordan and Weiss<br />

2002. Lewicki and Sejnowski 1997, Murphy 2001), Although applying these methods from<br />

scratch to such large scale mtxlels might be computationally inlraclable, these can be used to<br />

shape the network given some initial structural constraints. The proposed model could poten­<br />

tially be formulated in a more generic format, similar to the HTM model (George and Hawkins<br />

2009), which could then be panicularized to specific scenarios with the aid <strong>of</strong> these Bayesian<br />

learning methcxls. The proposed model can be understood as a particularization <strong>of</strong> the more<br />

general model to the visual perception domain. However, the same generic model could be<br />

particularized to other similarly structured domains such as the auditory system.<br />

For example, one <strong>of</strong> the main properties embodied by the generic model would be the simple<br />

and complex layer structure with complex layers grouping states in order to achieve invariance.<br />

Many <strong>of</strong> the potential generic principles have been described in Chapter 4. but a more detailed<br />

account and mathematical formulation <strong>of</strong> the generic framework is left as future work.<br />

Several approximations and sampling methods, summarized in Section 4.6, have been imple­<br />

mented to deal with the large number <strong>of</strong> nodes and connections in the model. These <strong>of</strong>fer<br />

solutions to the problem <strong>of</strong> multiplicativcly combining a large number <strong>of</strong> discrete probability<br />

distributions with many stales. Previous models have proposed performing calculations in the<br />

log domain to convert products into sums (Rao 2004, Lilvak and Ullman 2009). Here I propose<br />

re-weighting distributions to establish a minimum value and sampling methods to keep only the<br />

highest values <strong>of</strong> the distributions with highest variance.<br />

A further novelty <strong>of</strong> the model is to use the weighted sum model proposed by Das (2004) to<br />

approximate the CPT <strong>of</strong> nodes with multiple parents. Bayesian networks that try to model the<br />

visual cortex will irremediably require multiple parent interactions as this arise as a consequence<br />

252

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

Saved successfully!

Ooh no, something went wrong!