IDEAS home Printed from https://ideas.repec.org/a/plo/pcbi00/1005423.html

Fast online deconvolution of calcium imaging data

Author

Listed:
  • Johannes Friedrich
  • Pengcheng Zhou
  • Liam Paninski

Abstract

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 3progresses 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 real-time simultaneous deconvolution of O(105) traces of whole-brain larval zebrafish imaging data on a laptop.Author summary: Calcium imaging methods enable simultaneous measurement of the activity of thousands of neighboring neurons, but come with major caveats: the slow decay of the fluorescence signal compared to the time course of the underlying neural activity, limitations in signal quality, and the large scale of the data all complicate the goal of efficiently extracting accurate estimates of neural activity from the observed video data. Further, current activity extraction methods are typically applied to imaging data after the experiment is complete. However, in many cases we would prefer to run closed-loop experiments—analyzing data on-the-fly to guide the next experimental steps or to control feedback—and this requires new methods for accurate real-time processing. Here we present a fast activity extraction algorithm addressing both issues. Our approach follows previous work in casting the activity extraction problem as a sparse nonnegative deconvolution problem. To solve this optimization problem, we introduce a new algorithm that is an order of magnitude faster than previous methods, and progresses through the data sequentially from beginning to end, thus enabling, in principle, real-time online estimation of neural activity during the imaging session. This computational advance thus opens the door to new closed-loop experiments.

Suggested Citation

  • Johannes Friedrich & Pengcheng Zhou & Liam Paninski, 2017. "Fast online deconvolution of calcium imaging data," PLOS Computational Biology, Public Library of Science, vol. 13(3), pages 1-26, March.
  • Handle: RePEc:plo:pcbi00:1005423
    DOI: 10.1371/journal.pcbi.1005423
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1005423
    Download Restriction: no

    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1005423&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pcbi.1005423?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. de Leeuw, Jan & Hornik, Kurt & Mair, Patrick, 2009. "Isotone Optimization in R: Pool-Adjacent-Violators Algorithm (PAVA) and Active Set Methods," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 32(i05).
    2. Thomas Deneux & Attila Kaszas & Gergely Szalay & Gergely Katona & Tamás Lakner & Amiram Grinvald & Balázs Rózsa & Ivo Vanzetta, 2016. "Accurate spike estimation from noisy calcium signals for ultrafast three-dimensional imaging of large neuronal populations in vivo," Nature Communications, Nature, vol. 7(1), pages 1-17, November.
    3. Brendan O’Donoghue & Eric Chu & Neal Parikh & Stephen Boyd, 2016. "Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding," Journal of Optimization Theory and Applications, Springer, vol. 169(3), pages 1042-1068, June.
    4. Tsai-Wen Chen & Trevor J. Wardill & Yi Sun & Stefan R. Pulver & Sabine L. Renninger & Amy Baohan & Eric R. Schreiter & Rex A. Kerr & Michael B. Orger & Vivek Jayaraman & Loren L. Looger & Karel Svobod, 2013. "Ultrasensitive fluorescent proteins for imaging neuronal activity," Nature, Nature, vol. 499(7458), pages 295-300, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Philipp Berens & Jeremy Freeman & Thomas Deneux & Nikolay Chenkov & Thomas McColgan & Artur Speiser & Jakob H Macke & Srinivas C Turaga & Patrick Mineault & Peter Rupprecht & Stephan Gerhard & Rainer , 2018. "Community-based benchmarking improves spike rate inference from two-photon calcium imaging data," PLOS Computational Biology, Public Library of Science, vol. 14(5), pages 1-13, May.
    2. Pietro D’Alessandro & Manlio Gaudioso & Giovanni Giallombardo & Giovanna Miglionico, 2024. "The Descent–Ascent Algorithm for DC Programming," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 657-671, March.
    3. Eduardo L. Montoya & Wendy Meiring, 2016. "An F-type test for detecting departure from monotonicity in a functional linear model," Journal of Nonparametric Statistics, Taylor & Francis Journals, vol. 28(2), pages 322-337, June.
    4. Monse Guedes-Ayala & Pierre-Louis Poirion & Lars Schewe & Akiko Takeda, 2025. "Sparse sub-gaussian random projections for semidefinite programming relaxations," Journal of Global Optimization, Springer, vol. 93(3), pages 701-731, November.
    5. Andrew Butler & Roy H. Kwon, 2023. "Efficient differentiable quadratic programming layers: an ADMM approach," Computational Optimization and Applications, Springer, vol. 84(2), pages 449-476, March.
    6. Wojciech Skwirz, 2025. "Feature selection methods for Cox proportional hazards model. Comparative study for financial and medical survival data," Bank i Kredyt, Narodowy Bank Polski, vol. 56(1), pages 113-138.
    7. Nicholas Moehle & Mykel J. Kochenderfer & Stephen Boyd & Andrew Ang, 2021. "Tax-Aware Portfolio Construction via Convex Optimization," Journal of Optimization Theory and Applications, Springer, vol. 189(2), pages 364-383, May.
    8. Grillo, Marco & Kotłowski, Wojciech & Kadziński, Miłosz, 2025. "Ordinal regression meets online learning: Interactive preference learning for multiple criteria choice and ranking with provable guarantees," European Journal of Operational Research, Elsevier, vol. 327(3), pages 1003-1022.
    9. Aniruddha Das & Sarah Holden & Julie Borovicka & Jacob Icardi & Abigail O’Niel & Ariel Chaklai & Davina Patel & Rushik Patel & Stefanie Kaech Petrie & Jacob Raber & Hod Dana, 2023. "Large-scale recording of neuronal activity in freely-moving mice at cellular resolution," Nature Communications, Nature, vol. 14(1), pages 1-12, December.
    10. Enzo Busseti, 2019. "Derivative of a Conic Problem with a Unique Solution," Papers 1903.05753, arXiv.org, revised Mar 2019.
    11. Dongdong Ge & Chengwenjian Wang & Zikai Xiong & Yinyu Ye, 2025. "From an Interior Point to a Corner Point: Smart Crossover," INFORMS Journal on Computing, INFORMS, vol. 37(6), pages 1670-1688, November.
    12. da Costa, B. Freitas Paulo & Pesenti, Silvana M. & Targino, Rodrigo S., 2023. "Risk budgeting portfolios from simulations," European Journal of Operational Research, Elsevier, vol. 311(3), pages 1040-1056.
    13. Fang, Fang & Chen, Yuanyuan, 2019. "A new approach for credit scoring by directly maximizing the Kolmogorov–Smirnov statistic," Computational Statistics & Data Analysis, Elsevier, vol. 133(C), pages 180-194.
    14. Michael Garstka & Mark Cannon & Paul Goulart, 2021. "COSMO: A Conic Operator Splitting Method for Convex Conic Problems," Journal of Optimization Theory and Applications, Springer, vol. 190(3), pages 779-810, September.
    15. Jilt Sebastian & Mriganka Sur & Hema A Murthy & Mathew Magimai-Doss, 2021. "Signal-to-signal neural networks for improved spike estimation from calcium imaging data," PLOS Computational Biology, Public Library of Science, vol. 17(3), pages 1-19, March.
    16. Feng-Yi Liao & Lijun Ding & Yang Zheng, 2026. "An overview and comparison of spectral bundle methods for primal and dual semidefinite programs," Computational Optimization and Applications, Springer, vol. 93(2), pages 523-566, March.
    17. Thanh-an Pham & Aleix Boquet-Pujadas & Sandip Mondal & Michael Unser & George Barbastathis, 2024. "Deep-prior ODEs augment fluorescence imaging with chemical sensors," Nature Communications, Nature, vol. 15(1), pages 1-14, December.
    18. Richard F Betzel & Katherine C Wood & Christopher Angeloni & Maria Neimark Geffen & Danielle S Bassett, 2019. "Stability of spontaneous, correlated activity in mouse auditory cortex," PLOS Computational Biology, Public Library of Science, vol. 15(12), pages 1-25, December.
    19. Guillermo Angeris & Akshay Agrawal & Alex Evans & Tarun Chitra & Stephen Boyd, 2021. "Constant Function Market Makers: Multi-Asset Trades via Convex Optimization," Papers 2107.12484, arXiv.org.
    20. Legrand, Catherine & Munda, Marco & Janssen, P. & Duchateau, L., 2012. "A general class of time-varying coefficients models for right censored data," LIDAM Discussion Papers ISBA 2012041, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pcbi00:1005423. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.