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.

4.2. ARCHITECTURES<br />

4.2 Architectures<br />

This section describes the specific structure parameters <strong>of</strong> the three different Baycsian networks<br />

employed. They are based on the parameters <strong>of</strong> two published versions <strong>of</strong> the HMAX mode<br />

(Serre et al. 2(X)7c,b). For simplicity I have used the same parameter notation employed in<br />

these papers. Note that these parameters can be used to build the HMAX network as well as the<br />

functionally equivalent Bayesian network, as they dehne the topology <strong>of</strong> the network, i.e. the<br />

structure and the interconnecliviiy between the different elements <strong>of</strong> the network.<br />

The first two layers <strong>of</strong> the network are equivalent in all three architectures and their parameters<br />

are summed up in Table 4.1.<br />

4.2.1 Three-level architecture<br />

The parameters for layers S2. C2 and S3 (Serre et al. 2007c) arc shown in Table 4.2 and the<br />

resulting Bayesian network is illustrated in Figure 4.4. The number <strong>of</strong> nodes at each layer and<br />

band depend on the size <strong>of</strong> the input image and the pooling (AN) and sampling (E) parameters.<br />

The figure shows the total number <strong>of</strong> nodes at each layer, assuming an input image <strong>of</strong> 160x160<br />

pixels and the parameters delined by Table 4.2.<br />

Due to inherent properties <strong>of</strong> Bayesian networks, each node in the graph can only have a fixed<br />

number <strong>of</strong> afferent nodes. For this reason, in order to obtain S2 nodes with features <strong>of</strong> different<br />

RF sizes, AN^ = 4,8.12,16, these are implemented using separate nodes. Therefore, all S2,<br />

C2 and S3 nodes are repeated four times, one for each <strong>of</strong> the RF sizes. This is not illustrated in<br />

Figure 4.4 because the structure <strong>of</strong> each <strong>of</strong> the four sets <strong>of</strong> nodes is equivalent (as a function <strong>of</strong><br />

RF size, ANsi<br />

SI types, Ksi<br />

Scale band<br />

Grid si/e, ANa<br />

Sampling, ec\<br />

Cltypes, Ka<br />

SI parameters<br />

7.9 11,13 15,17 19.21 23. 25 27,29 31,33 35,37<br />

4(0°;45'';90°;135°)<br />

i<br />

8<br />

3<br />

2<br />

10<br />

5<br />

CI parameters<br />

3<br />

12<br />

7<br />

i<br />

4<br />

14<br />

8<br />

5<br />

16<br />

10<br />

{0";45'';90°;135")<br />

Table 4.1: Comparison between two implementations using spiking neurons <strong>of</strong> graphical models<br />

and belief propagation<br />

150<br />

6<br />

18<br />

12<br />

7<br />

20<br />

13<br />

8<br />

22<br />

15

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

Saved successfully!

Ooh no, something went wrong!