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.

3A. EXISTING MODELS<br />

proposes a trivial extension <strong>of</strong> the algorithm using the Noisy-OR gate. However, this melhtxl<br />

is only valid for graded variables (see Section 3.3.4 and Pearl (1988)), which is noi the case<br />

for variables in HTM nelworks. .Similarly, the problem <strong>of</strong> networks with loops is solved by<br />

implementing loopy belief propagation, which is claimed lo provide good results, although no<br />

evidence is provided.<br />

Model simulations shows succesful recognition (72%) <strong>of</strong> 48 hnc drawing objects (32 x 32 pix­<br />

els) despite translations, distortions and clutter. When tested on the standard Caltech-JOl bench­<br />

mark <strong>of</strong> natural images, the performance decreased signiHcantly (56%); although when using<br />

their own 4-calegory testset <strong>of</strong> natural images, the accuracy was very high (92%). Preliminary<br />

results also suggest top-down feedback in the model can account for segmentation, feature bind­<br />

ing, attention and contour completion. Only the last phenomenon is explicitly demonstrated, by<br />

lirstly recognizing a Kanizsa square (input image) as a square (high-level cause), and later alow-<br />

ing lop-down feedback lo increase the response <strong>of</strong> nodes coding the retinotopic location <strong>of</strong> the<br />

illusory contours. Due lo the significani similarities between HTMs and the model proposed in<br />

this thesis, a more detailed comparison between them is included in Section A.<br />

3.4.2.2 Model

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

Saved successfully!

Ooh no, something went wrong!