Please use this identifier to cite or link to this item:
|Title:||Spike sorting with Gaussian mixture models|
|Authors:||Souza, Bryan C.|
Tort, Adriano B. L.
|Keywords:||spike sorting;Gaussian mixture models;computational neuroscience|
|Citation:||SOUZA, B. C. et al. Spike sorting with Gaussian mixture models. Sci Rep. v. 9, p. 3627, mar. 2019. Doi: 10.1038/s41598-019-39986-6|
|Portuguese Abstract:||The shape of extracellularly recorded action potentials is a product of several variables, such as the biophysical and anatomical properties of the neuron and the relative position of the electrode. This allows isolating spikes of different neurons recorded in the same channel into clusters based on waveform features. However, correctly classifying spike waveforms into their underlying neuronal sources remains a challenge. This process, called spike sorting, typically consists of two steps: (1) extracting relevant waveform features (e.g., height, width), and (2) clustering them into non-overlapping groups believed to correspond to different neurons. In this study, we explored the performance of Gaussian mixture models (GMMs) in these two steps. We extracted relevant features using a combination of common techniques (e.g., principal components, wavelets) and GMM fitting parameters (e.g., Gaussian distances). Then, we developed an approach to perform unsupervised clustering using GMMs, estimating cluster properties in a data-driven way. We found the proposed GMM-based framework outperforms previously established methods in simulated and real extracellular recordings. We also discuss potentially better techniques for feature extraction than the widely used principal components. Finally, we provide a friendly graphical user interface to run our algorithm, which allows manual adjustments.|
|Appears in Collections:||ICe - Artigos publicados em periódicos|
Files in This Item:
|AdrianoTort_ICe_2019_Spike sorting.pdf||drianoTort_ICe_2019_Spike sorting||5,93 MB||Adobe PDF||View/Open|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.