bioRxivNeurosciencePreprint
maskNMF: A denoise-sparsen-detect approach for extracting neural signals from dense imaging data
Amol PasarkariD, Ian Kinsella, Pengcheng ZhouiD, Melissa M. WuiD, Daisong PaniD, Jiang Lan FaniD, Zhen Wang, Lamiae AbdeladimiD, Darcy S. PeterkaiD, Hillel AdesnikiD, Na JiiD, Liam PaninskiiD
Abstract
A number of calcium imaging methods have been developed to monitor the activity of large populations of neurons. One particularly promising approach, Bessel imaging, captures neural activity from a volume by projecting within the imaged volume onto a single imaging plane, therefore effectively mixing signals and increasing the number of neurons imaged per pixel. These signals must then be computationally demixed to recover the desired neural activity. Unfortunately, currently-available demixing methods can perform poorly in the regime of high imaging density (i.e., many neurons per pixel). In this work we introduce a new pipeline (maskNMF) for demixing dense calcium imaging data. The main idea is to first denoise and temporally sparsen the observed video; this enhances signal strength and reduces spatial overlap significantly. Next we detect neurons in the sparsened video using a neural network trained on a library of neural shapes. These shapes are derived from segmented electron microscopy images input into a Bessel imaging model; therefore no manual selection of "good" neural shapes from the functional data is required here. After cells are detected, we use a constrained non-negative matrix factorization approach to demix the activity, using the detected cells shapes to initialize the factorization. We test the resulting pipeline on both simulated and real datasets and find that it is able to achieve accurate demixing on denser data than was previously feasible, therefore enabling faithful imaging of larger neural populations. The method also provides good results on more "standard" two-photon imaging data. Finally, because much of the pipeline operates on a significantly compressed version of the raw data and is highly parallelizable, the algorithm is fast, processing large datasets faster than real time.
- Citations
- 2
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Penalized matrix decomposition for denoising, compression, and improved demixing of functional imaging data
E. Kelly Buchanan, Ian Kinsella, … Liam Paninski·bioRxiv·Jan 21, 2019
- Automatic sorting system for large calcium imaging data
Takashi Takekawa, Hirotaka Asai, … Tomoki Fukai·bioRxiv·Nov 9, 2017
- HOTARU: Automatic sorting system for large scale calcium imaging data
Takashi Takekawa, Masanori Nomoto, … Tomoki Fukai·bioRxiv·Apr 5, 2022
- Extracting neural signals from semi-immobilized animals with deformable non-negative matrix factorization
Amin Nejatbakhsh, Erdem Varol, … Liam Paninski·bioRxiv·Jul 7, 2020
- Robustness of spike deconvolution for calcium imaging of neural spiking
Marius Pachitariu, Carsen Stringer, Kenneth D. Harris·bioRxiv·Jun 27, 2017
- Multi-scale approaches for high-speed imaging and analysis of large neural populations
Johannes Friedrich, Weijian Yang, … Liam Paninski·PLoS Computational BiologyPeer-reviewed·Aug 3, 2017