Email updates

Keep up to date with the latest news and content from BMC Neuroscience and BioMed Central.

This article is part of the supplement: Sixteenth Annual Computational Neuroscience Meeting: CNS*2007

Open Access Poster presentation

On efficient sparse spike coding schemes for learning natural scenes in the primary visual cortex

Laurent Perrinet

Author Affiliations

Institut de Neurosciences Cognitives de la Méditerranée, CNRS & Aix-Marseille University, Marseille, France

BMC Neuroscience 2007, 8(Suppl 2):P206  doi:10.1186/1471-2202-8-S2-P206

The electronic version of this article is the complete one and can be found online at:


Published:6 July 2007

© 2007 Perrinet; licensee BioMed Central Ltd.

Poster presentation

We describe the theoretical formulation of a learning algorithm in a model of the primary visual cortex (V1) and present results of the efficiency of this algorithm by comparing it to the SparseNet algorithm [1]. As the SparseNet algorithm, it is based on a model of signal synthesis as a Linear Generative Model but differs in the efficiency criteria for the representation. This learning algorithm is in fact based on an efficiency criteria based on the Occam razor: for a similar quality, the shortest representation should be privileged. This inverse problem is NP-complete and we propose here a greedy solution which is based on the architecture and nature of neural computations [2]). It proposes that the supra-threshold neural activity progressively removes redundancies in the representation based on a correlation-based inhibition and provides a dynamical implementation close to the concept of neural assemblies from Hebb [3]). We present here results of simulation of this network with small natural images (available at http://incm.cnrs-mrs.fr/LaurentPerrinet/SparseHebbianLearning webcite) and compare it to the Sparsenet solution. Extending it to realistic images and to the NEST simulator http://www.nest-initiative.org/ webcite, we show that this learning algorithm based on the properties of neural computations produces adaptive and efficient representations in V1.

Acknowledgements

This was work supported by the 6th RFP of the EU (grant no. 15879-FACETS). Simulations use the PyNN software available at http://pynn.gforge.inria.fr/.

References

  1. Olshausen B, Field DJ: Sparse coding with an overcomplete basis set: A strategy employed by V1?

    Vision Res 1997, 37:3311-3325. PubMed Abstract | Publisher Full Text OpenURL

  2. Perrinet L: Feature detection using spikes: the greedy approach.

    J Physiol Paris 2004, 98(4–6):530-539. PubMed Abstract | Publisher Full Text OpenURL

  3. Hebb DO: The organization of behavior. Wiley, New York; 1949.