Compressed Sensing, Sparsity, and Dimensionality in Neuronal Information Processing and Data Analysis

被引:167
作者
Ganguli, Surya [1 ]
Sompolinsky, Haim [2 ,3 ]
机构
[1] Stanford Univ, Dept Appl Phys, Stanford, CA 94305 USA
[2] Hebrew Univ Jerusalem, Edmond & Lily Safra Ctr Brain Sci, Interdisciplinary Ctr Neural Computat, IL-91904 Jerusalem, Israel
[3] Harvard Univ, Ctr Brain Sci, Cambridge, MA 02138 USA
来源
ANNUAL REVIEW OF NEUROSCIENCE, VOL 35 | 2012年 / 35卷
关键词
random projections; connectomics; imaging; memory; communication; learning; generalization; INDEPENDENT COMPONENT ANALYSIS; NATURAL IMAGE STATISTICS; SIGNAL RECOVERY; OVERCOMPLETE DICTIONARIES; RANDOM PROJECTIONS; SIMPLE CELLS; SYSTEMS; MODELS; REPRESENTATIONS; ORGANIZATION;
D O I
10.1146/annurev-neuro-062111-150410
中图分类号
Q189 [神经科学];
学科分类号
071006 ;
摘要
The curse of dimensionality poses severe challenges to both technical and conceptual progress in neuroscience. In particular, it plagues our ability to acquire, process, and model high-dimensional data sets. Moreover, neural systems must cope with the challenge of processing data in high dimensions to learn and operate successfully within a complex world. We review recent mathematical advances that provide ways to combat dimensionality in specific situations. These advances shed light on two dual questions in neuroscience. First, how can we as neuroscientists rapidly acquire high-dimensional data from the brain and subsequently extract meaningful models from limited amounts of these data? And second, how do brains themselves process information in their intrinsically high-dimensional patterns of neural activity as well as learn meaningful, generalizable models of the external world from limited experience?
引用
收藏
页码:485 / 508
页数:24
相关论文
共 106 条
[1]   On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred M. .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2006, 416 (01) :48-67
[2]   K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation [J].
Aharon, Michal ;
Elad, Michael ;
Bruckstein, Alfred .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2006, 54 (11) :4311-4322
[3]  
[Anonymous], RAMSEY THEORY REVEAL
[4]  
[Anonymous], 2004, Semantic cognition: A parallel distributed processing approach
[5]  
[Anonymous], 2010, Adv. Neural Inf. Process. Syst
[6]  
[Anonymous], 2006, Proc. Adv. Neural Inf. Process. Syst
[7]   WHAT DOES THE RETINA KNOW ABOUT NATURAL SCENES [J].
ATICK, JJ ;
REDLICH, AN .
NEURAL COMPUTATION, 1992, 4 (02) :196-210
[8]   Could information theory provide an ecological theory of sensory processing? [J].
Aticky, Joseph J. .
NETWORK-COMPUTATION IN NEURAL SYSTEMS, 2011, 22 (1-4) :4-44
[9]   A Simple Proof of the Restricted Isometry Property for Random Matrices [J].
Baraniuk, Richard ;
Davenport, Mark ;
DeVore, Ronald ;
Wakin, Michael .
CONSTRUCTIVE APPROXIMATION, 2008, 28 (03) :253-263
[10]   Compressive sensing [J].
Baraniuk, Richard G. .
IEEE SIGNAL PROCESSING MAGAZINE, 2007, 24 (04) :118-+