Bypassing spike sorting: Density-based decoding using spike localization from dense multielectrode probes.

Objective. Spike sorting is a set of techniques used to analyze extracellular neural recordings, attributing individual spikes to individual neurons. This field has gained significant interest in neuroscience due to advances in implantable microelectrode arrays, capable of recording thousands of neurons simultaneously. High-density electrodes, combined with efficient and accurate spike sorting systems, are essential for various applications, including brain machine interfaces (BMIs), experimental neural prosthetics, real-time neurological disorder monitoring, and neuroscience research. However, given the resource constraints of modern applications, relying solely on algorithmic innovation is not enough. Instead, a co-optimization approach that combines hardware and spike sorting algorithms must be taken to develop neural recording systems suitable for resource-constrained environments, such as wearable devices and BMIs. This co-design requires careful consideration when selecting appropriate spike-sorting algorithms that match specific hardware and use cases. Approach. We investigated the recent literature on spike sorting, both in terms of hardware advancements and algorithms innovations. Moreover, we dedicated special attention to identifying suitable algorithm-hardware combinations, and their respective real-world applicabilities. Main results. In this review, we first examined the current progress in algorithms, and described the recent departure from the conventional ‘3-step’ algorithms in favor of more advanced template matching or machine-learning-based techniques. Next, we explored innovative hardware options, including application-specific integrated circuits, field-programmable gate arrays, and in-memory computing devices (IMCs). Additionally, the challenges and future opportunities for spike sorting are discussed. Significance. This comprehensive review systematically summarizes the latest spike sorting techniques and demonstrates how they enable researchers to overcome traditional obstacles and unlock novel applications. Our goal is for this work to serve as a roadmap for future researchers seeking to identify the most appropriate spike sorting implementations for various experimental settings. By doing so, we aim to facilitate the advancement of this exciting field and promote the development of innovative solutions that drive progress in neural engineering research.

Unsupervised automatic online spike sorting using reward-based online clustering

Spike sorting is a technique in the field of neuroscience applied to identify and classify the action potentials (spikes) of neurons in extracellular recordings. This method is important considering that the simultaneous activity of several neurons can be recorded through the use of electrodes, but the recorded signals are often mixed. Extracting the characteristics of individual spikes provides valuable information about the identity of neurons that generate them, the type of cells involved (inhibitory/excitatory), encoding of information in spike rates or spike times, and so on. Therefore, unmixing the spikes recorded on an electrode via spike sorting is crucial. Here, we apply a novel method to extract features of mixed spikes, namely the Superlet transform, which enables the computation of spectral characteristics with a higher resolution. We use machine learning to determine which features of the Superlet spectrum contain the most information about the shapes of individual spikes, thereby enabling their unmixing during spike sorting.

Developing electrophysiological recordings of brain neuronal activity and their analysis provide a basis for exploring the structure of brain function and nervous system investigation. The recorded signals are typically a combination of spikes and noise. High amounts of background noise and possibility of electric signaling recording from several neurons adjacent to the recording site have led scientists to develop neuronal signal processing tools such as spike sorting to facilitate brain data analysis. Spike sorting plays a pivotal role in understanding the electrophysiological activity of neuronal networks. This process prepares recorded data for interpretations of neurons interactions and understanding the overall structure of brain functions. Spike sorting consists of three steps: spike detection, feature extraction, and spike clustering. There are several methods to implement each of spike sorting steps. This paper provides a systematic comparison of various spike sorting sub-techniques applied to real extracellularly recorded data from a rat brain basolateral amygdala. An efficient sorted data resulted from careful choice of spike sorting sub-methods leads to better interpretation of the brain structures connectivity under different conditions, which is a very sensitive concept in diagnosis and treatment of neurological disorders. Here, spike detection is performed by appropriate choice of threshold level via three different approaches. Feature extraction is done through PCA and Kernel PCA methods, which Kernel PCA outperforms. We have applied four different algorithms for spike clustering including K-means, Fuzzy C-means, Bayesian and Fuzzy maximum likelihood estimation. As one requirement of most clustering algorithms, optimal number of clusters is achieved through validity indices for each method. Finally, the sorting results are evaluated using inter-spike interval histograms.

Objective. Recovery of voluntary gait after spinal cord injury (SCI) requires the restoration of effective motor cortical commands, either by means of a mechanical connection to the limbs, or by restored functional connections to muscles. The latter approach might use functional electrical stimulation (FES), driven by cortical activity, to restore voluntary movements. Moreover, there is evidence that this peripheral stimulation, synchronized with patients’ voluntary effort, can strengthen descending projections and recovery. As a step towards establishing such a cortically-controlled FES system for restoring function after SCI, we evaluate here the type and quantity of neural information needed to drive such a brain machine interface (BMI) in rats. We compared the accuracy of the predictions of hindlimb electromyograms (EMG) and kinematics using neural data from an intracortical array and a less-invasive epidural array. Approach. Seven rats were trained to walk on a treadmill with a stable pattern. One group of rats (n = 4) was implanted with intracortical arrays spanning the hindlimb sensorimotor cortex and EMG electrodes in the contralateral hindlimb. Another group (n = 3) was implanted with epidural arrays implanted on the dura overlying hindlimb sensorimotor cortex. EMG, kinematics and neural data were simultaneously recorded during locomotion. EMGs and kinematics were decoded using linear and nonlinear methods from multiunit activity and field potentials. Main results. Predictions of both kinematics and EMGs were effective when using either multiunit spiking or local field potentials (LFPs) recorded from intracortical arrays. Surprisingly, the signals from epidural arrays were essentially uninformative. Results from somatosensory evoked potentials (SSEPs) confirmed that these arrays recorded neural activity, corroborating our finding that this type of array is unlikely to provide useful information to guide an FES-BMI for rat walking. Significance. We believe that the accuracy of our decoders in predicting EMGs from multiunit spiking activity is sufficient to drive an FES-BMI. Our future goal is to use this rat model to evaluate the potential for cortically-controlled FES to be used to restore locomotion after SCI, as well as its further potential as a rehabilitative technology for improving general motor function.

In this research, we study the effect of feature selection in the spike detection and sorting accuracy. We introduce a new feature representation for neural spikes from multichannel recordings. The features selection plays a significant role in analyzing the response of brain neurons. The more precise selection of features leads to a more accurate spike sorting, which can group spikes more precisely into clusters based on the similarity of spikes. Proper spike sorting will enable the association between spikes and neurons. Different with other threshold-based methods, the cepstrum of spike signals is employed in our method to select the candidates of spike features. To choose the best features among different candidates, the Kolmogorov-Smirnov (KS) test is utilized. Then, we rely on the super paramagnetic method to cluster the neural spikes based on KS features. Simulation results demonstrate that the proposed method not only achieve more accurate clustering results but also reduce computational burden, which implies that it can be applied into real-time spike analysis.

Brain Machine Interface (BMI) systems demand real-time spike sorting to instantaneously decode the spike trains of simultaneously recorded cortical neurons. Real-time spike sorting, however, requires extensive computational power that is not feasible to implement in implantable BMI architectures, thereby requiring transmission of high-bandwidth raw neural data to an external computer. In this work, we describe a miniaturized, low power, programmable hardware module capable of performing this task within the resource constraints of an implantable chip. The module computes a sparse representation of the spike waveforms followed by "smart" thresholding. This cascade restricts the sparse representation to a subset of projections that preserve the discriminative features of neuron-specific spike waveforms. In addition, it further reduces telemetry bandwidth making it feasible to wirelessly transmit only the important biological information to the outside world, thereby improving the efficiency, practicality and viability of BMI systems in clinical applications.

Unsupervised spike sorting, a vital processing step in real-time brain-implantable microsystems, is faced with the prominent challenge of managing nonstationarity in neural signals. In long-term recordings, spike waveforms gradually change and new source neurons are likely to become activated. Adaptive spike sorters combined with on-implant training units effectively process the nonstationary signals at the cost of high hardware resource utilization. On the other hand, static approaches, while being hardware-friendly, are subjected to decreased processing performance in such recordings where the neural signal characteristics gradually change. To strike a balance between the hardware cost and processing performance, this study proposes a hardware-efficient novelty-aware spike sorting approach that is capable of dealing with both variated spike waveforms and spike waveforms generated from new source neurons. Its improved hardware efficiency compared to adaptive ones and capability of dealing with nonstationary signals make it attractive for implantable applications. The proposed novelty-aware spike sorting especially would be a good fit for brain-computer interfaces where long-term, real-time interaction with the brain is required, and the available on-implant hardware resources are limited. Our unsupervised spike sorting benefits from a novelty detection process to deal with neural signal variations. It tracks the spike features so that in case of detecting an unexpected change (novelty detection) both on and off-implant parameters are updated to preserve the performance in new state. To make the proposed approach agile enough to be suitable for brain implants, the on-implant computations are reduced while the computational burden is realized off-implant. The performance of our proposed approach is evaluated using both synthetic and real datasets. The results demonstrate that, in the mean, it is capable of detecting 94.31% of novel spikes (wave-drifted or emerged spikes) with a classification accuracy (CA) of 96.31%. Moreover, an FPGA prototype of the on-implant circuit is implemented and tested. It is shown that in comparison to the OSORT algorithm, a pivotal spike sorting method, our spike sorting provides a higher CA at significantly lower hardware resources. The proposed circuit is also implemented in a 180-nm standard CMOS process, achieving a power consumption of 1.78[Formula: see text][Formula: see text] per channel and a chip area of 0.07[Formula: see text]mm2 per channel.

Motor cortical points are linked by intrinsic horizontal connections having a recurrent network topology. However, it is not known whether neural activity can propagate over the area covered by these intrinsic connections and whether there are spatial anisotropies of synaptic strength, as opposed to synaptic density. Moreover, the mechanisms by which activity spreads have yet to be determined. To address these issues, an 8 × 8 microelectrode array was inserted in the forelimb area of the cat motor cortex (MCx). The centre of the array had a laser etched hole ∼500 μm in diameter. A microiontophoretic pipette, with a tip diameter of 2-3 μm, containing bicuculline methiodide (BIC) was inserted in the hole and driven to a depth of 1200-1400 μm from the cortical surface. BIC was ejected for ∼2min from the tip of the micropipette with positive direct current ranging between 20 and 40 nA in different experiments. This produced spontaneous nearly periodic bursts (0.2-1.0 Hz) of multi-unit activity in a radius of about 400 μm from the tip of the micropipette. The bursts of neural activity spread at a velocity of 0.11-0.24 ms⁻¹ (mean=0.14 mm ms⁻¹, SD=0.05)with decreasing amplitude.The area activated was on average 7.22 mm² (SD=0.91 mm²), or ∼92% of the area covered by the recording array. The mode of propagation was determined to occur by progressive recruitment of cortical territory, driven by a central locus of activity of some 400 μm in radius. Thus, activity did not propagate as a wave. Transection of the connections between the thalamus and MCx did not significantly alter the propagation velocity or the size of the recruited area, demonstrating that the bursts spread along the routes of intrinsic cortical connectivity. These experiments demonstrate that neural activity initiated within a small motor cortical locus (≤ 400 μm in radius) can recruit a relatively large neighbourhood in which a variety of muscles acting at several forelimb joints are represented. These results support the hypothesis that the MCx controls the forelimb musculature in an integrated and anticipatory manner based on a recurrent network topology

Our ability to perform a variety of difficult tasks everything from reasoning about the best chess move, to shooting a free throw, or finely dicing an onion is due to the coordinated activity of populations of neurons throughout the nervoussystem. And yet, we lack an understanding of how the brain generates the activity appropriate for achieving something as simple as pressing an elevator button. In part, this is because we do not know which neural activity patterns the brain is capable of generating, nor how that activity will change with experience. By exploring the structure and constraints on the activity patterns the brain can express, we move closer to understanding how the brain can generate the activity supportive of such a rich variety of behaviors and adaptations. Presently, in studies of arm or eye movements, we typically don't know the causal relationship between neural activity and behavior. Here we use a brain-computer interface (BCI) paradigm to study learning, because the exact relationship between neural activity and behavior is controlled by the experimenter. To generate proficient behavior, the animal must change the activity of the neurons currently being recorded. This provides us with the means to causally relate any observed structure in neural population activity with animals' performance at the task. The focus of this thesis is to characterize the structure and time course of neural population activity during learning. In the first part of this thesis, we note that just as there is more than one way to win a game of chess, the brain has many differentpatterns of neural activity it can produce to drive the same behavior. Which of these redundant options does the brain prefer? We find that the frequency with which animals used different patterns of neural population activity was remarkably similar before and after learning. This suggests that the brain's ability to take advantage of redundancy may be somewhat limited, at least within the span of a few hours. In the second part of this thesis, we asked how internal states such as our arousal, attention, and motivation interact with how we learn new tasks. We identified large, abrupt fluctuations in neural population activity in motor cortex indicative of arousal-like internal state changes, which we term \neural engagement. We find that stereotyped changes in neural engagement during learning were unrelated to goal-seeking behavior, but nevertheless influenced how quickly different tasks were learned. Overall, this thesis characterizes a variety of different constraints and influences on how populations of neurons change their activity during learning.

Spike sorting is a fundamental process for decoding neural activity, involving preprocessing, spike detection, feature extraction, clustering, and validation. However, conventional spike sorting methods are highly fragmented, labor-intensive, and heavily reliant on expert manual curation, limiting their scalability and reproducibility. This challenge has become more pressing with advances in neural recording technology, such as high-density Neuropixels for large-scale neural recording or flexible electrodes for long-term stable recording over months to years. The volume and complexity of these datasets make manual curation infeasible, requiring an automated and scalable solution. Here, we introduce SpikeAgent, a multimodal large language model (LLM)-based AI agent that automates and standardizes the entire spike sorting pipeline. Unlike traditional approaches, SpikeAgent integrates multiple LLM backends, coding functions, and established algorithms, autonomously performing spike sorting with reasoning-based decision-making and real-time interaction with intermediate results. It generates interpretable reports, providing transparent justifications for each sorting decision, enhancing transparency and reliability. We benchmarked SpikeAgent against human experts across various neural recording technology, demonstrating its versatility and ability to achieve curation consistency that are equal to, or even higher than human experts. It also drastically reduces the expertise barrier and accelerates the curation and validation time by orders of magnitude. Moreover, it enables automated interpretability of the neural spiking data, which cannot be achieved by any conventional methods. SpikeAgent presents a paradigm shift in processing signals for neuroscience and brain-computer interfaces, while laying the ground for AI agent-augmented science across various domains.

Brain-machine interfaces (BMIs) based on extracellular recordings with microelectrodes provide means of observing the activities of neurons that orchestrate fundamental brain function, and are therefore powerful tools for exploring the function of the brain. Due to physical restrictions and risks for post-surgical complications, wired BMIs are not suitable for long-term studies in freely behaving animals. Wireless BMIs ideally solve these problems, but they call for low-complexity techniques for data compression that ensure maximum utilization of the wireless link and energy resources, as well as minimum heat dissipation in the surrounding tissues. In this paper, we analyze the performances of various system architectures that involve spike detection, spike alignment and spike compression. Performance is analyzed in terms of spike reconstruction and spike sorting performance after wireless transmission of the compressed spike waveforms. Compression is performed with transform coding, using five different compression bases, one of which we pay special attention to. That basis is a fixed basis derived, by singular value decomposition, from a large assembly of experimentally obtained spike waveforms, and therefore represents a generic basis specially suitable for compressing spike waveforms. Our results show that a compression factor of 99.8%, compared to transmitting the raw acquired data, can be achieved using the fixed generic compression basis without compromising performance in spike reconstruction and spike sorting. Besides illustrating the relative performances of various system architectures and compression bases, our findings show that compression of spikes with a fixed generic compression basis derived from spike data provides better performance than compression with downsampling or the Haar basis, given that no optimization procedures are implemented for compression coefficients, and the performance is similar to that obtained when the optimal SVD based basis is used.

High-grade gliomas are aggressive primary brain tumors that affect the surrounding brain tissue, which can lead to neurological deficits, epilepsy, cognitive deficits, and tumor progression. Research has focused on glutamatergic alterations, but the understanding of the underlying network mechanisms is still scarce. To investigate how gliomas might affect neural network integrity and capacity for spiking activity, we induced network bursting events in neocortical slices from F98 glioma-bearing rats. Network activity was recorded using a 64 × 64 high-density multielectrode array to assess the network's capacity for extended periods of high activity. We describe glioma cell implantation, brain slice preparation, and detailed data analysis of electrophysiological recordings, focusing on computational methods for characterization of the network-wide bursting events. Spike sorting was performed using Kilosort4 and employed to identify network bursts. Burst origins were estimated from multi-unit activity, and network burst propagation speed was assessed. Network-level functional connectivity was analyzed using metrics derived from graphs based on the spike time tiling coefficient. Our results indicate reduced network integrity in glioma-bearing slices. The combination of a high-density multielectrode array with Kilosort4 is advantageous over conventional recording techniques in terms of detecting network bursting and plotting center-of-activity trajectories. This protocol provides a robust platform for dissecting network activity and establishes a basis for future mechanistic studies. We also discuss the limitations and experimental challenges of our preclinical approach to investigating glioma-associated effects on surrounding neuronal networks.

Objective. The OSort algorithm, a pivotal unsupervised spike sorting method, has been implemented in dedicated hardware devices for real-time spike sorting. However, due to the inherent complexity of neural recording environments, OSort still grapples with numerous transient cluster occurrences during the practical sorting process. This leads to substantial memory usage, heavy computational load, and complex hardware architectures, especially in noisy recordings and multi-channel systems. Approach. This study introduces an optimized OSort algorithm (opt-OSort) which utilizes correlation coefficient (CC), instead of Euclidean distance as classification criterion. The CC method not only bolsters the robustness of spike classification amidst the diverse and ever-changing conditions of physiological and recording noise environments, but also can finish the entire sorting procedure within a fixed number of cluster slots, thus preventing a large number of transient clusters. Moreover, the opt-OSort incorporates two configurable validation loops to efficiently reject cluster outliers and track recording variations caused by electrode drifting in real-time. Main results. The opt-OSort significantly reduces transient cluster occurrences by two orders of magnitude and decreases memory usage by 2.5–80 times in the number of pre-allocated transient clusters compared with other hardware implementations of OSort. The opt-OSort maintains an accuracy comparable to offline OSort and other commonly-used algorithms, with a sorting time of 0.68 µs as measured by the hardware-implemented system in both simulated datasets and experimental data. The opt-OSort’s ability to handle variations in neural activity caused by electrode drifting is also demonstrated. Significance. These results present a rapid, precise, and robust spike sorting solution suitable for integration into low-power, portable, closed-loop neural control systems and brain–computer interfaces.

Spike sorting is the process of separating the extracellular recording of the brain signal into one unit activity. There are a number of proposed algorithms for this purpose, but there is still no acceptable solution. In this paper a spike sorting method has been proposed based on the Euclidean distance of the most effective features of spikes represented by principle components (PCs) of the detected and aligned spikes. The assessments of the method, based on signal-to-noise ratio (SNR) representing background noise, showed that the method performed spike sorting to a high level of accuracy.