Characterizing the sparseness of neural codes

Citation
B. Willmore et Dj. Tolhurst, Characterizing the sparseness of neural codes, NETWORK-COM, 12(3), 2001, pp. 255-270
Citations number
39
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
NETWORK-COMPUTATION IN NEURAL SYSTEMS
ISSN journal
0954898X → ACNP
Volume
12
Issue
3
Year of publication
2001
Pages
255 - 270
Database
ISI
SICI code
0954-898X(200108)12:3<255:CTSONC>2.0.ZU;2-L
Abstract
It is often suggested that efficient neural codes for natural visual inform ation should be 'sparse'. However, the term 'sparse' has been used in two d ifferent ways-firstly to describe codes in which few neurons are active at any time ('population sparseness'), and secondly to describe codes in which each neuron's lifetime response distribution has high kurtosis ('lifetime sparseness'). Although these ideas are related, they are not identical, and the most common measure of lifetime sparseness-the kurtosis of the lifetim e response distributions of the neurons-provides no information about popul ation sparseness. We have measured the population sparseness and lifetime kurtosis of several biologically inspired coding schemes. We used three measures of population sparseness (population kurtosis, Treves-Rolls sparseness and 'activity spa rseness'), and found them to be in close agreement with one another. Howeve r, we also measured the lifetime kurtosis of the cells in each code. We fou nd that lifetime kurtosis is uncorrelated with population sparseness for th e codes we used. Lifetime kurtosis is not. therefore, a useful measure of the population spa rseness of a code. Moreover, the Gabor-like codes, which are often assumed to have high population sparseness (since they have high lifetime kurtosis) , actually turned out to have rather low population sparseness. Surprisingl y, principal components filters produced the codes with the highest populat ion sparseness.