Feature detection using spikes : the greedy approach


A goal of low-level neural processes is to build an efficient code extracting the relevant information from the sensory input. It is believed that this is implemented in cortical areas by elementary inferential computations dynamically extracting the most likely parameters corresponding to the sensory signal. We explore here a neuro-mimetic feed-forward model of the primary visual area (V1) solving this problem in the case where the signal may be described by a robust linear generative model. This model uses an over-complete dictionary of primitives which provides a distributed probabilistic representation of input features. Relying on an efficiency criterion, we derive an algorithm as an approximate solution which uses incremental greedy inference processes. This algorithm is similar to ’Matching Pursuit’ and mimics the parallel architecture of neural computations. We propose here a simple implementation using a network of spiking integrate-and-fire neurons which communicate using lateral interactions. Numerical simulations show that this Sparse Spike Coding strategy provides an efficient model for representing visual data from a set of natural images. Even though it is simplistic, this transformation of spatial data into a spatio-temporal pattern of binary events provides an accurate description of some complex neural patterns observed in the spiking activity of biological neural networks.


Figure 1: Inverse-mapping as a a goal for sensory neural coding. The visible world is modeled as the interaction of a large set of hypothetical physical sources (world model) according to a known model of their interactions ("synthesis"). We will consider that for sensory cortical areas, the goal of the neural representation (and its implementation by the neural code) is to analyze the signal so as to recover at best and as quickly as possible the sources that generated the signal ("analysis") . The analysis may thus be considered as an inverse mapping of the synthesis. A proposed solution for this problem is to infer at best the most probable hidden state.


All material (c) L. Perrinet. Please check the copyright notice.

TagPublicationsArticles TagSparse

welcome: please sign in