Finding independent components using spikes: A natural result of Hebbian learning in a sparse spike coding scheme

  • Authors:
  • Laurent Perrinet

  • Affiliations:
  • INCM-CNRS, 31, chemin Joseph Aiguier, 13402 Marseille, France (E-mail: laurent@lnf.cnrs-mrs.fr)

  • Venue:
  • Natural Computing: an international journal
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

As an alternative to classical representations in machine learningalgorithms, we explore coding strategies using events as is observed forspiking neurons in the central nervous system. Focusing on visualprocessing, we have previously shown that we can define with anover-complete dictionary a sparse spike coding scheme byimplementing lateral interactions that account for redundantinformation. Since this class of algorithms is both compatible withbiological constraints and with neuro-physiological observations, it canprovide a possible algorithm to explain the speed of visual processingdespite the relatively slow time of response of single neurons. Here, Iexplore learning mechanisms to derive in an unsupervised manner anover-complete set of filters which provides a progressively sparserrepresentation of the input. This work is based on a previous model ofsparse coding from Olshausen et al. (1998) and the resultsleads to similar results, suggesting that this strategy provides asimple neural implementation of this algorithm and thus of Blind SourceSeparation. Moreover, this neuro-mimetic algorithm may be easilyextended to realistic architectures of cortical columns in the primaryvisual cortex and we show results for different strategies ofrepresentation, leading to neuro-mimetic adaptive sparse spikecoding schemes.