Sparse functional identification of complex cells from spike times and the decoding of visual stimuli

DOI10.1186/S13408-017-0057-1zbMATH Open1395.92042arXiv1706.05783OpenAlexW2790815247WikidataQ47559025 ScholiaQ47559025MaRDI QIDQ723690FDOQ723690

Authors: Aurel A. Lazar, Nikul H. Ukani, Yiyin Zhou 

Publication date: 24 July 2018

Published in: The Journal of Mathematical Neuroscience (Search for Journal in Brave)

Abstract: We investigate the sparse functional identification of complex cells and the decoding of visual stimuli encoded by an ensemble of complex cells. The reconstruction algorithm of both temporal and spatio-temporal stimuli is formulated as a rank minimization problem that significantly reduces the number of sampling measurements (spikes) required for decoding. We also establish the duality between sparse decoding and functional identification, and provide algorithms for identification of low-rank dendritic stimulus processors. The duality enables us to efficiently evaluate our functional identification algorithms by reconstructing novel stimuli in the input space. Finally, we demonstrate that our identification algorithms substantially outperform the generalized quadratic model, the non-linear input model and the widely used spike-triggered covariance algorithm.

Full work available at URL: https://arxiv.org/abs/1706.05783

Recommendations

• Bridging the functional and wiring properties of V1 neurons through sparse coding
• Functional identification of spike-processing neural circuits
• Spatial and temporal pattern analysis via spiking neurons
• Identification of linear and nonlinear sensory processing circuits from spiking neuron data
• Methods for identification of spike patterns in massively parallel spike trains
• Replicating receptive fields of simple and complex cells in primary visual cortex in a neuronal network model with temporal and population sparseness and reliability
• Spatial and temporal coding in single neurons

zbMATH Keywords

complex cellsdendritic stimulus processorsduality between decoding and functional identificationencoding of visual stimuliquadratic receptive fieldssparse functional identificationsparse neural decoding

Mathematics Subject Classification ID

Neural biology (92C20)

Cites Work

• Solving semidefinite-quadratic-linear programs using SDPT3
• Phaselift: exact and stable signal recovery from magnitude measurements via convex programming
• Phase retrieval via matrix completion
• Exact matrix completion via convex optimization
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Title not available (Why is that?)
• Low-rank matrix completion using alternating minimization
• Title not available (Why is that?)
• Population Encoding With Hodgkin–Huxley Neurons
• Spiking neural circuits with dendritic stimulus processors. Encoding, decoding, and identification in reproducing kernel Hilbert spaces
• System identification of \textit{Drosophila} olfactory sensory neurons

Cited In (8)

• Identification of sparse neural functional connectivity using penalized likelihood estimation and basis functions
• Decoding pixel-level image features from two-photon calcium signals of macaque visual cortex
• Massively parallel neural circuits for stereoscopic color vision: encoding, decoding and identification
• Spiking neural circuits with dendritic stimulus processors. Encoding, decoding, and identification in reproducing kernel Hilbert spaces
• Functional identification of spike-processing neural circuits
• Identification of linear and nonlinear sensory processing circuits from spiking neuron data
• Sparse identification of contrast gain control in the fruit fly photoreceptor and amacrine cell layer
• Massively parallel neural encoding and decoding of visual stimuli

Uses Software

• SDPT3
• PhaseLift

This page was built for publication: Sparse functional identification of complex cells from spike times and the decoding of visual stimuli

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723690)