Solving the spike sorting problem with Kilosort

janelia7_blocks-janelia7_biblio_header | block

bioRxiv. 2023 Jan 07;. doi: 10.1101/2023.01.07.523036

Solving the spike sorting problem with Kilosort Pachitariu LabStringer Lab

Pachitariu Marius, Sridhar Shashwat, Stringer Carsen

janelia7_blocks-janelia7_biblio_abstract | block

Abstract

Spike sorting is the computational process of extracting the firing times of single neurons from recordings of local electrical fields. This is an important but hard problem in neuroscience, complicated by the non-stationarity of the recordings and the dense overlap in electrical fields between nearby neurons. To solve the spike sorting problem, we have continuously developed over the past eight years a framework known as Kilosort. This paper describes the various algorithmic steps introduced in different versions of Kilosort. We also report the development of Kilosort4, a new version with substantially improved performance due to new clustering algorithms inspired by graph-based approaches. To test the performance of Kilosort, we developed a realistic simulation framework which uses densely sampled electrical fields from real experiments to generate non-stationary spike waveforms and realistic noise. We find that nearly all versions of Kilosort outperform other algorithms on a variety of simulated conditions, and Kilosort4 performs best in all cases, correctly identifying even neurons with low amplitudes and small spatial extents in high drift conditions.

node:body | entity_field

Previous bioRxiv PrePrint https://doi.org/10.1101/2023.01.07.523036

janelia7_blocks-janelia7_biblio_authors | block

janelia7_blocks-janelia7_biblio_tools | block

Main Menu (Mobile)- Block

Main Menu - Block

Solving the spike sorting problem with Kilosort

Abstract

Janelia Authors