Fast online deconvolution of calcium imaging data

被引:302
作者
Friedrich, Johannes [1 ,2 ,3 ]
Zhou, Pengcheng [1 ,2 ,4 ,5 ]
Paninski, Liam [1 ,2 ,6 ,7 ]
机构
[1] Columbia Univ, Grossman Ctr Stat Mind, Dept Stat, New York, NY USA
[2] Columbia Univ, Ctr Theoret Neurosci, New York, NY USA
[3] Janelia Res Campus, Ashburn, VA USA
[4] Carnegie Mellon Univ, Ctr Neural Basis Cognit, Pittsburgh, PA USA
[5] Carnegie Mellon Univ, Machine Learning Dept, Pittsburgh, PA USA
[6] Columbia Univ, Kavli Inst Brain Sci, New York, NY USA
[7] Columbia Univ, NeuroTechnol Ctr, New York, NY USA
基金
美国国家卫生研究院; 瑞士国家科学基金会;
关键词
POPULATION; INFERENCE; RECONSTRUCTION; CA2+; SET;
D O I
10.1371/journal.pcbi.1005423
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Fluorescent calcium indicators are a popular means for observing the spiking activity of large neuronal populations, but extracting the activity of each neuron from raw fluorescence calcium imaging data is a nontrivial problem. We present a fast online active set method to solve this sparse non-negative deconvolution problem. Importantly, the algorithm progresses through each time series sequentially from beginning to end, thus enabling real-time online estimation of neural activity during the imaging session. Our algorithm is a generalization of the pool adjacent violators algorithm (PAVA) for isotonic regression and inherits its linear-time computational complexity. We gain remarkable increases in processing speed: more than one order of magnitude compared to currently employed state of the art convex solvers relying on interior point methods. Unlike these approaches, our method can exploit warm starts; therefore optimizing model hyperparameters only requires a handful of passes through the data. A minor modification can further improve the quality of activity inference by imposing a constraint on the minimum spike size. The algorithm enables realtime simultaneous deconvolution of O(10(5)) traces of whole-brain larval zebrafish imaging data on a laptop.
引用
收藏
页数:26
相关论文
共 51 条
[1]  
Ahrens MB, 2013, NAT METHODS, V10, P413, DOI [10.1038/NMETH.2434, 10.1038/nmeth.2434]
[2]  
[Anonymous], 2000, The Mosek Interior Point Optimizer for Linear Programming: An Implementation of the Homogeneous Algorithm, DOI [DOI 10.1007/978-1-4757-3216-0_8, DOI 10.1007/978-1-4757-3216-08, DOI 10.1007/978-1-4757-3216-0]
[3]  
[Anonymous], 2013, NIPS
[4]  
[Anonymous], 2016, Advances In Neural Information Processing Systems
[5]  
[Anonymous], 2016, J OPTIMIZATION THEOR
[6]  
[Anonymous], 2015, GUR OPT REF MAN
[7]  
[Anonymous], 2002, Algorithms for Minimization Without Derivatives
[8]   AN EMPIRICAL DISTRIBUTION FUNCTION FOR SAMPLING WITH INCOMPLETE INFORMATION [J].
AYER, M ;
BRUNK, HD ;
EWING, GM ;
REID, WT ;
SILVERMAN, E .
ANNALS OF MATHEMATICAL STATISTICS, 1955, 26 (04) :641-647
[9]  
Barlow R.E., 1972, Wiley Series in Probability and Mathematical Statistics
[10]   ACTIVE SET ALGORITHMS FOR ISOTONIC REGRESSION - A UNIFYING FRAMEWORK [J].
BEST, MJ ;
CHAKRAVARTI, N .
MATHEMATICAL PROGRAMMING, 1990, 47 (03) :425-439