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.
Publisher
Cold Spring Harbor Laboratory
Reference54 articles.
1. James J Jun , Catalin Mitelut , Chongxi Lai , Sergey L Gratiy , Costas A Anastassiou , and Tim-othy D Harris . Real-time spike sorting platform for high-density extracellular probes with ground-truth validation and drift correction. BioRxiv, page 101030, 2017.
2. A spike sorting toolbox for up to thousands of electrodes validated with ground truth recordings in vitro and in vivo
3. A fully automated approach to spike sorting;Neuron,2017
4. Clustering by fast search and find of density peaks
5. Uni-modal clustering using isotonic regression: Isosplit;arXiv preprint,2015
Cited by
57 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献