TY - JOUR
T1 - A unified framework and method for automatic neural spike identification
AU - Ekanadham, Chaitanya
AU - Tranchina, Daniel
AU - Simoncelli, Eero P.
N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.
PY - 2014/1/30
Y1 - 2014/1/30
N2 - Automatic identification of action potentials from one or more extracellular electrode recordings is generally achieved by clustering similar segments of the measured voltage trace, a method that fails (or requires substantial human intervention) for spikes whose waveforms overlap. We formulate the problem in terms of a simple probabilistic model, and develop a unified method to identify spike waveforms along with continuous-valued estimates of their arrival times, even in the presence of overlap. Specifically, we make use of a recent algorithm known as Continuous Basis Pursuit for solving linear inverse problems in which the component occurrences are sparse and are at arbitrary continuous-valued times. We demonstrate significant performance improvements over current state-of-the-art clustering methods for four simulated and two real data sets with ground truth, each of which has previously been used as a benchmark for spike sorting. In addition, performance of our method on each of these data sets surpasses that of the best possible clustering method (i.e., one that is specifically optimized to minimize errors on each data set). Finally, the algorithm is almost completely automated, with a computational cost that scales well for multi-electrode arrays.
AB - Automatic identification of action potentials from one or more extracellular electrode recordings is generally achieved by clustering similar segments of the measured voltage trace, a method that fails (or requires substantial human intervention) for spikes whose waveforms overlap. We formulate the problem in terms of a simple probabilistic model, and develop a unified method to identify spike waveforms along with continuous-valued estimates of their arrival times, even in the presence of overlap. Specifically, we make use of a recent algorithm known as Continuous Basis Pursuit for solving linear inverse problems in which the component occurrences are sparse and are at arbitrary continuous-valued times. We demonstrate significant performance improvements over current state-of-the-art clustering methods for four simulated and two real data sets with ground truth, each of which has previously been used as a benchmark for spike sorting. In addition, performance of our method on each of these data sets surpasses that of the best possible clustering method (i.e., one that is specifically optimized to minimize errors on each data set). Finally, the algorithm is almost completely automated, with a computational cost that scales well for multi-electrode arrays.
KW - Action potential
KW - Clustering
KW - Multi-electrode
KW - Neural spike identification
KW - Spike detection
KW - Spike sorting
UR - http://www.scopus.com/inward/record.url?scp=84888079100&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84888079100&partnerID=8YFLogxK
U2 - 10.1016/j.jneumeth.2013.10.001
DO - 10.1016/j.jneumeth.2013.10.001
M3 - Article
C2 - 24184059
AN - SCOPUS:84888079100
SN - 0165-0270
VL - 222
SP - 47
EP - 55
JO - Journal of Neuroscience Methods
JF - Journal of Neuroscience Methods
ER -