Professional Documents
Culture Documents
1 Research report
7
20 a r t i c l e i n f o a b s t r a c t
8
9 Article history: Spike sorting is a crucial step to extract information from extracellular recordings. With new recording
10 Received 6 March 2015 opportunities provided by the development of new electrodes that allow monitoring hundreds of neu-
11 Accepted 19 April 2015 rons simultaneously, the scenario for the new generation of algorithms is both exciting and challenging.
12 Available online xxx
However, this will require a new approach to the problem and the development of a common reference
13 framework to quickly assess the performance of new algorithms. In this work, we review the basic con-
14 Keywords:
cepts of spike sorting, including the requirements for different applications, together with the problems
15 Spike sorting
faced by presently available algorithms. We conclude by proposing a roadmap stressing the crucial points
16 Extracellular recordings
17 Modeling
to be addressed to support the neuroscientific research of the near future.
18 On-chip applications © 2015 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY license
19 Multielectrode recordings (http://creativecommons.org/licenses/by/4.0/).
22 Monitoring the activity of single neurons in vivo is the basis of its dendritic tree, the distance and orientation relative to the 48
23 for understanding the brain mechanisms supporting behavior. Fol- recording site, the distribution of ionic channels and the proper- 49
24 lowing this principle, electrophysiologists have been recording the ties of the extracellular medium (Gold et al., 2006). The detected 50
25 activity of neurons for decades. The cornerstone of these record- spikes are grouped into different clusters based on their shapes in 51
26 ings is the placement of electrodes in brain tissue to register the a process known as Spike Sorting (Quian Quiroga, 2007). Each clus- 52
27 extracellular activity of neurons. In these recordings the electrode ter is then associated to a single unit (neuron), but some shapes 53
28 is placed in the space between neurons, as opposed to other tech- cannot be separated due to a low signal to noise ratio, leading to 54
29 niques such as patch clamp or intracellular recordings, in which the a cluster associated with multiunit activity (Fig. 1). The multiunit 55
30 electrode is attached to one cell. The electrical potential changes cluster is formed by the superposition of different spikes, it has a 56
31 measured at the electrode tip reflect current flows in the extracellu- relatively low amplitude and violates the refractory period of single 57
32 lar medium. The recording and data processing steps are described neurons—i.e., spikes appear within less than 2.5 ms (Quian Quiroga, 58
33 in Fig. 1. Basically, the recorded data is lowpass filtered to obtain the 2012a). By combining extracellular recordings and spike sorting 59
34 so called Local Field Potentials (LFPs), which reflect the dynamics of methods we can isolate the activity of a few units per electrode 60
35 the neural tissue surrounding the electrode (around 1 mm in diam- for a period of time that ranges from a few hours, in the case of 61
36 eter). LFPs are generated by the input currents from the dendrites of acute recordings in which the electrodes are lowered into cortex 62
37 the surrounding neurons and they are prominent in tissues where in each recording session, to months or even years in the case of 63
38 the cell bodies are (partially) aligned creating coherent dipoles in stable chronically implanted electrodes (Homer et al., 2013). 64
39 the recorded medium (Buzsáki et al., 2012). By bandpass filtering The importance of spike sorting is stressed by the fact that close- 65
40 the signal, we obtain the activity of a few neurons close enough to by neurons—whose firing is picked up by the same electrode—can 66
41 the electrode plus background activity elicited by neurons further fire in response to different things and therefore, it might be cru- 67
42 away from the tip (black trace in the bottom panel of Fig. 1). cial to know which spike corresponds to which neuron. This is the 68
43 In the recorded bandpass filtered signal, the activity of different case, for example, in the human or rat hippocampus, where nearby 69
44 neurons is superimposed and it is important to extract the identi- neurons fire to unrelated concepts in the first case (Rey et al., 2014) 70
45 ties of the spikes corresponding to different neurons. In principle, and to distant place fields in the latter (Redish et al., 2001). But 71
∗ Corresponding author. Tel.: +44 116 252 3249. their individual tuning properties, firing characteristics, relation- 74
E-mail address: rqqg1@le.ac.uk (R. Quian Quiroga). ship with other neurons and local field potentials, etc. In these cases, 75
http://dx.doi.org/10.1016/j.brainresbull.2015.04.007
0361-9230/© 2015 The Authors. Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
Please cite this article in press as: Rey, H.G., et al., Past, present and future of spike sorting techniques. Brain Res. Bull. (2015),
http://dx.doi.org/10.1016/j.brainresbull.2015.04.007
G Model
BRB 8853 1–11 ARTICLE IN PRESS
2 H.G. Rey et al. / Brain Research Bulletin xxx (2015) xxx–xxx
Fig. 1. From extracellular recordings to spike trains. Example of an extracellular recording (raw data) from the human right entorhinal cortex. The low frequency content
of that signal is associated with the local field potential (between 1 and 100 Hz in this example). Within the higher frequency content (between 300 and 3000 Hz in this
example; black trace in bottom panel) there is a superposition of several effects. Neurons in zone III (more than ∼140 m away from the tip of the electrode) contribute
to the background noise, so their spikes cannot be detected. The neurons in zone II generate spikes larger than the background noise, but they cannot be separated into
different units, thus being associated to the multiunit activity (cluster 1). Finally, the neurons in zone I (less than ∼50 m away from the tip of the electrode) have even larger
spikes, and sorting algorithms allow us to assign the recorded spikes to the different neurons that generated them (clusters 2–4), hence the so-called single unit activity. The
sequence of spikes associated to each cluster is called a spike train. In the bottom panel, the time of occurrence of each spike is marked with a triangle color-coded according
to the isolated clusters.
76 single neuron activity can reflect well-established processes like recording sites typically 25–50 m apart (Gray et al., 1995), fol- 99
77 lateral inhibition and excitatory-inhibitory competition between lowed by polytrodes, namely, one or more columns with 8–64 100
78 nearby units. Accurate labeling of individual neurons is also cru- channels spaced 50–70 m (Blanche et al., 2005; Buzsáki, 2004; 101
79 cial to study connectivity patterns of close-by neurons, or to study Csicsvari et al., 2003)—and has so far not being matched by analo- 102
80 the topographical organization of a given area and discriminate the gous improvements in spike sorting algorithms. The lagging in the 103
81 responses of nearby units (Quian Quiroga, 2007). In addition, spike development of optimal spike sorting algorithms (see Section 5) is 104
82 sorting is essential for the identification of sparsely firing neurons becoming critical, considering that within the next 10 years we will 105
83 that have, for example, been related to abstract levels of cognition likely witness major changes in conventional recording and signal 106
84 (Quian Quiroga, 2012b; Rey et al., 2014). The critical characteristic acquisition systems, taking the number of recording sites to thou- 107
85 of these units is their very low baseline activity, thus been easily sands (Alivisatos et al., 2013). Unfortunately, current spike sorting 108
86 missed without proper sorting because of the more dominant firing algorithms are a long way off to face the challenge of processing 109
87 of other nearby neurons with larger firing rates (Rey et al., 2014). efficiently and reliably such a high volume of data. The amount 110
88 For all these reasons, the development of spike sorting and complexity of the data (number of channels times number of 111
89 algorithms has always been a key issue in the analysis of electro- samples per second plus the information derived from the spatial 112
90 physiological recordings. Ever since the beginning of extracellular configuration of the recording sites) to be produced by the next 113
91 recordings, several efforts have been made to develop such tech- generation of probes is too large to be handled by researchers in a 114
92 niques (Abeles and Goldstein, 1977; Lewicki, 1998). In general, supervised way. Hence, the only viable option to deepen our under- 115
93 the number of simultaneously recorded neurons has grown expo- standing of the brain through the technology already available to 116
94 nentially since the 1950s, doubling every 7 years, and currently us is the usage of easy-to-use and properly validated tools for fully 117
95 allowing electrical observation of hundreds of neurons at sub- automatic spike sorting (Einevoll et al., 2012). 118
96 millisecond timescales (Stevenson and Kording, 2011). However, In this review we provide a general overview of the principles 119
97 this improvement should be solely attributed to the development of spike sorting, starting by framing the problem and presenting 120
98 of better recording techniques—i.e., the use of tetrodes, namely, 4 classic solutions spread across the scientific community. Then, we 121
Please cite this article in press as: Rey, H.G., et al., Past, present and future of spike sorting techniques. Brain Res. Bull. (2015),
http://dx.doi.org/10.1016/j.brainresbull.2015.04.007
G Model
BRB 8853 1–11 ARTICLE IN PRESS
H.G. Rey et al. / Brain Research Bulletin xxx (2015) xxx–xxx 3
noticed that the raw data is typically recorded using a hardware 142
acquisition system that includes a first analog causal IIR (infi- 143
nite impulse response) bandpass filter, e.g., between 0.3 Hz and 144
7500 Hz. For the purpose of spike detection and sorting, a sec- 145
ond digital filter, e.g., between 300 Hz and 3000 Hz, is typically 146
used. 147
With respect to the type of filter, IIR filters use a feedback path 148
that allows it to reach a certain specification (in terms of its fre- 149
quency response) with a lower order than finite impulse response 150
(FIR) filters, thus being in principle preferred for their efficient hard- 151
when the filter is designed and most importantly, causal IIR fil- 154
ters have a nonlinear phase response that can distort the signal 155
because each data point is filtered online based on the values of pre- 157
vious data points (a noncausal filter would require knowing future 158
not yet recorded values or introducing a delay in the online sig- 159
nal). For the first hardware filter, the nonlinear phase response 160
is not critical because the frequency cutoffs of the filter are far 161
from the frequency of interest. Regarding the second digital filter, 162
it has been shown that such nonlinear phase responses of the most 163
used causal IIR filters can largely distort the spike shapes (Quian 164
Quiroga, 2009). These filtering artifacts may compromise the dis- 165
(Henze et al., 2000). Moreover, it has been shown that phase non- 169
linearities not only distort spike shapes but can actually change 170
the appearance of signal artifacts and make them look similar to 171
the easiest solution is to use zero-phase filtering, i.e., the phase 173
response is zero for all the frequencies, by processing the input sig- 174
nal in both the forward and reverse direction (Oppenheim et al., 175
Fig. 2. Basic steps for spike sorting. Starting from the recorded raw data, (i) a band-
pass filter is applied, e.g., between 300 Hz and 3000 Hz, to keep the most useful
1989). However, some applications require online processing, e.g., 176
part of the spectrum for spike sorting. Next, (ii) spikes are detected, usually using closed-loop experiments (where the experimental design is contin- 177
an amplitude threshold applied to the filtered data. In (iii), relevant features of the gent upon the neural activity and/or the behavioral performance), 178
spike shapes are extracted, achieving a dimensionality reduction. Finally, those fea- or neural prostheses (where a prosthetic device can be controlled 179
tures are the input to a clustering algorithm (iv) that performs the classification of
based on the neural activity). In these cases, nearly linear phase 180
the waveforms and associate each cluster to a unit.
IIR filters can be used (Nongpiur et al., 2013; Powell and Chau, 181
Source: Adapted from (Quian Quiroga, 2012a).
1991). 182
122 will review constrains and limitations faced by these solutions and
2.2. Detection 183
123 we will propose a unified framework for testing and comparing the
124 performance of different algorithms. Finally, we outline the lines to
After filtering, spikes are easily visualized on top of background 184
125 be followed in the next few years to provide adequate support to
noisy activity and can be detected, for example, by using an ampli- 185
126 the new generation of recording probes.
tude threshold. If the value of the threshold is too small, noise 186
fluctuations will lead to false positive events, if it is too large, low- 187
127 2. Current spike sorting strategies amplitude spikes will be missed. A threshold can be set manually, 188
but since the detection tradeoff is related to the signal to noise 189
128 The classic approach to spike sorting is summarized in Fig. 2. The ratio of the recording, it seems reasonable to look for an automatic 190
129 recorded raw data is first bandpass filtered to facilitate spike detec- threshold as a multiple of an estimate of the standard deviation 191
130 tion, which is usually done using an amplitude threshold applied to of the noise, i.e., thresold = k ∗ ˆ n , where k is a constant typically 192
131 the filtered data. Afterwards, relevant features of the spike shapes between 3 and 5. 193
132 are extracted, which become the input to a clustering algorithm To set an automatic threshold, it is in principle reasonable to 194
133 that performs the classification of the waveforms and associate use a value based on the standard deviation of the (filtered) sig- 195
134 each cluster to a unit. In the following, we discuss the different nal. However, this naïve approach can lead to high error rates. For 196
135 steps in more detail. detection purposes, the filtered signal X can be approximated as 197
a mixture of the noise component N (with zero mean and vari- 198
136 2.1. Filtering ance n2 ) and the spike component S (with mean s and variance 199
s2 ), the latter with probability. The resulting distribution would 200
137 As illustrated in Fig. 1, spikes coexist in the raw data with the be heavy tailed due to the spike component. However, ps is very 201
138 LFPs and the contribution of each type of signal can be separated small, so the variance of the mixture can be approximated by 202
203
139 by filtering, keeping the high and low frequency activity, respec-
140 tively. In order to detect the spikes, bandpass filtering allows setting
141 amplitude threshold (see bottom panel in Fig. 1). It should be x2 ≈ n2 + 2s ps 204
Please cite this article in press as: Rey, H.G., et al., Past, present and future of spike sorting techniques. Brain Res. Bull. (2015),
http://dx.doi.org/10.1016/j.brainresbull.2015.04.007
G Model
BRB 8853 1–11 ARTICLE IN PRESS
4 H.G. Rey et al. / Brain Research Bulletin xxx (2015) xxx–xxx
205 Clearly, using the variance of the mixture as an estimate of the that elicits the firing of the neuron is not present while the 265
206 variance of the noise will lead to a larger threshold, particularly in windows/templates are set (Quian Quiroga, 2007). 266
207 the cases of high firing rate and large amplitude spikes. A different approach involves capturing features from the spike 267
208 To improve this estimate, an alternative approach was proposed shapes that will be later used for clustering the waveforms. For 268
209 (Quian Quiroga et al., 2004). If we assume that the noise component example, spike peak amplitude and width of the spikes can be 269
210
N is normally distributed, it can be shown that input to a clustering algorithm (Lewicki, 1998). However, it has 270
been shown that these features are relatively poor for differentiat- 271
median(|N|)
211 n = , ing spike shapes (Quian Quiroga et al., 2004). In general, the more 272
0.6745 discriminative features we have, the better the ability to distin- 273
212 where the denominator comes from the inverse of the cumulative guish the different spike shapes. If we store M samples for each 274
213 distribution function for the standard normal distribution evalu- waveform, the spike shapes can be represented as points in an 275
214 ated at 0.75. In this case, the fact that ps is very small leads to the M-dimensional space. The complexity of clustering in such a high 276
215 spike component not affecting much the median absolute devia- dimensional space calls for a dimensionality reduction. The goal is to 277
216 tion, i.e., median(|X|) ≈ median(|N|). Therefore, the estimate used keep only the features that help the classification, given that elimi- 278
217
to compute the threshold is nating inputs dominated by noise can improve clustering outcomes 279
(Quian Quiroga, 2007). The main issue is how to choose the minimal 280
median(|X|)
218 ˆ n = set of features that yields the best discrimination. 281
0.6745
One of the most common feature extraction and dimensionality 282
219 This explains why an estimate based on the median absolute reduction methods is principal component analysis (PCA) (Abeles 283
220 deviation of the filtered signal is much more robust than one using and Goldstein, 1977; Harris et al., 2000; Lewicki, 1998; Shoham 284
221 the standard deviation estimate. In fact, this improvement has been et al., 2003). PCA gives an ordered set of orthogonal vectors that 285
222 shown using simulations (Quian Quiroga et al., 2004) and real data capture the directions of largest variations in the data and any 286
223 (Quian Quiroga, 2007), even if the noise distribution might deviate waveform is represented as a linear combination of the princi- 287
224 from Gaussian. pal components. Using only the first K components can account 288
225 To improve detection performance some sorting algorithms for most of the energy in the data, so its associated scores can 289
226 include an extra transformation to the filtered signal before be used as input to a clustering algorithm. This way, the dimen- 290
227 thresholding, e.g., applying an energy operator (Bestel et al., sionality reduction is achieved by going from an M-dimensional 291
228 2012; Rutishauser et al., 2006), the continuous wavelet transform space to a K-dimensional space, with K M (typically, K equals 2 292
229 (Nenadic and Burdick, 2005), or using fuzzy and probability theories or 3). 293
230 (Azami et al., 2015). In addition, given that the noise distribution The most used alternative to PCA for feature extraction is 294
231 could be nonstationary, it is possible to compute the estimate using wavelets (Hulata et al., 2002; Quian Quiroga et al., 2004; Takekawa 295
232 blocks of data, e.g., 5 min long. Then, the threshold will be less et al., 2010). The wavelet functions (smooth and quickly vanish- 296
233 affected by changes in the noise distribution, avoiding an increase ing oscillating functions) are formed by dilated (contracted) and 297
234 in the detection error rate. shifted versions of a “mother wavelet” (Mallat, 1999). The detected 298
235 After detection, the next step is to store the putative spike wave- waveforms are then convolved with the wavelets leading to a 299
236 forms (∼2 to 3 ms long), which will be the input to the sorting set of coefficients that represent the signal decomposition. There- 300
237 algorithm. In some cases, alignment to the peak of the waveforms fore, a large correlation between the signal and the wavelet at a 301
238 can improve the classification process, depending on the features certain time and scale shows how well the wavelet can be used 302
239 used (see next subsection). But before doing that the waveforms as a local approximation of the signal. This way, very localized 303
240 should be interpolated to improve the detection of the peak, e.g., shape differences in the spikes of individual units can be dis- 304
241 using cubic splines, and afterwards they could be decimated back cerned with a few wavelet coefficients. The information about 305
242 to the original sampling rate. the shape of the spikes will be distributed in several wavelet 306
Please cite this article in press as: Rey, H.G., et al., Past, present and future of spike sorting techniques. Brain Res. Bull. (2015),
http://dx.doi.org/10.1016/j.brainresbull.2015.04.007
G Model
BRB 8853 1–11 ARTICLE IN PRESS
H.G. Rey et al. / Brain Research Bulletin xxx (2015) xxx–xxx 5
332 The final step of the spike sorting process is to group the 2.5.1. Validation of results 397
333 points in the feature space into clusters, with each cluster asso- Once a sorting solution is obtained, it might be useful to quan- 398
334 ciated to a different neuron. With manual cluster-cutting, the tify the degree of confidence on the results, based on the clusters 399
335 user defines the boundaries for the different clusters (Gray et al., separation. When spikes from two different neurons are incorrectly 400
336 1995). However, this relies on analyzing different two- or three- classified as a single cluster, it is possible to have spikes with inter- 401
337 dimensional projections of the feature space, which can be very spike intervals below the minimum refractory period of the neuron 402
338 time consuming. Moreover, manual clustering introduces errors (about 2–3 ms). If the proportion of refractory period violations is 403
339 due to both the limited dimensionality of the cluster cutting significant, it can be seen as a measure of poor isolation of the single 404
340 space and human biases (Harris et al., 2000; Pedreira et al., units (however, the opposite is not true, i.e., the absence of refrac- 405
341 2012). tory period violations does not guarantee single neuron clusters). 406
342 Alternatively, a few algorithms were constructed within the Alternatively, it has been proposed that a non-uniform variance of 407
343 framework of Bayesian clustering and classification (Lewicki, the spike shape is also a measure of poor unit isolation (Pouzat et al., 408
344 1998). For this, clusters are assumed, in general, to have a Gaussian 2002). The separations between clusters of spikes can also be quan- 409
345 distribution, based on the claim that for a given cluster the spike tified (Hill et al., 2011; Schmitzer-Torbert et al., 2005; Swindale 410
346 variability is determined only by additive and Gaussian stationary and Spacek, 2014) and used to decide whether or not two clusters 411
347 background noise. If C clusters are assumed, the parameters of the should be merged—although if the quality metrics are based on cer- 412
348 resulting mixture of Gaussians can be estimated using an Expec- tain model hypotheses (e.g., Gaussian distributions) they might be 413
349 tation Maximization procedure (Harris et al., 2000; Pouzat et al., of relative use when these hypotheses are not met. Still, in most 414
350 2002). As C is actually unknown, several models (with different val- cases the final sorting outcome is given by the user, which does not 415
351 ues of C) can be estimated and a penalty function is introduced to only have an impact on the overall error rate but can also exhibit 416
352 penalize overfitting, by discouraging models with a large number subjective biases, depending on the relative importance given to 417
353 of parameters (Schwarz, 1978). A related approach involves using false positive and false negative errors (Harris et al., 2000). 418
356 2008). Tetrodes are 4 close-by recording electrodes that are used to 420
357 One problem with the ‘mixture of Gaussians’ approach is that observe the same set of neurons from different sites. They can be 421
358 there are several experimental conditions that lead to clusters with constructed by twisting together four small individually insulated 422
359 non-Gaussian shapes (see below). In those cases, the structure of microwires or by placing four contacts in a neural probe with a 423
360 the data can be very difficult to capture with a mixture model, typical separation of 25–50 m. The use of tetrodes, or more gen- 424
361 making it challenging to predict the number of units and to make erally of polytrodes, has been shown to increase dramatically the 425
362 accurate classifications (Lewicki, 1998). In fact, methods assum- single cell yield (Gray et al., 1995; Harris et al., 2000). Also, they pro- 426
363 ing Gaussian distributions tend to overcluster by fitting several vide better sorting quality, since an ambiguous separation from one 427
364 multivariate Gaussians to a single non-Gaussian cluster. One alter- channel can be disentangled using the information from another 428
365 native is to use a mixture of distributions with a wider tail, e.g., nearby channel (Quian Quiroga, 2012a). 429
366 t-distributions (Shoham et al., 2003). Another alternative is to use To perform spike sorting from tetrode recordings the peak 430
367 hierarchical clustering, where the data is first grouped into a large amplitude or the first principal components for each of the channels 431
368 number of clusters, which are then merged according to similari- are used as inputs to the clustering algorithm. Alternatively, clus- 432
369 ties in the spike shapes and the interspike interval distribution (Fee tering of tetrode data can be done by concatenating the spike shapes 433
370 et al., 1996). of the four channels (Quian Quiroga, 2007). With any of these meth- 434
371 Yet another option is to use nonparametric clustering algo- ods, a single tetrode can isolate up to a couple dozens of neurons, 435
372 rithms, e.g., based on nearest neighbor interactions. One example something that is important, for example, to study properties of 436
373 is the super-paramagnetic clustering (SPC), which has been suc- cell assemblies (Buzsáki, 2004). 437
374 cessfully applied for spike sorting (Quian Quiroga et al., 2004). This
375 stochastic algorithm uses a single parameter (the ‘temperature’) to 2.5.3. Overlapping spikes 438
376 group the spikes into clusters. Following the analogy with statistical When two nearby neurons fire synchronously or with a small 439
377 mechanics, for low temperatures all the data is grouped into a single delay, their spikes will overlap in time. If the delay is long enough, 440
378 cluster and for high temperatures the data is split into many clus- the appearance of double peaks might be enough to recognize the 441
379 ters with few members each. However, there is a middle range of two spikes in the waveform. However, if the spikes are too close 442
380 temperatures (the super-paramagnetic regime) where clusters of a they can create complex waveforms, which in turn will difficult 443
381 relatively large size, corresponding to the different single units, are the cluster isolation and may even give rise to new clusters. The 444
382 captured. Being a nonparametric algorithm, SPC does not assume problem of overlapping spikes is one of the most challenging issues 445
383 that clusters are nonoverlapping, that they have low variance, or in spike sorting and although several methods have been proposed 446
384 that they follow a Gaussian distribution. Since SPC can leave points (Hulata et al., 2002; Lewicki, 1994; Pillow et al., 2013; Prentice et al., 447
385 unclassified, a final template matching step is generally used to 2011; Takahashi et al., 2003), there is no optimal approach to deal 448
386 complete the classification result. This approach has already being with it. In this regard, the use of tetrodes or multielectrode probes 449
387 shown to cope well with sparsely firing neurons and the presence can be helpful to deal with this issue since what appears as an over- 450
388 of clusters with largely different sizes (Rey et al., 2014). More- lap on one channel might be an isolated unit on another (Lewicki, 451
389 over, to better optimize the identification of clusters with different 1998). 452
390 sizes, a sequential application of SPC has been proposed (Ott et al.,
391 2005). 2.5.4. Bursting neurons 453
392 Alternative classification algorithms have been tested in the Some neurons generate fast sequences of action potentials 454
393 context of spike sorting, such as neural networks approaches and called bursts. Typically, the amplitude of the spikes across the 455
394 support vector machines. An overview of published spike sorting sequence decreases and they may be assigned to different clusters. 456
395 algorithms can be found in (Bestel et al., 2012). When all these spikes are actually merged, peaks in the interspike 457
Please cite this article in press as: Rey, H.G., et al., Past, present and future of spike sorting techniques. Brain Res. Bull. (2015),
http://dx.doi.org/10.1016/j.brainresbull.2015.04.007
G Model
BRB 8853 1–11 ARTICLE IN PRESS
6 H.G. Rey et al. / Brain Research Bulletin xxx (2015) xxx–xxx
458 interval distribution can be observed, associated to the small time is to look at simultaneous intracellular and extracellular recordings 519
459 between spikes within a burst. A particular pattern with peaks at (Harris et al., 2000; Wehr et al., 1999), but the number of neu- 520
460 about 3 ms will also be observed in the cross-correlogram if the rons that can be simultaneously recorded is not large enough (e.g., 521
461 clusters are analyzed separately, which gives a clear indication that up to 4 in Anastassiou et al., 2013) with respect to the number of 522
462 these clusters correspond to the same bursting neuron. In gen- neurons than can be simultaneously recorded with an extracellular 523
463 eral, the key information to merge clusters into single burst is the electrode or tetrode. This limitation calls for a different approach. 524
464 reliable timing between the sequences of spikes. The most viable alternative is to use synthetic data obtained 525
465 2.5.5. Electrode drifts can be used to objectively quantify and compare the performance 527
466 If the neural tissue moves, the electrode can (slowly) drift to a of different sorting algorithms (Einevoll et al., 2012). The model- 528
467 different position. A typical case is the retraction of the cortical tis- ing challenge is then to reproduce the most relevant features of 529
468 sue after implanting an acute electrode (for this reason, researchers extracellular recordings. A simple strategy is to simulate record- 530
469 usually wait 30 min to 1 h after implantation of the electrodes for ings by adding spikes to Gaussian noise (Lewicki, 1994). This 531
470 the recording to stabilize). During a recording session this might approach is very fast and easy to implement, but it fails to repro- 532
471 translate as a (gradual) change in the shape of the spikes associ- duce important features of the real recordings, such as the presence 533
472 ated to a single unit. Clearly, the associated cluster for the neuron of non-Gaussian clusters, multiunit activity and spectral similar- 534
473 will have a non-Gaussian distribution. In fact, clusters might split, ity between noise and spikes, which might be critical for spike 535
474 or even appear or disappear altogether. One possibility to deal with sorting. In electrophysiological recordings, potential noise sources 536
475 this issue is to plot a certain feature (e.g., the peak amplitude) as include true (Johnson) noise in the electrode and electronics, elec- 537
476 a function of time in the recording. In addition, when dealing with trical pickup from the environment, as well as background activity 538
477 recordings that might last for several days or weeks, significant from distant neurons (Fee et al., 1996). 539
478 changes might take place in the surroundings of the electrode, e.g., The approach in (Martinez et al., 2009) uses a database of pre- 540
479 due to growth of glia cells. In this respect, some sorting algorithms viously recorded spike shapes placed at random times. Single unit 541
480 have considered modeling electrode drifts explicitly to improve activity was simulated to have an amplitude between 1.5 and 4 542
481 their performance (Bar-Hillel et al., 2006), whereas other algo- times the level of the detection threshold, as in real recordings. 543
482 rithms not assuming a particular shape of the clusters can cope Multiunit activity gave rise to non-Gaussian clusters (because they 544
483 with these nonstationarities as long as the changes are not too fast reflect the activity of more than one neuron and the amplitude 545
484 (Quian Quiroga et al., 2004). distribution is truncated by the detection threshold) and was gener- 546
ated by mixing the activity of ∼600 spike shapes using amplitudes 547
485 2.6. Alternative approaches uniformly distributed between 0.5 and 1.5 times the level of the 548
486 Departing from the basic steps described in Fig. 2, alterna- ated by superimposing millions spikes shapes with their amplitude 550
487 tive spike sorting algorithms avoid the detection and/or feature inversely proportional to their distance from the electrode tip, and 551
488 extraction and clustering stages. For example, template match- also adding Gaussian noise to simulate the noise introduced by the 552
489 ing is a particularly appealing when online sorting is necessary, recording equipment. This way, the characteristics of the noise, 553
490 given its simplicity and low computational cost. Once the templates such as its amplitude and frequency distribution, arise naturally 554
491 are computed with an offline sorter, they can be used for tem- from the realistic biophysical process of its generation and it is 555
492 plate matching, in order to classify each new detected spike online not imposed beforehand. A more detailed approach was used in 556
493 (Franke et al., 2012). In line, Rutishauser et al. (2006) proposed to (Lindén et al., 2014), where morphologically reconstructed neu- 557
494 compute templates as the spikes are detected, thus avoiding the rons were first simulated with compartmental modeling to provide 558
495 use an offline sorter. Template matching has also been used to transmembrane currents, e.g., using the program NEURON (Hines 559
496 perform spike sorting on recordings from retinal multi-electrode- and Carnevale, 1997), and were then used to calculate the extracel- 560
497 arrays (MEAs) (e.g., Marre et al., 2012). However, it should be lular potentials. Although this approach can lead to a more realistic 561
498 noticed that due to the particulars of retinal preparations, some model of the extracellular recording, it can be quite computation- 562
499 strategies that are suitable for retinal recordings might not trans- ally intensive. 563
500 late well into other scenarios, e.g., high count electrode in vivo One problem of the approach from (Martinez et al., 2009) is 564
501 recordings from cortical areas. Within spike sorting algorithms that that the position and shape of the electrode affects not only the 565
502 do not use the standard structure of filtering, detection, feature amplitude but also the shape of the spikes from nearby neurons. 566
503 extraction and clustering, it is worth mentioning a model-based At the same time, using the approach from (Lindén et al., 2014) to 567
504 approach to sort based on estimations of the most probable time simulate 1 mm3 of brain tissue might involve running a detailed 568
505 patterns (Ekanadham et al., 2014), or the use of the OPTICS algo- model for ∼300,000 neurons, which has a very large computa- 569
506 rithm (Ankerst et al., 1999; Schneider and Vlachos, 2013) directly tional cost. To cope with these issues, a hybrid approach was 570
507 applied to the detected waveforms (Prentice et al., 2011) to create introduced in (Camuñas-Mesa and Quian Quiroga, 2013). As illus- 571
508 an ordered sequence of spikes. trated in Fig. 3, the key point is to use a detailed compartmental 572
509 3. Modeling extracellular recordings to validate spike ing electrode (Gold et al., 2007), and previously recorded spike 574
510 sorting algorithms shapes to generate the background noise, as in (Martinez et al., 575
511 We previously discussed different metrics used to validate the from far-away neurons was normalized by the squared distance 577
512 outcomes of spike sorting algorithms. However, whether two clus- to the electrode (dipole approximation), without affecting their 578
513 ters should be merged or whether an obtained cluster does not shape. For the detailed model, a line source approximation was 579
514 correspond to a well isolated single unit is a decision that is ulti- used, locating the transmembrane net current for each neurite 580
515 mately left to the user, and is therefore subjective in nature. on a line along its center. The distance separating the two zones 581
516 In order to test the performance of spike sorting algorithms (for detailed modeling and background noise) was set to 150 m, 582
517 objectively, there is a need for ground truth, i.e., knowing the iden- given that for larger distances the variability of the spike shape 583
518 tity of the neurons generating each detected spike. One possibility was negligible and the amplitude decayed as the inverse square of 584
Please cite this article in press as: Rey, H.G., et al., Past, present and future of spike sorting techniques. Brain Res. Bull. (2015),
http://dx.doi.org/10.1016/j.brainresbull.2015.04.007
G Model
BRB 8853 1–11 ARTICLE IN PRESS
H.G. Rey et al. / Brain Research Bulletin xxx (2015) xxx–xxx 7
Fig. 3. Modeling extracellular recordings. (a) Several neurons are randomly placed in a cube of tissue with the recording electrode. The extracellular recording was obtained
by averaging the electric potential over the electrode surface and filtering with the electrode model (b), where Rs is the spreading resistance, Re is the leakage resistance, Ce
is the capacitance of the interface, Rm is the metallic resistance, Cs is the shunt capacitance, and Za is the input impedance of the amplifier. The contribution to the electric
potential from neurons nearby the electrode (less than 150 m) was computed with a detailed compartmental model using the software NEURON (Hines and Carnevale,
1997). (c) and (d) show examples from a pyramidal neuron and interneuron, respectively. In addition, the background noise was generated by adding contributions from
further away neurons (e), using previously recorded spike shapes from a database with an amplitude scaled by the squared distance to the electrode.
Source: Adapted from (Camuñas-Mesa and Quian Quiroga, 2013).
585 the distance, tightly following the dipole approximation. Interest- This hybrid model offers a platform to create synthetic datasets 599
586 ingly, this is approximately the distance that separate the detected for testing spike sorting algorithms, together with new electrode 600
587 spikes from background noise, as has been shown with simultane- designs, as it replicates the most relevant features of real extracellu- 601
588 ous intra- and extra-cellular recordings at different distances from lar recordings, without an excessive computational cost. Moreover, 602
589 the soma (Henze et al., 2000). Furthermore, given that the electrode it also provides a good platform to objectively and systematically 603
590 tip is not a single point source, the effects of finite-size electrodes test algorithms to deal with large electrode arrays, with different 604
591 were also modeled by averaging across their surface and consider- size and separation between them (see also Section 6). 605
Please cite this article in press as: Rey, H.G., et al., Past, present and future of spike sorting techniques. Brain Res. Bull. (2015),
http://dx.doi.org/10.1016/j.brainresbull.2015.04.007
G Model
BRB 8853 1–11 ARTICLE IN PRESS
8 H.G. Rey et al. / Brain Research Bulletin xxx (2015) xxx–xxx
611 amplifier and/or acquisition system imposes mobility restrictions estimated that such an approach would only need 2.24 mW for 100 677
612 to the subject, limiting the experimental setups and clinical stud- channels (with 100 neurons firing at 1 Hz) on a 10 Mbit/s maximum 678
613 ies that can be carried out. A wireless interface would be ideal channel capacity. Another important advantage is that the whole 679
614 to overcome these issues. In addition, it can be a very appeal- device can be implanted subcutaneously (with the battery being 680
615 ing solution for the neuroscience community in order to perform recharged wirelessly), which has an impact on the well being of 681
616 animal experiments in more ecological conditions. Furthermore, the animal as they do not have direct access to the device. 682
654 approximately 2 mW per channel, with a range of up to 3 m. ancy between the number of neurons identified from extracellular 715
655 In order to improve this solution even further, a systematic study recordings and the one supposed to be found based on biophysical 716
656 using simulated recordings looked for the minimum requirements and anatomical considerations. By recording simultaneous intra- 717
657 for an on-chip spike sorting implementation, which gave accurate and extra-cellular recordings from the rat hippocampus, Henze 718
658 results and was efficient in terms of computational cost and power et al. (2000) showed that single neurons can be observed up to 719
659 consumption (Navajas et al., 2014). During a ‘Template Building’ a distance of 50 m from the cell body. Then, there should be about 720
660 stage, a low-power implantable platform filtered the data, per- hundred neurons within a sphere with this radius that we should 721
661 formed analog to digital conversion, and detected the spikes in real be identifying with single channel recordings. However, the num- 722
662 time. The authors showed that by reducing the sampling rate from ber of neurons reported with single recording channels is generally 723
663 28 kHz to 7 kHz and the resolution from 16 bits to 10 bits (with below ten. 724
664 a resulting signal resolution of 0.97 uV/bit) it was still possible to A number of reasons have been suggested to explain the dis- 725
665 achieve a good spike sorting performance. With respect to the tem- crepancy between the number of neurons we should be observing 726
666 plate matching (on-chip) stage, the authors tried several metrics and the ones that are actually identified (Buzsáki, 2004; Shoham 727
667 and showed that the squared Euclidean distance exhibited the best et al., 2006). Some of them include tissue damage caused by the 728
668 relationship of performance versus complexity for hardware imple- insertion of the electrodes in the recording area (Claverol-Tinture 729
669 mentation, requiring only a window size of 0.5 ms around the peak and Nadasdy, 2004) or the electrical insulation caused by the sub- 730
670 for the comparison. In addition, a good peak alignment was shown strate of the probe (Moffitt and McIntyre, 2005). Alternatively, it 731
671 to be important before template matching, which was done using a has been argued that this is due to the low firing rate of relatively 732
672 low power alternative to the classic approach of upsampling before large number of neurons (referred as silent neurons). The presence 733
673 finding the peak (Paraskevopoulou and Constandinou, 2011). Over- of nearly silent neurons (with very low baseline rates) has been 734
674 all, this approach was validated using real extracellular recordings reported in recordings from the medial temporal lobe in humans 735
675 and a drop in performance of ∼20% was achieved by reducing the (Rey et al., 2014) and, more generally, in the mammalian neocortex 736
676 amount of data needed to be processed by ∼85%. Moreover, it was and hippocampus, as they are silent during awake states but can be 737
Please cite this article in press as: Rey, H.G., et al., Past, present and future of spike sorting techniques. Brain Res. Bull. (2015),
http://dx.doi.org/10.1016/j.brainresbull.2015.04.007
G Model
BRB 8853 1–11 ARTICLE IN PRESS
H.G. Rey et al. / Brain Research Bulletin xxx (2015) xxx–xxx 9
(a) correctly identified (hits) and no spurious clusters (false positives) 756
were detected. However, when the number of units was higher, 757
20
the sorting performance decreased, reaching a maximum of about 758
18 8 units. Interestingly, the units that were more frequently missed 759
16 were the ones with a lower firing rate, thus being the most silent 760
12
Hits
6
One of the most striking facts about spike sorting methods 763
is that, despite having been used for decades, there is no clear 764
4
agreement within the researcher community about spike sorting 765
2 standards. To compare different methods, we have argued in Sec- 766
0 tion 3 that simulated signals present the ideal test-bench. The 767
0 2 4 6 8 10 12 14 16 18 20
approaches to perform these simulations are varied, but in most 768
Generated Single Units
cases they comprise the activity of a few units superimposed to 769
(b) some background noise. A recent work by Camuñas-Mesa and 770
20 Misses Quian Quiroga (2013) went a step beyond and provided a more 771
14 location and size of the recording electrodes. The 3D nature of the 775
12
model also provides a perfect frame for the study of algorithms 776
Errors
is usually evaluated in terms of the number of hits and misses it pro- 781
4
duces. In particular, we have shown that current algorithms isolate 782
2 a maximum of 8–10 units per channel, when up to 20 neurons were 783
to the fact that previous simulations considered only relatively sim- 786
Fig. 4. Spike sorting performance with increasing number of neurons. Average ple scenarios, with only a few (e.g., up to 3) neurons per recording. 787
results for 3 users of the sorting process of 95 different simulations containing We propose that new spike sorting algorithms have to deal with 788
between 2 and 20 different units (the dataset can be downloaded from http:// recordings of at least this complexity and we therefore share the 789
bioweb.me/CPGJNM2012-dataset). (a) Average number of hits. The performance
remains close to the ideal (the diagonal line) up to 5 or 6 units in the simulation.
simulated dataset used in (Pedreira et al., 2012), to test alternative 790
When the units in the simulations keep increasing, the number of units correctly approaches. The data can be downloaded from http://bioweb.me/ 791
identified by the user deviates from the ideal and points toward an asymptotic value CPGJNM2012-dataset 792
between 8 and 10 units. (b) Errors in the sorting process detailed as false posi- Going beyond the quantification of sorting accuracy in terms 793
tives (green; units sorted that do not correspond to a generated unit) and misses
of misses and false positives, some works have focused on how 794
(red; units generated that have no corresponding cluster). While the false positives
remain low for all cases, the misses follow the asymptotic line corresponding to 8 the accuracy of the sorting process affects other measures, such 795
Q7 correct units detected (dashed line at Y = X − 8). Error bars denote SEM. (For inter- as spike synchrony (Pazienti and Grün, 2006), rate code estimates 796
pretation of the references to color in this figure legend, the reader is referred to the (Ventura, 2009), and neuronal correlation (Cohen and Kohn, 2011; 797
web version of this article.) Ventura and Gerkin, 2012). Further work on this line can in turn 798
Source: Adapted from (Pedreira et al., 2012). highlight what type of sorting errors are the most detrimental 799
738 observed under anesthesia (Shoham et al., 2006). Moreover, in the computing firing rates might be different to the one associated to 801
739 human recordings it has been shown that such a low baseline activ- synchrony/coincident spiking). 802
740 ity comes together with high stimulus selectivity (Ison et al., 2011) The development of spike sorting algorithms should go hand in 803
741 and they are likely to be missed unless the right stimulus is shown hand with developments in recording techniques. Tetrodes have 804
742 during the experiment. Interestingly, some of these nearly silent been used for over 25 years and other type of polytrode configura- 805
743 neurons have been related to high level cognitive processes; for tions and silicon probes have been developed in the last 10 years 806
744 example, playing a determinant role in the formation of memories (Blanche et al., 2005; Buzsáki, 2004; Csicsvari et al., 2003), allowing 807
745 (Quian Quiroga, 2012b; Rey et al., 2014). for the simultaneous recording of neuronal activity in the various 808
746 Besides the issue of silent neurons, another factor adding to the cortical layers. In addition, large MEAs with up to thousands elec- 809
747 relatively low number of recorded neurons has to do with limi- trode sites are already starting to be used for recording in retinal 810
748 tations of current spike sorting algorithms. In fact, Pedreira et al. patches (Litke et al., 2004), cell cultures (Lambacher et al., 2011), or 811
749 (2012) evaluated the ability of spike sorting algorithms to identify brain slices (Frey et al., 2009). Furthermore, large number of chan- 812
750 a varying number of neurons (from 2 to 20) in simulated record- nels are currently used to record from local circuits in behaving 813
751 ings. Fig. 4 shows a summary of the results, where the sorting animals (Berenyi et al., 2014). The improvements in the probes’ 814
752 was performed independently and blindly by three expert oper- fabrication and the degree of integration in electronics available 815
753 ators using Wave clus (Quian Quiroga et al., 2004). For the typical nowadays have made possible a more advanced approach to elec- 816
754 number of reported neurons (up to 4) the performance of the algo- trophysiological recordings, compared to the traditional insertion 817
755 rithm was, as expected, almost perfect. Most of the units were of tungsten electrodes. In addition to the obvious advantages of 818
Please cite this article in press as: Rey, H.G., et al., Past, present and future of spike sorting techniques. Brain Res. Bull. (2015),
http://dx.doi.org/10.1016/j.brainresbull.2015.04.007
G Model
BRB 8853 1–11 ARTICLE IN PRESS
10 H.G. Rey et al. / Brain Research Bulletin xxx (2015) xxx–xxx
819 recording from far many more units within the same structure, Azami, H., Escudero, J., Darzi, A., Sanei, S., 2015. Extracellular spike detection from 879
multiple electrode array using novel intelligent filter and ensemble fuzzy deci- 880
820 new recording techniques open the door to the ability of record-
sion making. J. Neurosci. Methods 239, 129–138. 881
821 ing simultaneously from entire processing units, such as a cortical Bar-Hillel, A., Spiro, A., Stark, E., 2006. Spike sorting: Bayesian clustering of non- 882
822 column. In fact, we seem to be at the verge of a qualitative change stationary data. J. Neurosci. Methods 157, 303–316. 883
823 in terms of the number of sites from which we can simultaneously Berenyi, A., Somogyvari, Z., Nagy, A.J., Roux, L., Long, J.D., Fujisawa, S., Stark, E., 884
Leonardo, A., Harris, T.D., Buzsaki, G., 2014. Large-scale, high-density (up to 512 885
824 record, going up to thousands (Alivisatos et al., 2013; Khodagholy channels) recording of local circuits in behaving animals. J. Neurophysiol. 111, 886
825 et al., 2013, 2014). 1132–1149. 887
826 The use of large multichannel electrodes imposes, however, a Bestel, R., Daus, A.W., Thielemann, C., 2012. A novel automated spike sorting algo- 888
rithm with adaptable feature extraction. J. Neurosci. Methods 211, 168–178. 889
827 number of new challenges that need to be urgently addressed. Blanche, T.J., Spacek, M.A., Hetke, J.F., Swindale, N.V., 2005. Polytrodes: high-density 890
828 The amount of data generated from such recordings is very large, silicon electrode arrays for large-scale multiunit recording. J. Neurophysiol. 93, 891
829 and traditional feature extraction techniques for dimensionality 2987–3000. 892
Buzsáki, G., Anastassiou, C.A., Koch, C., 2012. The origin of extracellular fields and 893
830 reduction still lead to very large dimensional spaces where sorting currents—EEG, ECoG, LFP and spikes. Nat. Rev. Neurosci. 13, 407–420. 894
831 would be done (Einevoll et al., 2012). In fact, the use of hundreds or Buzsáki, G., 2004. Large-scale recording of neuronal ensembles. Nat. Neurosci. 7, 895
832 thousands of simultaneously recorded electrodes with a potentially 446–451. 896
Camuñas-Mesa, L.A., Quian Quiroga, R., 2013. A detailed and fast model of extracel-
833 small separation between them (less than 50 m) introduces large 897
lular recordings. Neural Comput. 25, 1191–1212. 898
834 amounts of redundancy and complementary information. The key Claverol-Tinture, E., Nadasdy, Z., 2004. Intersection of microwire electrodes with 899
835 issue in this respect is how to select, separate and combine infor- proximal CA1 stratum-pyramidale neurons at insertion for multiunit recordings 900
predicted by a 3-D computer model. IEEE Trans. Biomed. Eng. 51, 2211–2216. 901
836 mation from the different channels, an issue that is only starting
Cohen, M.R., Kohn, A., 2011. Measuring and interpreting neuronal correlations. Nat. 902
837 to be addressed (Ekanadham et al., 2014; Kadir et al., 2014; Pillow Neurosci. 14, 811–819. 903
838 et al., 2013; Swindale and Spacek, 2014). Csicsvari, J., Henze, D.A., Jamieson, B., Harris, K.D., Sirota, A., Bartho, P., Wise, K.D., 904
839 Another topic of large interest to the neuroscience community Buzsaki, G., 2003. Massively parallel recording of unit and local field potentials 905
with silicon-based electrodes. J. Neurophysiol. 90, 1314–1323. 906
840 is how to develop spike sorting algorithms on a low power chip, Csicsvari, J., Hirase, H., Czurko, A., Mamiya, A., Buzsaki, G., 1999. Oscillatory coupling 907
841 to enable wireless transmission of the data and more ecological of hippocampal pyramidal cells and interneurons in the behaving rat. J. Neurosci. 908
842 and secure conditions to perform experiments with animals. In this 19, 274–287. 909
Einevoll, G.T., Franke, F., Hagen, E., Pouzat, C., Harris, K.D., 2012. Towards reliable 910
843 respect, we have described, on the one hand, the minimum signal spike-train recordings from thousands of neurons with multielectrodes. Curr. 911
844 requirements to achieve a reasonable sorting performance (reduc- Opin. Neurobiol. 22, 11–17. 912
845 ing about 85% the data processing needs) and, on the other hand, Ekanadham, C., Tranchina, D., Simoncelli, E.P., 2014. A unified framework and 913
method for automatic neural spike identification. J. Neurosci. Methods 222, 914
846 a hybrid strategy to perform an online spike sorting on-chip via 47–55. 915
847 template matching. On-chip data processing together with wireless Fee, M.S., Mitra, P.P., Kleinfeld, D., 1996. Automatic sorting of multiple unit neuronal 916
848 transmission of the results is important for long term recordings in signals in the presence of anisotropic and non-Gaussian variability. J. Neurosci. 917
Methods 69, 175–188. 918
849 the context of experiments to study sleep (e.g., memory consolida-
Franke, F., Jäckel, D., Dragas, J., Müller, J., Radivojevic, M., Bakkum, D., Hierlemann, A., 919
850 tion), to continuously monitor neural activity for clinical purposes 2012. High-density microelectrode array recordings and real-time spike sorting 920
851 (e.g., epilepsy), or BMIs that are starting to be used in clinical tri- for closed-loop experiments: an emerging technology to study neural plasticity. 921
Front. Neural Circuits, 6. 922
852 als with human patients (Homer et al., 2013). In this sense, it is
Fraser, G.W., Chase, S.M., Whitford, A., Schwartz, A.B., 2009. Control of a 923
853 also important to provide spike sorting algorithms with tools that brain–computer interface without spike sorting. J. Neural Eng. 6, 055004. 924
854 would help tracking neurons over long periods of time (Vaidya et al., Frey, U., Egert, U., Heer, F., Hafizovic, S., Hierlemann, A., 2009. Microelectronic system 925
855 2014). for high-resolution mapping of extracellular electric fields applied to brain slices. 926
Biosens. Bioelectron. 24, 2191–2198. 927
856 Summarizing, progress in neuroscience depends on the simul- Ganguly, K., Dimitrov, D.F., Wallis, J.D., Carmena, J.M., 2011. Reversible large-scale 928
857 taneous recording of large neural populations. This is within reach modification of cortical networks during neuroprosthetic control. Nat. Neurosci. 929
858 with technological advances in the design of new electrode probes 14, 662–667. 930
Gerstein, G.L., Clark, W.A., 1964. Simultaneous studies of firing patterns in several 931
859 and acquisition systems, and cries out for the development of neurons. Science 143, 1325–1327. 932
860 relatively fast, multichannel and fully automatic spike sorting tech- Gold, C., Henze, D.A., Koch, C., 2007. Using extracellular action potential recordings 933
861 niques to cope with the recorded data. to constrain compartmental models. J. Comput. Neurosci. 23, 39–58. 934
Gold, C., Henze, D.A., Koch, C., Buzsaki, G., 2006. On the origin of the extra- 935
cellular action potential waveform. A modeling study. J. Neurophysiol. 95, 936
3113–3128. 937
862 Conflict of interest Gray, C.M., Maldonado, P.E., Wilson, M., McNaughton, B., 1995. Tetrodes markedly 938
improve the reliability and yield of multiple single-unit isolation from multi-unit 939
863 The authors declare that there are no conflicts of interest. recordings in cat striate cortex. J. Neurosci. Methods 63, 43–54. 940
Harris, K.D., Henze, D.A., Csicsvari, J., Hirase, H., Buzsaki, G., 2000. Accuracy of tetrode 941
spike separation as determined by simultaneous intracellular and extracellular 942
measurements. J. Neurophysiol. 84, 401–414. 943
864 Acknowledgements Henze, D.A., Borhegyi, Z., Csicsvari, J., Mamiya, A., Harris, K.D., Buzsaki, G., 2000. 944
Intracellular features predicted by extracellular recordings in the hippocampus 945
in vivo. J. Neurophysiol. 84, 390–400. 946
Q3
865 This work was supported by a grant from the Medical Research Hill, D.N., Mehta, S.B., Kleinfeld, D., 2011. Quality metrics to accompany spike sorting 947
866 Council (G1002100), Engineering and Physical Sciences Research of extracellular signals. J. Neurosci. 31, 8699–8705. 948
867 Council (EP/H051651/1) and the Welcome Trust. Hines, M.L., Carnevale, N.T., 1997. The NEURON simulation environment. Neural 949
Comput. 9, 1179–1209. 950
Homer, M.L., Nurmikko, A.V., Donoghue, J.P., Hochberg, L.R., 2013. Sensors and 951
decoding for intracortical brain computer interfaces. Annu. Rev. Biomed. Eng. 952
868 References 15, 383–405. 953
Hulata, E., Segev, R., Ben-Jacob, E., 2002. A method for spike sorting and detec- 954
869 Abeles, M., Goldstein Jr., M.H., 1977. Multispike train analysis. Proc IEEE 65, 762–773. tion based on wavelet packets and Shannon’s mutual information. J. Neurosci. 955
870 Alivisatos, A.P., Andrews, A.M., Boyden, E.S., Chun, M., Church, G.M., Deisseroth, K., Methods 117, 1–12. 956
871 Donoghue, J.P., Fraser, S.E., Lippincott-Schwartz, J., Looger, L.L., 2013. Nanotools Ison, M.J., Mormann, F., Cerf, M., Koch, C., Fried, I., Quiroga, R.Q., 2011. Selectiv- 957
872 for neuroscience and brain activity mapping. ACS Nano 7, 1850–1866. ity of pyramidal cells and interneurons in the human medial temporal lobe. J. 958
873 Anastassiou, C., Perin, R., Buzsaki, G., Markram, H., Koch, C., 2013. Cell-type- and Neurophysiol. 106, 1713–1721. 959
874 activity-dependent extracellular correlates of intracellular spiking: Whole-cell Kadir, S.N., Goodman, D.F.M., Harris, K.D., 2014. High-dimensional cluster analysis 960
875 multi-patch slice recordings with silicon probes. In: SFN Annual Meeting, (Pro- with the masked EM algorithm. Neural Comput. 26, 2379–2394. 961
876 gram# 326.15). Khodagholy, D., Gelinas, J.N., Thesen, T., Doyle, W., Devinsky, O., Malliaras, G.G., 962
877 Ankerst, M., Breunig, M.M., Kriegel, H., Sander, J., 1999. Optics: Ordering Points to Buzsáki, G., 2014. NeuroGrid: recording action potentials from the surface of 963
878 Identify the Clustering Structure, 28., pp. 49–60. the brain. Nat. Neurosci. 964
Please cite this article in press as: Rey, H.G., et al., Past, present and future of spike sorting techniques. Brain Res. Bull. (2015),
http://dx.doi.org/10.1016/j.brainresbull.2015.04.007
G Model
BRB 8853 1–11 ARTICLE IN PRESS
H.G. Rey et al. / Brain Research Bulletin xxx (2015) xxx–xxx 11
965 Khodagholy, D., Doublet, T., Quilichini, P., Gurfinkel, M., Leleux, P., Ghestem, A., Quian Quiroga, R., 2012a. Spike sorting. Curr. Biol. 22, R45–R46. 1024
966 Ismailova, E., Hervé, T., Sanaur, S., Bernard, C., 2013. In vivo recordings of brain Quian Quiroga, R., 2012b. Concept cells: the building blocks of declarative memory 1025
967 activity using organic transistors. Nat. Commun. 4, 1575. functions. Nat. Rev. Neurosci. 13, 587–597. 1026
968 Kloosterman, F., Layton, S.P., Chen, Z., Wilson, M.A., 2014. Bayesian decoding using Quian Quiroga, R., 2007. Spike sorting. Scholarpedia 2, 3583. 1027
969 unsorted spikes in the rat hippocampus. J. Neurophysiol. 111, 217–227. Quian Quiroga, R., Reddy, L., Koch, C., Fried, I., 2007. Decoding visual inputs from 1028
970 Lambacher, A., Vitzthum, V., Zeitler, R., Eickenscheidt, M., Eversmann, B., Thewes, multiple neurons in the human temporal lobe. J. Neurophysiol. 98, 1997–2007. 1029
971 R., Fromherz, P., 2011. Identifying firing mammalian neurons in networks with Quian Quiroga, R., Nadasdy, Z., Ben-Shaul, Y., 2004. Unsupervised spike detection 1030
972 high-resolution multi-transistor array (MTA). Appl. Phys. A 102, 1–11. and sorting with wavelets and superparamagnetic clustering. Neural Comput. 1031
973 Lewicki, M.S., 1998. A review of methods for spike sorting: the detection and classi- 16, 1661–1687. 1032
974 fication of neural action potentials. Network: Comput Neural Syst. 9, R53–R78. Redish, A.D., Battaglia, F.P., Chawla, M.K., Ekstrom, A.D., Gerrard, J.L., Lipa, P., Rosen- 1033
975 Lewicki, M.S., 1994. Bayesian modeling and classification of neural signals. Neural zweig, E.S., Worley, P.F., Guzowski, J.F., McNaughton, B.L., 2001. Independence 1034
976 Comput. 6, 1005–1030. of firing correlates of anatomically proximate hippocampal pyramidal cells. J. 1035
977 ˛
Lindén, H., Hagen, E., Łeski, S., Norheim, E.S., Pettersen, K.H., Einevoll, G.T., 2014. Neurosci. 21, RC134. 1036
978 LFPy: a tool for biophysical simulation of extracellular potentials generated by Rey, H.G., Ison, M.J., Pedreira, C., Valentin, A., Alarcon, G., Selway, R., Richardson, M.P., 1037
979 detailed model neurons. Front. Neuroinform., 7. Quian Quiroga, R., 2014. Single cell recordings in the human medial temporal 1038
980 Litke, A., Bezayiff, N., Chichilnisky, E., Cunningham, W., Dabrowski, W., Grillo, A., lobe. J. Anat., http://dx.doi.org/10.1111/joa.12228 (in press). 1039
981 Grivich, M., Grybos, P., Hottowy, P., Kachiguine, S., 2004. What does the eye Rutishauser, U., Schuman, E.M., Mamelak, A.N., 2006. Online detection and sorting 1040
982 tell the brain?: development of a system for the large-scale recording of retinal of extracellularly recorded action potentials in human medial temporal lobe 1041
983 output activity. IEEE Trans. Nucl. Sci. 51, 1434–1440. recordings, in vivo. J. Neurosci. Methods 154, 204–224. 1042
984 Mallat, S., 1999. A Wavelet Tour of Signal Processing. Academic Press. Schmitzer-Torbert, N., Jackson, J., Henze, D., Harris, K., Redish, A., 2005. Quantitative 1043
985 Marre, O., Amodei, D., Deshmukh, N., Sadeghi, K., Soo, F., Holy, T.E., Berry II, M.J., measures of cluster quality for use in extracellular recordings. Neuroscience 131, 1044
986 2012. Mapping a complete neural population in the retina. J. Neurosci. 32, 1–11. 1045
987 14859–14873. Schneider, J., Vlachos, M., 2013. Fast Parameterless Density-Based Clustering via 1046
988 Martinez, J., Pedreira, C., Ison, M.J., Quian Quiroga, R., 2009. Realistic simulation of Random Projections., pp. 861–866. 1047
989 extracellular recordings. J. Neurosci. Methods 184, 285–293. Schwarz, D.A., Lebedev, M.A., Hanson, T.L., Dimitrov, D.F., Lehew, G., Meloy, J., 1048
990 Moffitt, M.A., McIntyre, C.C., 2005. Model-based analysis of cortical recording with Rajangam, S., Subramanian, V., Ifft, P.J., Li, Z., 2014. Chronic, wireless recordings 1049
991 silicon microelectrodes. Clin. Neurophysiol. 116, 2240–2250. of large-scale brain activity in freely moving rhesus monkeys. Nat. Methods. Q5 1050
992 Navajas, J., Barsakcioglu, D.Y., Eftekhar, A., Jackson, A., Constandinou, T.G., Quian Schwarz, G., 1978. Estimating the dimension of a model. Ann. Stat. 6, 461–464. 1051
993 Quiroga, R., 2014. Minimum requirements for accurate and efficient real-time Shoham, S., O’Connor, D.H., Segev, R., 2006. How silent is the brain: is there a dark 1052
994 on-chip spike sorting. J. Neurosci. Methods 230, 51–64. matter problem in neuroscience? J. Compar. Physiol. A. 192, 777–784. 1053
995 Nenadic, Z., Burdick, J.W., 2005. Spike detection using the continuous wavelet trans- Shoham, S., Fellows, M.R., Normann, R.A., 2003. Robust, automatic spike sorting using 1054
996 form. IEEE Trans. Biomed. Eng. 52, 74–87. mixtures of multivariate t-distributions. J. Neurosci. Methods 127, 111–122. 1055
997 Nicolelis, M.A., Lebedev, M.A., 2009. Principles of neural ensemble physiology under- Stevenson, I.H., Kording, K.P., 2011. How advances in neural recording affect data 1056
998 lying the operation of brain–machine interfaces. Nat. Rev. Neurosci. 10, 530–540. analysis. Nat. Neurosci. 14, 139–142. 1057
999 Nongpiur, R.C., Shpak, D.J., Antoniou, A., 2013. Improved design method for nearly Swindale, N.V., Spacek, M.A., 2014. Spike sorting for polytrodes: a divide and conquer 1058
1000 linear-phase IIR filters using constrained optimization. IEEE Trans. Signal Pro- approach. Front. Syst. Neurosci. 8. 1059
1001 cess. 61, 895–906. Takahashi, S., Anzai, Y., Sakurai, Y., 2003. Automatic sorting for multi-neuronal activ- 1060
1002 Oppenheim, A.V., Schafer, R.W., Buck, J.R., 1989. Discrete-Time Signal Processing, ity recorded with tetrodes in the presence of overlapping spikes. J. Neurophysiol. 1061
1003 vol. 2. Prentice-Hall, Englewood Cliffs. 89, 2245–2258. 1062
1004 Ott, T., Kern, A., Steeb, W., Stoop, R., 2005. Sequential clustering: tracking down the Takekawa, T., Isomura, Y., Fukai, T., 2010. Accurate spike sorting for multi-unit 1063
1005 most natural clusters. J. Stat. Mech.: Theory Exp. 2005, P11014. recordings. Eur. J. Neurosci. 31, 263–272. 1064
1006 Paraskevopoulou, S.E., Constandinou, T.G., 2011. A Sub-1 W Neural Spike-Peak Todorova, S., Sadtler, P., Batista, A., Chase, S., Ventura, V., 2014. To sort or not to sort: 1065
Q4
1007 Detection and Spike-Count Rate Encoding Circuit., pp. 29–32. the impact of spike-sorting on neural decoding performance. J. Neural Eng. 11, 1066
1008 Pazienti, A., Grün, S., 2006. Robustness of the significance of spike synchrony with 056005. 1067
1009 respect to sorting errors. J. Comput. Neurosci. 21, 329–342. Vaidya, M., Dickey, A., Best, M.D., Coles, J., Balasubramanian, K., Suminski, A.J., 1068
1010 Pedreira, C., Martinez, J., Ison, M.J., Quian Quiroga, R., 2012. How many neurons can Hatsopoulos, N.G., 2014. Ultra-long term stability of single units using chron- 1069
1011 we see with current spike sorting algorithms? J. Neurosci. Methods 211, 58–65. ically implanted multielectrode arrays. Conf. Proc. IEEE Eng. Med. Biol. Soc., Q6 1070
1012 Pillow, J.W., Shlens, J., Chichilnisky, E., Simoncelli, E.P., 2013. A model-based spike 4872–4875. 1071
1013 sorting algorithm for removing correlation artifacts in multi-neuron recordings. Ventura, V., Gerkin, R.C., 2012. Accurately estimating neuronal correlation requires 1072
1014 PLOS ONE 8, e62123. a new spike-sorting paradigm. Proc. Natl. Acad. Sci. U. S. A. 109, 7230–7235. 1073
1015 Pouzat, C., Mazor, O., Laurent, G., 2002. Using noise signature to optimize spike- Ventura, V., 2009. Traditional waveform based spike sorting yields biased rate code 1074
1016 sorting and to assess neuronal classification quality. J. Neurosci. Methods 122, estimates. Proc. Natl. Acad. Sci. U. S. A. 106, 6921–6926. 1075
1017 43–57. Wehr, M., Pezaris, J.S., Sahani, M., 1999. Simultaneous paired intracellular and 1076
1018 Powell, S.R., Chau, P.M., 1991. A technique for realizing linear phase IIR filters. IEEE tetrode recordings for evaluating the performance of spike sorting algorithms. 1077
1019 Trans. Signal Process. 39, 2425–2435. Neurocomputing 26, 1061–1068. 1078
1020 Prentice, J.S., Homann, J., Simmons, K.D., Tkačik, G., Balasubramanian, V., Nelson, Wood, F., Black, M.J., 2008. A nonparametric Bayesian alternative to spike sorting. J. 1079
1021 P.C., 2011. Fast, scalable, Bayesian spike identification for multi-electrode arrays. Neurosci. Methods 173, 1–12. 1080
1022 PLoS ONE 6, e19884. Yin, M., Borton, D.A., Komar, J., Agha, N., Lu, Y., Li, H., Laurens, J., Lang, Y., Li, Q., Bull, 1081
1023 Quian Quiroga, R., 2009. What is the real shape of extracellular spikes? J. Neurosci. C., 2014. Wireless neurosensor for full-spectrum electrophysiology recordings 1082
Methods 177, 194–198. during free behavior. Neuron. 1083
Please cite this article in press as: Rey, H.G., et al., Past, present and future of spike sorting techniques. Brain Res. Bull. (2015),
http://dx.doi.org/10.1016/j.brainresbull.2015.04.007