A model-based spike sorting algorithm for removing correlation artifacts in multi-neuron recordings

Comparative analysis of spike-sorters in large-scale brainstem recordings

Recent technological advancements in high-density multi-channel electrodes have made it possible to record large numbers of neurons from previously inaccessible regions. While the performance of automated spike-sorters has been assessed in recordings from cortex, dentate gyrus, and thalamus, the most effective and efficient approach for spike-sorting can depend on the target region due to differing morphological and physiological characteristics. We therefore assessed the performance of five commonly used sorting packages, Kilosort3, MountainSort5, Tridesclous, SpyKING CIRCUS, and IronClust, in recordings from the rostral ventromedial medulla, a region that has been characterized using single-electrode recordings but that is essentially unexplored at the high-density network level. As demonstrated in other brain regions, each sorter produced unique results. Manual curation preferentially eliminated units detected by only one sorter. Kilosort3 and IronClust required the least curation while maintaining the largest number of units, whereas SpyKING CIRCUS and MountainSort5 required substantial curation. Tridesclous consistently identified the smallest number of units. Nonetheless, all sorters successfully identified classically defined RVM physiological cell types. These findings suggest that while the level of manual curation needed may vary across sorters, each can extract meaningful data from this deep brainstem site.

A fully automatic multichannel neural spike sorting algorithm with spike reduction and positional feature

Objective: The sorting of neural spike data recorded by multichannel and high channel neural probes such as Neuropixels, especially in real-time, remains a significant technical challenge. Most neural spike sorting algorithms focus on sorting neural spikes post-hoc for high sorting accuracy-but reducing the processing delay for fast sorting, potentially even live sorting, is generally not possible with these algorithms.Approach: Here we report our Graph nEtwork Multichannel sorting (GEMsort) algorithm, which is largely based on graph network, to allow rapid neural spike sorting for multiple neural recording channels. This was accomplished by two innovations: In GEMsort, duplicated neural spikes recorded from multiple channels were eliminated from duplicate channels by only selecting the highest amplitude neural spike in any channel for subsequent processing. In addition, the channel from which the representative neural spike was recorded was used as an additional feature to differentiate between neural spikes recorded from different neurons having similar temporal features.Main results: Synthetic and experimentally recorded multichannel neural recordings were used to evaluate the sorting performance of GEMsort. The sorting results of GEMsort were also compared with two other state-of-the-art sorting algorithms (Kilosort and Mountainsort) in sorting time and sorting agreements.Significance: GEMsort allows rapidly sort neural spikes and is highly suitable to be implemented with digital circuitry for high processing speed and channel scalability.

Inference of monosynaptic connections from parallel spike trains: A review

This article presents a mini-review about the progress in inferring monosynaptic connections from spike trains of multiple neurons over the past twenty years. First, we explain a variety of meanings of "neuronal connectivity" in different research areas of neuroscience, such as structural connectivity, monosynaptic connectivity, and functional connectivity. Among these, we focus on the methods used to infer the monosynaptic connectivity from spike data. We then summarize the inference methods based on two main approaches, i.e., correlation-based and model-based approaches. Finally, we describe available source codes for connectivity inference and future challenges. Although inference will never be perfect, the accuracy of identifying the monosynaptic connections has improved dramatically in recent years due to continuous efforts.

Harnessing Fungi Signaling in Living Composites

Signaling pathways in fungi offer a profound avenue for harnessing cellular communication and have garnered considerable interest in biomaterial engineering. Fungi respond to environmental stimuli through intricate signaling networks involving biochemical and electrical pathways, yet deciphering these mechanisms remains a challenge. In this review, an overview of fungal biology and their signaling pathways is provided, which can be activated in response to external stimuli and direct fungal growth and orientation. By examining the hyphal structure and the pathways involved in fungal signaling, the current state of recording fungal electrophysiological signals as well as the landscape of fungal biomaterials is explored. Innovative applications are highlighted, from sustainable materials to biomonitoring systems, and an outlook on the future of harnessing fungi signaling in living composites is provided.

Decomposition strategy for surface EMG with few channels: a simulation study

Objective.In the specific use of electromyogram (EMG) driven prosthetics, the user's disability reduces the space available for the electrode array. We propose a framework for EMG decomposition adapted to the condition of a few channels (less than 30 observations), which can elevate the potential of prosthetics in terms of cost and applicability.Approach.The new framework contains a peel-off approach, a refining strategy for motor unit (MU) spike train and MU action potential and a re-subtracting strategy to adapt the framework to few channels environments. Simulated EMG signals were generated to test the framework. In addition, we quantify and analyze the effect of strategies used in the framework.Main results.The results show that the new algorithm has an average improvement of 19.97% in the number of MUs identified compared to the control algorithm. Quantitative analysis of the usage strategies shows that the re-subtracting and refining strategies can effectively improve the performance of the framework under the condition of few channels.Significance.These prove that the new framework can be applied to few channel conditions, providing a optimization space for neural interface design in cost and user adaptation.

Automatical Spike Sorting With Low-Rank and Sparse Representation

Spikesorting is crucial in studying neural individually and synergistically encoding and decoding behaviors. However, existent spike sorting algorithms perform unsatisfactorily in real scenarios where heavy noises and overlapping samples are commonly in the spikes, and the spikes from different neurons are similar. To address such challenging scenarios, we propose an automatic spike sporting method in this paper, which integrally combines low-rank and sparse representation (LRSR) into a unified model. In particular, LRSR models spikes through low-rank optimization, uncovering global data structure for handling similar and overlapped samples. To eliminate the influence of the embedded noises, LRSR uses a sparse constraint, effectively separating spikes from noise. The optimization is solved using alternate augmented Lagrange multipliers methods. Moreover, we conclude with an automatic spike-sorting framework that employs the spectral clustering theorem to estimate the number of neurons. Extensive experiments over various simulated and real-world datasets demonstrate that our proposed method, LRSR, can handle spike sorting effectively and efficiently.

Spike sorting with Kilosort4

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, made complicated by the nonstationarity of the recordings and the dense overlap in electrical fields between nearby neurons. To address the spike-sorting problem, we have been openly developing the Kilosort framework. Here we describe the various algorithmic steps introduced in different versions of Kilosort. We also report the development of Kilosort4, a version with substantially improved performance due to clustering algorithms inspired by graph-based approaches. To test the performance of Kilosort, we developed a realistic simulation framework that uses densely sampled electrical fields from real experiments to generate nonstationary spike waveforms and realistic noise. We found that nearly all versions of Kilosort outperformed other algorithms on a variety of simulated conditions and that Kilosort4 performed best in all cases, correctly identifying even neurons with low amplitudes and small spatial extents in high drift conditions.

Spike sorting in the presence of stimulation artifacts: a dynamical control systems approach

Objective. Bi-directional electronic neural interfaces, capable of both electrical recording and stimulation, communicate with the nervous system to permit precise calibration of electrical inputs by capturing the evoked neural responses. However, one significant challenge is that stimulation artifacts often mask the actual neural signals. To address this issue, we introduce a novel approach that employs dynamical control systems to detect and decipher electrically evoked neural activity despite the presence of electrical artifacts.Approach. Our proposed method leverages the unique spatiotemporal patterns of neural activity and electrical artifacts to distinguish and identify individual neural spikes. We designed distinctive dynamical models for both the stimulation artifact and each neuron observed during spontaneous neural activity. We can estimate which neurons were active by analyzing the recorded voltage responses across multiple electrodes post-stimulation. This technique also allows us to exclude signals from electrodes heavily affected by stimulation artifacts, such as the stimulating electrode itself, yet still accurately differentiate between evoked spikes and electrical artifacts.Main results. We applied our method to high-density multi-electrode recordings from the primate retina in anex vivosetup, using a grid of 512 electrodes. Through repeated electrical stimulations at varying amplitudes, we were able to construct activation curves for each neuron. The curves obtained with our method closely resembled those derived from manual spike sorting. Additionally, the stimulation thresholds we estimated strongly agreed with those determined through manual analysis, demonstrating high reliability (R2=0.951for human 1 andR2=0.944for human 2).Significance. Our method can effectively separate evoked neural spikes from stimulation artifacts by exploiting the distinct spatiotemporal propagation patterns captured by a dense, large-scale multi-electrode array. This technique holds promise for future applications in real-time closed-loop stimulation systems and for managing multi-channel stimulation strategies.

Enhanced Dynamic Surface EMG Decomposition Using the Non-Negative Matrix Factorization and Three-Dimensional Motor Unit Localization

OBJECTIVE

Surface electromyography (sEMG) signal decomposition is of great importance in examining neuromuscular diseases and neuromuscular research, especially dynamic sEMG decomposition is even more technically challenging.

METHODS

A novel two-step sEMG decomposition approach was developed. The linear minimum mean square error estimation was first employed to extract estimated firing trains (EFTs) from the eigenvector matrices constructed using the non-negative matrix factorization (NMF). The firing instants of each EFT were then classified into motor units (MUs) according to their specific three-dimensional (3D) space position. The performance of the proposed approach was evaluated using simulated and experimentally recorded sEMG.

RESULTS

The simulation results demonstrated that the proposed approach can reconstruct MUAPTs with true positive rates of 89.12 ± 2.71%, 94.34 ± 1.85% and 95.45 ± 2.11% at signal-to-noise ratios of 10, 20, and 30 dB, respectively. The experimental results also demonstrated a high decomposition accuracy of 90.13 ± 1.31% in the two-source evaluation, and a high accuracy of 91.86 ± 1.14% in decompose-synthesize-decompose- compare evaluation.

CONCLUSIONS

The adoption of NMF reduces the dimension of random pattern under the restriction of non-negativity, as well as keeps the information unchanged as much as possible. The 3D space information of MUs enhances the classification accuracy by tackling the issue of relative movements between MUs and electrodes during dynamic contractions. The accuracy achieved in this study demonstrates the good performance and reliability of the proposed decomposition algorithm in dynamic surface EMG decomposition.

SIGNIFICANCE

The spatiotemporal information is applied to the dynamic surface EMG decomposition.

Online Decomposition of Surface Electromyogram Into Individual Motor Unit Activities Using Progressive FastICA Peel-Off

Surface electromyogram (SEMG) decomposition provides a promising tool for decoding and understanding neural drive information non-invasively. In contrast to previous SEMG decomposition methods mainly developed in offline conditions, there are few studies on online SEMG decomposition. A novel method for online decomposition of SEMG data is presented using the progressive FastICA peel-off (PFP) method. The proposed online method utilized a two-stage approach, consisting of an offline prework stage for initializing high-quality separation vectors through the offline PFP algorithm, and an online decomposition stage for estimating source signals of different motor units by applying these vectors to the input SEMG data stream. Specifically, a new successive multi-threshold Otsu algorithm was developed in the online stage for determining each motor unit spike train (MUST) precisely with fast and simple computations (to replace a time-consuming iterative threshold setting in the original PFP method). The performance of the proposed online SEMG decomposition method was evaluated by both simulation and experimental approaches. When processing simulated SEMG data, the online PFP method achieved a decomposition accuracy of 97.37%, superior to that (95.1%) of an online method with a traditional k-means clustering algorithm for MUST extraction. Our method was also found to achieve superior performance at higher noise levels. For decomposing experimental SEMG data, the online PFP method was able to extract an average of 12.00 ± 3.46 MUs per trial, with a matching rate of 90.38%, with respect to the expert-guided offline decomposition results. Our study provides a valuable way of online decomposition of SEMG data with advanced applications in movement control and health.

Rate versus synchrony codes for cerebellar control of motor behavior

Information transmission between neural populations could occur through either coordinated changes in firing rates or the precise transmission of spike timing. We investigate the code for information transmission from a part of the cerebellar cortex that is crucial for the accurate execution of a quantifiable motor behavior. Simultaneous recordings from Purkinje cell pairs in the cerebellum of rhesus macaques reveal how these cells coordinate their activity to drive smooth pursuit eye movements. Purkinje cells show millisecond-scale coordination of spikes (synchrony), but the level of synchrony is small and insufficient to impact the firing of downstream vestibular nucleus neurons. Analysis of previous metrics that purported to reveal Purkinje cell synchrony demonstrates that these metrics conflate changes in firing rate and neuron-neuron covariance. We conclude that the output of the cerebellar cortex uses primarily a rate rather than a synchrony code to drive the activity of downstream neurons and thus control motor behavior.

Rate versus synchrony codes for cerebellar control of motor behavior

Control of movement requires the coordination of multiple brain areas, each containing populations of neurons that receive inputs, process these inputs via recurrent dynamics, and then relay the processed information to downstream populations. Information transmission between neural populations could occur through either coordinated changes in firing rates or the precise transmission of spike timing. We investigate the nature of the code for transmission of signals to downstream areas from a part of the cerebellar cortex that is crucial for the accurate execution of a quantifiable motor behavior. Simultaneous recordings from Purkinje cell pairs in the cerebellar flocculus of rhesus macaques revealed how these cells coordinate their activity to drive smooth pursuit eye movements. Purkinje cells show millisecond-scale coordination of spikes (synchrony), but the level of synchrony is small and likely insufficient to impact the firing of downstream neurons in the vestibular nucleus. Further, analysis of previous metrics for assaying Purkinje cell synchrony demonstrates that these metrics conflate changes in firing rate and neuron-neuron covariance. We conclude that the output of the cerebellar cortex uses primarily a rate code rather than synchrony code to drive activity of downstream neurons and thus control motor behavior.

IMPACT STATEMENT

Information transmission in the brain can occur via changes in firing rate or via the precise timing of spikes. Simultaneous recordings from pairs of Purkinje cells in the floccular complex reveals that information transmission out of the cerebellar cortex relies almost exclusively on changes in firing rates rather than millisecond-scale coordination of spike timing across the Purkinje cell population.

How Do Spike Collisions Affect Spike Sorting Performance?

Recently, a new generation of devices have been developed to record neural activity simultaneously from hundreds of electrodes with a very high spatial density, both for in vitro and in vivo applications. While these advances enable to record from many more cells, they also challenge the already complicated process of spike sorting (i.e., extracting isolated single-neuron activity from extracellular signals). In this work, we used synthetic ground-truth recordings with controlled levels of correlations among neurons to quantitatively benchmark the performance of state-of-the-art spike sorters focusing specifically on spike collisions. Our results show that while modern template-matching-based algorithms are more accurate than density-based approaches, all methods, to some extent, failed to detect synchronous spike events of neurons with similar extracellular signals. Interestingly, the performance of the sorters is not largely affected by the spiking activity in the recordings, with respect to average firing rates and spike-train correlation levels. Since the performances of all modern spike sorting algorithms can be affected as function of the activity of the recorded neurons, scientific claims on correlations and synchrony should be carefully assessed based on the analysis provided in this paper.

A robust spike sorting method based on the joint optimization of linear discrimination analysis and density peaks

Spike sorting is a fundamental step in extracting single-unit activity from neural ensemble recordings, which play an important role in basic neuroscience and neurotechnologies. A few algorithms have been applied in spike sorting. However, when noise level or waveform similarity becomes relatively high, their robustness still faces a big challenge. In this study, we propose a spike sorting method combining Linear Discriminant Analysis (LDA) and Density Peaks (DP) for feature extraction and clustering. Relying on the joint optimization of LDA and DP: DP provides more accurate classification labels for LDA, LDA extracts more discriminative features to cluster for DP, and the algorithm achieves high performance after iteration. We first compared the proposed LDA-DP algorithm with several algorithms on one publicly available simulated dataset and one real rodent neural dataset with different noise levels. We further demonstrated the performance of the LDA-DP method on a real neural dataset from non-human primates with more complex distribution characteristics. The results show that our LDA-DP algorithm extracts a more discriminative feature subspace and achieves better cluster quality than previously established methods in both simulated and real data. Especially in the neural recordings with high noise levels or waveform similarity, the LDA-DP still yields a robust performance with automatic detection of the number of clusters. The proposed LDA-DP algorithm achieved high sorting accuracy and robustness to noise, which offers a promising tool for spike sorting and facilitates the following analysis of neural population activity.

Detecting and correcting false transients in calcium imaging

Population recordings of calcium activity are a major source of insight into neural function. Large datasets require automated processing, but this can introduce errors that are difficult to detect. Here we show that popular time course-estimation algorithms often contain substantial misattribution errors affecting 10-20% of transients. Misattribution, in which fluorescence is ascribed to the wrong cell, arises when overlapping cells and processes are imperfectly defined or not identified. To diagnose misattribution, we develop metrics and visualization tools for evaluating large datasets. To correct time courses, we introduce a robust estimator that explicitly accounts for contaminating signals. In one hippocampal dataset, removing contamination reduced the number of place cells by 15%, and 19% of place fields shifted by over 10 cm. Our methods are compatible with other cell-finding techniques, empowering users to diagnose and correct a potentially widespread problem that could alter scientific conclusions.

Evaluation and resolution of many challenges of neural spike sorting: a new sorter

We evaluate existing spike sorters and present a new one that resolves many sorting challenges. The new sorter, called "full binary pursuit" or FBP, comprises multiple steps. First, it thresholds and clusters to identify the waveforms of all unique neurons in the recording. Second, it uses greedy binary pursuit to optimally assign all the spike events in the original voltages to separable neurons. Third, it resolves spike events that are described more accurately as the superposition of spikes from two other neurons. Fourth, it resolves situations where the recorded neurons drift in amplitude or across electrode contacts during a long recording session. Comparison with other sorters on ground-truth data sets reveals many of the failure modes of spike sorting. We examine overall spike sorter performance in ground-truth data sets and suggest postsorting analyses that can improve the veracity of neural analyses by minimizing the intrusion of failure modes into analysis and interpretation of neural data. Our analysis reveals the tradeoff between the number of channels a sorter can process, speed of sorting, and some of the failure modes of spike sorting. FBP works best on data from 32 channels or fewer. It trades speed and number of channels for avoidance of specific failure modes that would be challenges for some use cases. We conclude that all spike sorting algorithms studied have advantages and shortcomings, and the appropriate use of a spike sorter requires a detailed assessment of the data being sorted and the experimental goals for analyses.NEW & NOTEWORTHY Electrophysiological recordings from multiple neurons across multiple channels pose great difficulty for spike sorting of single neurons. We propose methods that improve the ability to determine the number of individual neurons present in a recording and resolve near-simultaneous spike events from single neurons. We use ground-truth data sets to demonstrate the pros and cons of several current sorting algorithms and suggest strategies for determining the accuracy of spike sorting when ground-truth data are not available.

A data-driven spike sorting feature map for resolving spike overlap in the feature space

Objective.Spike sorting is the process of extracting neuronal action potentials, or spikes, from an extracellular brain recording, and assigning each spike to its putative source neuron. Spike sorting is usually treated as a clustering problem. However, this clustering process is known to be affected by overlapping spikes. Existing methods for resolving spike overlap typically require an expensive post-processing of the clustering results. In this paper, we propose the design of a domain-specific feature map, which enables the resolution of spike overlap directly in the feature space.Approach.The proposed domain-specific feature map is based on a neural network architecture that is trained to simultaneously perform spike sorting and spike overlap resolution. Overlapping spikes clusters can be identified in the feature space through a linear relation with the single-neuron clusters for which the neurons contribute to the overlapping spikes. To aid the feature map training, a data augmentation procedure is presented that is based on biophysical simulations.Main results.We demonstrate the potential of our method on independent and realistic test data. We show that our novel approach for resolving spike overlap generalizes to unseen and realistic test data. Furthermore, the sorting performance of our method is shown to be similar to the state-of-the-art, but our method does not assume the availability of spike templates for resolving spike overlap.Significance.Resolving spike overlap directly in the feature space, results in an overall simplified spike sorting pipeline compared to the state-of-the-art. For the state-of-the-art, the overlapping spike snippets exhibit a large spread in the feature space and do not appear as concentrated clusters. This can lead to biased spike template estimates which affect the sorting performance of the state-of-the-art. In our proposed approach, overlapping spikes form concentrated clusters and spike overlap resolution does not depend on the availability of spike templates.

HTsort: Enabling Fast and Accurate Spike Sorting on Multi-Electrode Arrays

Spike sorting is used to classify the spikes (action potentials acquired by physiological electrodes), aiming to identify their respective firing units. Now it has been developed to classify the spikes recorded by multi-electrode arrays (MEAs), with the improvement of micro-electrode technology. However, how to improve classification accuracy and maintain low time complexity simultaneously becomes a difficulty. A fast and accurate spike sorting approach named HTsort is proposed for high-density multi-electrode arrays in this paper. Several improvements have been introduced to the traditional pipeline that is composed of threshold detection and clustering method. First, the divide-and-conquer method is employed to utilize electrode spatial information to achieve pre-clustering. Second, the clustering method HDBSCAN (hierarchical density-based spatial clustering of applications with noise) is used to classify spikes and detect overlapping events (multiple spikes firing simultaneously). Third, the template merging method is used to merge redundant exported templates according to the template similarity and the spatial distribution of electrodes. Finally, the template matching method is used to resolve overlapping events. Our approach is validated on simulation data constructed by ourselves and publicly available data and compared to other state-of-the-art spike sorters. We found that the proposed HTsort has a more favorable trade-off between accuracy and time consumption. Compared with MountainSort and SpykingCircus, the time consumption is reduced by at least 40% when the number of electrodes is 64 and below. Compared with HerdingSpikes, the classification accuracy can typically improve by more than 10%. Meanwhile, HTsort exhibits stronger robustness against background noise than other sorters. Our more sophisticated spike sorter would facilitate neurophysiologists to complete spike sorting more quickly and accurately.

Resolution of Spike Overlapping by Biogeography-Based Optimization

There are many cases in which the separation of different sources from single channel recordings is important, for example, in fluorescence spectral overlap compensation, electrical impedance signaling, intramuscular electromyogram decomposition or in the case of spike sorting of neuron potentials from microelectrode arrays (MEA). Focusing on the latter, the problem can be faced by identifying spikes emerging from the background and clustering into different groups, indicating the activity of different neurons. Problems are found when more spikes are superimposed in overlapped waveforms. We discuss the application of Biogeography-Based Optimization (BBO) to resolve this specific problem. Our algorithm is compared with three spike-sorting methods (SpyKING Circus, Common Basis Pursuit and Klusta), showing statistically better performance (in terms of F1 score, True Positive Rate—TPR and Positive Predictive Value—PPV) in resolving overlaps in realistic, simulated data. Specifically, BBO showed median F1, TPR and PPV of 100%, 100% and about 75%, respectively, considering a simulated noise with the same spectral density as the experimental one and a similar power with highly statistically significant improvements of at least two performance indexes over each of the other three tested algorithms.

A convolutional neural network for estimating synaptic connectivity from spike trains

The recent increase in reliable, simultaneous high channel count extracellular recordings is exciting for physiologists and theoreticians because it offers the possibility of reconstructing the underlying neuronal circuits. We recently presented a method of inferring this circuit connectivity from neuronal spike trains by applying the generalized linear model to cross-correlograms. Although the algorithm can do a good job of circuit reconstruction, the parameters need to be carefully tuned for each individual dataset. Here we present another method using a Convolutional Neural Network for Estimating synaptic Connectivity from spike trains. After adaptation to huge amounts of simulated data, this method robustly captures the specific feature of monosynaptic impact in a noisy cross-correlogram. There are no user-adjustable parameters. With this new method, we have constructed diagrams of neuronal circuits recorded in several cortical areas of monkeys.

Temporally precise population coding of dynamic sounds by auditory cortex

Fluctuations in the amplitude envelope of complex sounds provide critical cues for hearing, particularly for speech and animal vocalizations. Responses to amplitude modulation (AM) in the ascending auditory pathway have chiefly been described for single neurons. How neural populations might collectively encode and represent information about AM remains poorly characterized, even in primary auditory cortex (A1). We modeled population responses to AM based on data recorded from A1 neurons in awake squirrel monkeys and evaluated how accurately single trial responses to modulation frequencies from 4 to 512 Hz could be decoded as functions of population size, composition, and correlation structure. We found that a population-based decoding model that simulated convergent, equally weighted inputs was highly accurate and remarkably robust to the inclusion of neurons that were individually poor decoders. By contrast, average rate codes based on convergence performed poorly; effective decoding using average rates was only possible when the responses of individual neurons were segregated, as in classical population decoding models using labeled lines. The relative effectiveness of dynamic rate coding in auditory cortex was explained by shared modulation phase preferences among cortical neurons, despite heterogeneity in rate-based modulation frequency tuning. Our results indicate significant population-based synchrony in primary auditory cortex and suggest that robust population coding of the sound envelope information present in animal vocalizations and speech can be reliably achieved even with indiscriminate pooling of cortical responses. These findings highlight the importance of firing rate dynamics in population-based sensory coding.NEW & NOTEWORTHY Fundamental questions remain about population coding in primary auditory cortex (A1). In particular, issues of spike timing in models of neural populations have been largely ignored. We find that spike-timing in response to sound envelope fluctuations is highly similar across neuron populations in A1. This property of shared envelope phase preference allows for a simple population model involving unweighted convergence of neuronal responses to classify amplitude modulation frequencies with high accuracy.

Neuropixels 2.0: A miniaturized high-density probe for stable, long-term brain recordings

Measuring the dynamics of neural processing across time scales requires following the spiking of thousands of individual neurons over milliseconds and months. To address this need, we introduce the Neuropixels 2.0 probe together with newly designed analysis algorithms. The probe has more than 5000 sites and is miniaturized to facilitate chronic implants in small mammals and recording during unrestrained behavior. High-quality recordings over long time scales were reliably obtained in mice and rats in six laboratories. Improved site density and arrangement combined with newly created data processing methods enable automatic post hoc correction for brain movements, allowing recording from the same neurons for more than 2 months. These probes and algorithms enable stable recordings from thousands of sites during free behavior, even in small animals such as mice.

Neuropixels 2.0: A miniaturized high-density probe for stable, long-term brain recordings

Measuring the dynamics of neural processing across time scales requires following the spiking of thousands of individual neurons over milliseconds and months. To address this need, we introduce the Neuropixels 2.0 probe together with newly designed analysis algorithms. The probe has more than 5000 sites and is miniaturized to facilitate chronic implants in small mammals and recording during unrestrained behavior. High-quality recordings over long time scales were reliably obtained in mice and rats in six laboratories. Improved site density and arrangement combined with newly created data processing methods enable automatic post hoc correction for brain movements, allowing recording from the same neurons for more than 2 months. These probes and algorithms enable stable recordings from thousands of sites during free behavior, even in small animals such as mice.

Spike-sorting analysis of neural electrical signals evoked by acupuncture based on model

Acupuncturing the Zusanli (ST 36) point with different types of manual acupuncture manipulations (MAs) and different frequencies can evoke a lot of neural response activities in spinal dorsal root neurons. The action potential is the basic unit of communication in the neural response process. With the rapid development of the electrode acquisition technology, we can simultaneously obtain neural electrical signals of multiple neurons in the target area. So it is crucial to extract spike trains of each neuron from raw recorded data. To solve the problem of variability of the spike waveform, this paper adopts a optimization algorithm based on model to improve the wave-cluster algorithm, which can provide higher accuracy and reliability. Further, through this optimization algorithm, we make a statistical analysis on spike events evoked by different MAs. Results suggest that numbers of response spikes under reinforcing manipulations are far more than reducing manipulations, which mainly embody in synchronous spike activities.

Spiking Correlation Analysis of Synchronous Spikes Evoked by Acupuncture Mechanical Stimulus

Acupuncturing the ST36 acupoint can evoke the response of the sensory nervous system, which is translated into output electrical signals in the spinal dorsal root. Neural response activities, especially synchronous spike events, evoked by different acupuncture manipulations have remarkable differences. In order to identify these network collaborative activities, we analyze the underlying spike correlation in the synchronous spike event. In this paper, we adopt a log-linear model to describe network response activities evoked by different acupuncture manipulations. Then the state-space model and Bayesian theory are used to estimate network spike correlations. Two sets of simulation data are used to test the effectiveness of the estimation algorithm and the model goodness-of-fit. In addition, simulation data are also used to analyze the relationship between spike correlations and synchronous spike events. Finally, we use this method to identify network spike correlations evoked by four different acupuncture manipulations. Results show that reinforcing manipulations (twirling reinforcing and lifting-thrusting reinforcing) can evoke the third-order spike correlation but reducing manipulations (twirling reducing and lifting-thrusting reducing) does not. This is the main reason why synchronous spikes evoked by reinforcing manipulations are more abundant than reducing manipulations.

Model-based detection of putative synaptic connections from spike recordings with latency and type constraints

Detecting synaptic connections using large-scale extracellular spike recordings is a difficult statistical problem. Here, we develop an extension of a generalized linear model that explicitly separates fast synaptic effects and slow background fluctuations in cross-correlograms between pairs of neurons while incorporating circuit properties learned from the whole network. This model outperforms two previously developed synapse detection methods in the simulated networks and recovers plausible connections from hundreds of neurons in in vitro multielectrode array data.

Compatibility Evaluation of Clustering Algorithms for Contemporary Extracellular Neural Spike Sorting

Deciphering useful information from electrophysiological data recorded from the brain, in-vivo or in-vitro, is dependent on the capability to analyse spike patterns efficiently and accurately. The spike analysis mechanisms are heavily reliant on the clustering algorithms that enable separation of spike trends based on their spatio-temporal behaviors. Literature review report several clustering algorithms over decades focused on different applications. Although spike analysis algorithms employ only a small subset of clustering algorithms, however, not much work has been reported on the compliance and suitability of such clustering algorithms for spike analysis. In our study, we have attempted to comment on the suitability of available clustering algorithms and performance capacity when exposed to spike analysis. In this regard, the study reports a compatibility evaluation on algorithms previously employed in spike sorting as well as the algorithms yet to be investigated for application in sorting neural spikes. The performance of the algorithms is compared in terms of their accuracy, confusion matrix and accepted validation indices. Three data sets comprising of easy, difficult, and real spike similarity with known ground-truth are chosen for assessment, ensuring a uniform testbed. The procedure also employs two feature-sets, principal component analysis and wavelets. The report also presents a statistical score scheme to evaluate the performance individually and overall. The open nature of the data sets, the clustering algorithms and the evaluation criteria make the proposed evaluation framework widely accessible to the research community. We believe that the study presents a reference guide for emerging neuroscientists to select the most suitable algorithms for their spike analysis requirements.

SpikeForest, reproducible web-facing ground-truth validation of automated neural spike sorters

Spike sorting is a crucial step in electrophysiological studies of neuronal activity. While many spike sorting packages are available, there is little consensus about which are most accurate under different experimental conditions. SpikeForest is an open-source and reproducible software suite that benchmarks the performance of automated spike sorting algorithms across an extensive, curated database of ground-truth electrophysiological recordings, displaying results interactively on a continuously-updating website. With contributions from eleven laboratories, our database currently comprises 650 recordings (1.3 TB total size) with around 35,000 ground-truth units. These data include paired intracellular/extracellular recordings and state-of-the-art simulated recordings. Ten of the most popular spike sorting codes are wrapped in a Python package and evaluated on a compute cluster using an automated pipeline. SpikeForest documents community progress in automated spike sorting, and guides neuroscientists to an optimal choice of sorter and parameters for a wide range of probes and brain regions.

Dictionary learning in Fourier-transform scanning tunneling spectroscopy

Modern high-resolution microscopes are commonly used to study specimens that have dense and aperiodic spatial structure. Extracting meaningful information from images obtained from such microscopes remains a formidable challenge. Fourier analysis is commonly used to analyze the structure of such images. However, the Fourier transform fundamentally suffers from severe phase noise when applied to aperiodic images. Here, we report the development of an algorithm based on nonconvex optimization that directly uncovers the fundamental motifs present in a real-space image. Apart from being quantitatively superior to traditional Fourier analysis, we show that this algorithm also uncovers phase sensitive information about the underlying motif structure. We demonstrate its usefulness by studying scanning tunneling microscopy images of a Co-doped iron arsenide superconductor and prove that the application of the algorithm allows for the complete recovery of quasiparticle interference in this material.

Aperiodic structure imaging suffers limitations when utilizing Fourier analysis. The authors report an algorithm that quantitatively overcomes these limitations based on nonconvex optimization, demonstrated by studying aperiodic structures via the phase sensitive interference in STM images.

A simple linear readout of MT supports motion direction-discrimination performance

Motion discrimination is a well-established model system for investigating how sensory signals are used to form perceptual decisions. Classic studies relating single-neuron activity in the middle temporal area (MT) to perceptual decisions have suggested that a simple linear readout could underlie motion discrimination behavior. A theoretically optimal readout, in contrast, would take into account the correlations between neurons and the sensitivity of individual neurons at each time point. However, it remains unknown how sophisticated the readout needs to be to support actual motion-discrimination behavior or to approach optimal performance. In this study, we evaluated the performance of various neurally plausible decoders, trained to discriminate motion direction from small ensembles of simultaneously recorded MT neurons. We found that decoding the stimulus without knowledge of the interneuronal correlations was sufficient to match an optimal (correlation aware) decoder. Additionally, a decoder could match the psychophysical performance of the animals with flat integration of up to half the stimulus and inherited temporal dynamics from the time-varying MT responses. These results demonstrate that simple, linear decoders operating on small ensembles of neurons can match both psychophysical performance and optimal sensitivity without taking correlations into account and that such simple read-out mechanisms can exhibit complex temporal properties inherited from the sensory dynamics themselves.NEW & NOTEWORTHY Motion perception depends on the ability to decode the activity of neurons in the middle temporal area. Theoretically optimal decoding requires knowledge of the sensitivity of neurons and interneuronal correlations. We report that a simple correlation-blind decoder performs as well as the optimal decoder for coarse motion discrimination. Additionally, the decoder could match the psychophysical performance with moderate temporal integration and dynamics inherited from sensory responses.

Low-latency single channel real-time neural spike sorting system based on template matching

Recent technical advancements in neural engineering allow for precise recording and control of neural circuits simultaneously, opening up new opportunities for closed-loop neural control. In this work, a rapid spike sorting system was developed based on template matching to rapidly calculate instantaneous firing rates for each neuron in a multi-unit extracellular recording setting. Cluster templates were first generated by a desktop computer using a non-parameter spike sorting algorithm (Super-paramagnetic clustering) and then transferred to a field-programmable gate array digital circuit for rapid sorting through template matching. Two different matching techniques–Euclidean distance (ED) and correlational matching (CM)–were compared for the accuracy of sorting and the performance of calculating firing rates. The performance of the system was first verified using publicly available artificial data and was further confirmed with pre-recorded neural spikes from an anesthetized Mongolian gerbil. Real-time recording and sorting from an awake mouse were also conducted to confirm the system performance in a typical behavioral neuroscience experimental setting. Experimental results indicated that high sorting accuracies were achieved for both template-matching methods, but CM can better handle spikes with non-Gaussian spike distributions, making it more robust for in vivo recording. The technique was also compared to several other off-line spike sorting algorithms and the results indicated that the sorting accuracy is comparable but sorting time is significantly shorter than these other techniques. A low sorting latency of under 2 ms and a maximum spike sorting rate of 941 spikes/second have been achieved with our hybrid hardware/software system. The low sorting latency and fast sorting rate allow future system developments of neural circuit modulation through analyzing neural activities in real-time.

Cluster tendency assessment in neuronal spike data

Sorting spikes from extracellular recording into clusters associated with distinct single units (putative neurons) is a fundamental step in analyzing neuronal populations. Such spike sorting is intrinsically unsupervised, as the number of neurons are not known a priori. Therefor, any spike sorting is an unsupervised learning problem that requires either of the two approaches: specification of a fixed value k for the number of clusters to seek, or generation of candidate partitions for several possible values of c, followed by selection of a best candidate based on various post-clustering validation criteria. In this paper, we investigate the first approach and evaluate the utility of several methods for providing lower dimensional visualization of the cluster structure and on subsequent spike clustering. We also introduce a visualization technique called improved visual assessment of cluster tendency (iVAT) to estimate possible cluster structures in data without the need for dimensionality reduction. Experimental results are conducted on two datasets with ground truth labels. In data with a relatively small number of clusters, iVAT is beneficial in estimating the number of clusters to inform the initialization of clustering algorithms. With larger numbers of clusters, iVAT gives a useful estimate of the coarse cluster structure but sometimes fails to indicate the presumptive number of clusters. We show that noise associated with recording extracellular neuronal potentials can disrupt computational clustering schemes, highlighting the benefit of probabilistic clustering models. Our results show that t-Distributed Stochastic Neighbor Embedding (t-SNE) provides representations of the data that yield more accurate visualization of potential cluster structure to inform the clustering stage. Moreover, The clusters obtained using t-SNE features were more reliable than the clusters obtained using the other methods, which indicates that t-SNE can potentially be used for both visualization and to extract features to be used by any clustering algorithm.

Reconstructing neuronal circuitry from parallel spike trains

State-of-the-art techniques allow researchers to record large numbers of spike trains in parallel for many hours. With enough such data, we should be able to infer the connectivity among neurons. Here we develop a method for reconstructing neuronal circuitry by applying a generalized linear model (GLM) to spike cross-correlations. Our method estimates connections between neurons in units of postsynaptic potentials and the amount of spike recordings needed to verify connections. The performance of inference is optimized by counting the estimation errors using synthetic data. This method is superior to other established methods in correctly estimating connectivity. By applying our method to rat hippocampal data, we show that the types of estimated connections match the results inferred from other physiological cues. Thus our method provides the means to build a circuit diagram from recorded spike trains, thereby providing a basis for elucidating the differences in information processing in different brain regions.

Current techniques have enabled the simultaneous collection of spike train data from large numbers of neurons. Here, the authors report a method to infer the underlying neural circuit connectivity diagram based on a generalized linear model applied to spike cross-correlations between neurons.

A normalized template matching method for improving spike detection in extracellular voltage recordings

Spike sorting is the process of detecting and clustering action potential waveforms of putative single neurons from extracellular voltage recordings. Typically, spike detection uses a fixed voltage threshold and shadow period, but this approach often misses spikes during high firing rate epochs or noisy conditions. We developed a simple, data-driven spike detection method using a scaled form of template matching, based on the sliding cosine similarity between the extracellular voltage signal and mean spike waveforms of candidate single units. Performance was tested in whisker somatosensory cortex (S1) of anesthetized mice in vivo. The method consistently detected whisker-evoked spikes that were missed by the standard fixed threshold. Detection was improved most for spikes evoked by strong stimuli (40–70% increase), improved less for weaker stimuli, and unchanged for spontaneous spiking. This represents improved detection during spatiotemporally dense spiking, and yielded sharper sensory tuning estimates. We also benchmarked performance using computationally generated voltage data. Template matching detected ~85–90% of spikes compared to ~70% for the standard fixed threshold method, and was more tolerant to high firing rates and simulated recording noise. Thus, a simple template matching approach substantially improves detection of single-unit spiking for cortical physiology.

Continuing progress of spike sorting in the era of big data

Engineering efforts are currently attempting to build devices capable of collecting neural activity from one million neurons in the brain. Part of this effort focuses on developing dense multiple-electrode arrays, which require post-processing via 'spike sorting' to extract neural spike trains from the raw signal. Gathering information at this scale will facilitate fascinating science, but these dreams are only realizable if the spike sorting procedure and data pipeline are computationally scalable, at or superior to hand processing, and scientifically reproducible. These challenges are all being amplified as the data scale continues to increase. In this review, recent efforts to attack these challenges are discussed, which have primarily focused on increasing accuracy and reliability while being computationally scalable. These goals are addressed by adding additional stages to the data processing pipeline and using divide-and-conquer algorithmic approaches. These recent developments should prove useful to most research groups regardless of data scale, not just for cutting-edge devices.

Automatic spike sorting for high-density microelectrode arrays

High-density microelectrode arrays can be used to record extracellular action potentials from hundreds to thousands of neurons simultaneously. Efficient spike sorters must be developed to cope with such large data volumes. Most existing spike sorting methods for single electrodes or small multielectrodes, however, suffer from the "curse of dimensionality" and cannot be directly applied to recordings with hundreds of electrodes. This holds particularly true for the standard reference spike sorting algorithm, principal component analysis-based feature extraction, followed by k-means or expectation maximization clustering, against which most spike sorters are evaluated. We present a spike sorting algorithm that circumvents the dimensionality problem by sorting local groups of electrodes independently with classical spike sorting approaches. It is scalable to any number of recording electrodes and well suited for parallel computing. The combination of data prewhitening before the principal component analysis-based extraction and a parameter-free clustering algorithm obviated the need for parameter adjustments. We evaluated its performance using surrogate data in which we systematically varied spike amplitudes and spike rates and that were generated by inserting template spikes into the voltage traces of real recordings. In a direct comparison, our algorithm could compete with existing state-of-the-art spike sorters in terms of sensitivity and precision, while parameter adjustment or manual cluster curation was not required. NEW & NOTEWORTHY We present an automatic spike sorting algorithm that combines three strategies to scale classical spike sorting techniques for high-density microelectrode arrays: 1) splitting the recording electrodes into small groups and sorting them independently; 2) clustering a subset of spikes and classifying the rest to limit computation time; and 3) prewhitening the spike waveforms to enable the use of parameter-free clustering. Finally, we combined these strategies into an automatic spike sorter that is competitive with state-of-the-art spike sorters.

Identification of Retinal Ganglion Cell Firing Patterns Using Clustering Analysis Supplied with Failure Diagnosis

An important goal in visual neuroscience is to understand how neuronal population coding in vertebrate retina mediates the broad range of visual functions. Microelectrode arrays interface on isolated retina registers a collective measure of the spiking dynamics of retinal ganglion cells (RGCs) by probing them simultaneously and in large numbers. The recorded data stream is then processed to identify spike trains of individual RGCs by efficient and scalable spike detection and sorting routines. Most spike sorting software packages, available either commercially or as freeware, combine automated steps with judgment calls by the investigator to verify the quality of sorted spikes. This work focused on sorting spikes of RGCs into clusters using an integrated analytical platform for the data recorded during visual stimulation of wild-type mice retinas with whole field stimuli. After spike train detection, we projected each spike onto two feature spaces: a parametric space and a principal components space. We then applied clustering algorithms to sort spikes into separate clusters. To eliminate the need for human intervention, the initial clustering results were submitted to diagnostic tests that evaluated the results to detect the sources of failure in cluster assignment. This failure diagnosis formed a decision logic for diagnosable electrodes to enhance the clustering quality iteratively through rerunning the clustering algorithms. The new clustering results showed that the spike sorting accuracy was improved. Subsequently, the number of active RGCs during each whole field stimulation was found, and the light responsiveness of each RGC was identified. Our approach led to error-resilient spike sorting in both feature extraction methods; however, using parametric features led to less erroneous spike sorting compared to principal components, particularly for low signal-to-noise ratios. As our approach is reliable for retinal signal processing in response to simple visual stimuli, it could be applied to the evaluation of disrupted physiological signaling in retinal neurodegenerative diseases.

Unsupervised clustering of temporal patterns in high-dimensional neuronal ensembles using a novel dissimilarity measure

Temporally ordered multi-neuron patterns likely encode information in the brain. We introduce an unsupervised method, SPOTDisClust (Spike Pattern Optimal Transport Dissimilarity Clustering), for their detection from high-dimensional neural ensembles. SPOTDisClust measures similarity between two ensemble spike patterns by determining the minimum transport cost of transforming their corresponding normalized cross-correlation matrices into each other (SPOTDis). Then, it performs density-based clustering based on the resulting inter-pattern dissimilarity matrix. SPOTDisClust does not require binning and can detect complex patterns (beyond sequential activation) even when high levels of out-of-pattern "noise" spiking are present. Our method handles efficiently the additional information from increasingly large neuronal ensembles and can detect a number of patterns that far exceeds the number of recorded neurons. In an application to neural ensemble data from macaque monkey V1 cortex, SPOTDisClust can identify different moving stimulus directions on the sole basis of temporal spiking patterns.

Sparse Coding and Compressive Sensing for Overlapping Neural Spike Sorting

Spike sorting is one of the key techniques to understand brain activity. With the development of modern electrophysiology technology, some recent multi-electrode technologies have been able to record the activity of thousands of neuronal spikes simultaneously. In this scenario, however, the recorded activity may be the overlap of multi-neuron spikes, which will degrade the sorting performance of existing cluster-based algorithms. In this paper, we introduce methods for overlapping spike sorting. The introduced methods start from a convolution model, where a sparse vector could be obtained via sparse coding or compressive sensing. Then, we use a maximum a posteriori estimate to optimize the sparse vector, which makes the overlapped spike sorting completed successfully. The advantage of the introduced method is that it performs better than traditional methods when the waveforms of the spikes are similar. In experiments, some synthetic and real spike data are used to testify the methods. The experiment results show that the introduced methods' average sorting detection, defined as the ratio of successfully sorted spikes to the total spikes is nearly 4% higher than the traditional methods, under the condition of the experimental data with similar waveforms.

A spike sorting toolbox for up to thousands of electrodes validated with ground truth recordings in vitro and in vivo

In recent years, multielectrode arrays and large silicon probes have been developed to record simultaneously between hundreds and thousands of electrodes packed with a high density. However, they require novel methods to extract the spiking activity of large ensembles of neurons. Here, we developed a new toolbox to sort spikes from these large-scale extracellular data. To validate our method, we performed simultaneous extracellular and loose patch recordings in rodents to obtain 'ground truth' data, where the solution to this sorting problem is known for one cell. The performance of our algorithm was always close to the best expected performance, over a broad range of signal-to-noise ratios, in vitro and in vivo. The algorithm is entirely parallelized and has been successfully tested on recordings with up to 4225 electrodes. Our toolbox thus offers a generic solution to sort accurately spikes for up to thousands of electrodes.

Neural Parallel Engine: A toolbox for massively parallel neural signal processing

BACKGROUND

Large-scale neural recordings provide detailed information on neuronal activities and can help elicit the underlying neural mechanisms of the brain. However, the computational burden is also formidable when we try to process the huge data stream generated by such recordings.

NEW METHOD

In this study, we report the development of Neural Parallel Engine (NPE), a toolbox for massively parallel neural signal processing on graphical processing units (GPUs). It offers a selection of the most commonly used routines in neural signal processing such as spike detection and spike sorting, including advanced algorithms such as exponential-component-power-component (EC-PC) spike detection and binary pursuit spike sorting. We also propose a new method for detecting peaks in parallel through a parallel compact operation.

RESULTS

Our toolbox is able to offer a 5× to 110× speedup compared with its CPU counterparts depending on the algorithms. A user-friendly MATLAB interface is provided to allow easy integration of the toolbox into existing workflows.

COMPARISON WITH EXISTING METHODS

Previous efforts on GPU neural signal processing only focus on a few rudimentary algorithms, are not well-optimized and often do not provide a user-friendly programming interface to fit into existing workflows. There is a strong need for a comprehensive toolbox for massively parallel neural signal processing.

CONCLUSIONS

A new toolbox for massively parallel neural signal processing has been created. It can offer significant speedup in processing signals from large-scale recordings up to thousands of channels.

The Impact of Anesthetic State on Spike-Sorting Success in the Cortex: A Comparison of Ketamine and Urethane Anesthesia

Spike sorting is an essential first step in most analyses of extracellular in vivo electrophysiological recordings. Here we show that spike-sorting success depends critically on characteristics of coordinated population activity that can differ between anesthetic states. In tetrode recordings from mouse auditory cortex, spike sorting was significantly less successful under ketamine/medetomidine (ket/med) than urethane anesthesia. Surprisingly, this difficulty with sorting under ket/med anesthesia did not appear to result from either greater millisecond-scale burstiness of neural activity or increased coordination of activity among neighboring neurons. Rather, the key factor affecting sorting success appeared to be the amount of coordinated population activity at long time intervals and across large cortical distances. We propose that spike-sorting success is directly dependent on overall coordination of activity, and is most disrupted by large-scale fluctuations in cortical population activity. Reliability of single-unit recording may therefore differ not only between urethane-anesthetized and ket/med-anesthetized states as demonstrated here, but also between synchronized and desynchronized states, asleep and awake states, or inattentive and attentive states in unanesthetized animals.

Electrical stimulus artifact cancellation and neural spike detection on large multi-electrode arrays

Simultaneous electrical stimulation and recording using multi-electrode arrays can provide a valuable technique for studying circuit connectivity and engineering neural interfaces. However, interpreting these measurements is challenging because the spike sorting process (identifying and segregating action potentials arising from different neurons) is greatly complicated by electrical stimulation artifacts across the array, which can exhibit complex and nonlinear waveforms, and overlap temporarily with evoked spikes. Here we develop a scalable algorithm based on a structured Gaussian Process model to estimate the artifact and identify evoked spikes. The effectiveness of our methods is demonstrated in both real and simulated 512-electrode recordings in the peripheral primate retina with single-electrode and several types of multi-electrode stimulation. We establish small error rates in the identification of evoked spikes, with a computational complexity that is compatible with real-time data analysis. This technology may be helpful in the design of future high-resolution sensory prostheses based on tailored stimulation (e.g., retinal prostheses), and for closed-loop neural stimulation at a much larger scale than currently possible.

Comparison of combined spike detection and clustering using mutual information

BACKGROUND

Spike sorting techniques involve both detection of spike waveform events and classification of those events into clusters of similar waveform shape. The one existing method of evaluating the combined effects of both detection and classification depends on assignment of cluster correspondence. Other methods of evaluation have focused on either clustering or detection, but not both, although these two steps may interact.

NEW METHOD

This paper develops an information theoretic measure of agreement between the output of two spike sorting techniques, AMI_all, which can be used even when the number of waveform events detected by the two techniques differs.

RESULTS

AMI_all is shown to be a useful measure for studying variations of parameters of spike sorting techniques in two examples: comparing outputs for simulated noisy spike sorting and spike sorting of human single neuron recordings. Comparison with existing methods Computing AMI_all does not require an explicit assignment of cluster correspondence, thereby eliminating a potential source of variation. By providing a single measure of performance, computing AMI_all is very useful when comparing large numbers of algorithmic or parametric variations of spike sorting techniques; prior comparison techniques have often required multiple measures of performance which complicates large scale comparisons.

CONCLUSIONS

The use of AMI_all to measure agreement between spike sorting techniques facilitates the comparison of the outputs of those techniques, including variations in both spike detection and waveform clustering. This measure should be useful for broad based and large scale comparisons between spike sorting techniques.

Event-driven processing for hardware-efficient neural spike sorting

OBJECTIVE

The prospect of real-time and on-node spike sorting provides a genuine opportunity to push the envelope of large-scale integrated neural recording systems. In such systems the hardware resources, power requirements and data bandwidth increase linearly with channel count. Event-based (or data-driven) processing can provide here a new efficient means for hardware implementation that is completely activity dependant. In this work, we investigate using continuous-time level-crossing sampling for efficient data representation and subsequent spike processing.

APPROACH

(1) We first compare signals (synthetic neural datasets) encoded with this technique against conventional sampling. (2) We then show how such a representation can be directly exploited by extracting simple time domain features from the bitstream to perform neural spike sorting. (3) The proposed method is implemented in a low power FPGA platform to demonstrate its hardware viability.

MAIN RESULTS

It is observed that considerably lower data rates are achievable when using 7 bits or less to represent the signals, whilst maintaining the signal fidelity. Results obtained using both MATLAB and reconfigurable logic hardware (FPGA) indicate that feature extraction and spike sorting accuracies can be achieved with comparable or better accuracy than reference methods whilst also requiring relatively low hardware resources.

SIGNIFICANCE

By effectively exploiting continuous-time data representation, neural signal processing can be achieved in a completely event-driven manner, reducing both the required resources (memory, complexity) and computations (operations). This will see future large-scale neural systems integrating on-node processing in real-time hardware.

A Fully Automated Approach to Spike Sorting

Understanding the detailed dynamics of neuronal networks will require the simultaneous measurement of spike trains from hundreds of neurons (or more). Currently, approaches to extracting spike times and labels from raw data are time consuming, lack standardization, and involve manual intervention, making it difficult to maintain data provenance and assess the quality of scientific results. Here, we describe an automated clustering approach and associated software package that addresses these problems and provides novel cluster quality metrics. We show that our approach has accuracy comparable to or exceeding that achieved using manual or semi-manual techniques with desktop central processing unit (CPU) runtimes faster than acquisition time for up to hundreds of electrodes. Moreover, a single choice of parameters in the algorithm is effective for a variety of electrode geometries and across multiple brain regions. This algorithm has the potential to enable reproducible and automated spike sorting of larger scale recordings than is currently possible.