P147 Latency correction in sparse neuronal spike trains with overlapping global events
Arturo Mariani1, Federico Senocrate1, Jason Mikiel-Hunter2, David McAlpine2, Barbara Beiderbeck3,
Michael Pecka4, Kevin Lin5,Thomas Kreuz6,7∗
1Department of Physics and Astronomy, University of Florence, Sesto Fiorentino, Italy
2Department of Linguistics, Macquarie University, Sydney, Australia
3 Graduate School of Systemic Neurosciences, Ludwig-Maximilians-Universität, Munich, Germany
4 Division of Neurobiology, Faculty of Biology, Ludwig-Maximilians-Universität, Munich, Germany
5École Nationale Supérieure de l’Électronique et de ses Applications, Cergy, France
6Institute for Complex Systems (ISC), National Research Council (CNR), Sesto Fiorentino, Italy
7National Institute of Nuclear Physics (INFN), Florence Section, Sesto Fiorentino, Italy
* Email: thomas.kreuz@cnr.it
Introduction
In Kreuz et al., J Neurosci Methods 381, 109703 (2022)[1]two methods were proposed that perform latency correction, i.e., optimise the spike time alignment of sparse neuronal spike trains with well-defined global spiking events. The first one based on direct shifts is fast but uses only partial latency information, while the other one makes use of the full information but relies on the computationally costly simulated annealing. Both methods reach their limits and can become unreliable when successive global events are not sufficiently separated or even overlap.
Methods
Here[2]we propose an iterative scheme that combines the advantages of the two original methods by using in each step as much of the latency information as possible and by employing a very fast extrapolation direct shift method instead of the much slower simulated annealing.
Results
We illustrate the effectiveness and the improved performance, measured in terms of the relative shift error, of the new iterative scheme not only on simulated data with known ground truths but also on single-unit recordings from two medial superior olive neurons of a gerbil. The iterative scheme outperforms the existing approaches on both the simulated and the experimental data. Due to its low computational demands, and in contrast to simulated annealing, it can also be applied to very large datasets.
Discussion
The new method generalises and improves on the original method both in terms of accuracy and speed. Importantly, it is the only method that allows to disentangle global events with overlap.
Acknowledgements
J.M.H. and B.B. were supported in this study by an Australian Research Council Laureate Fellowship (FL 160100108) awarded to D.M.
References
[1]
Kreuz, T., Senocrate, F., Cecchini, G., Checcucci, C., Mascaro, A.L.A., Conti, E., Scaglione, A. and Pavone, F.S., 2022
Latency correction in sparse neuronal spike trains
J. Neurosci. Methods 381, 109703 (2022)
http://dx.doi.org/10.1016/j.jneumeth.2022.109703
[2]
Mariani, A., Senocrate, F., Mikiel-Hunter, J., McAlpine, D., Beiderbeck, B., Pecka, M., Lin, K. and Kreuz, T., 2025
Latency correction in sparse neuronal spike trains with overlapping global events
Journal of Neuroscience Methods 110378
https://doi.org/10.1016/j.jneumeth.2025.110378
