Spike sorting is the task of relating neural spikes in a neural activity recording with specific neurons. Scaling this operation to a large number of neurons is imperative for a comprehensible analysis of brain connectivity but the acquisition of neural activity at large scales is inefficient under the traditional sampling framework. In this work an algorithm is developed combining results from finite rate of innovation sampling and compressed sensing for efficient neural spike sampling.
Problem and objectives
Communication between neurons is carried out by action potentials or spikes propagating as electrical and chemical pulses along the nervous system. Cracking the neural code can provide invaluable medical information boosting research on neurological diseases such as epilepsy or Alzheimer’s disease. Spike sorting is an indispensable tool for the analysis of brain activity at individual neuron resolutions and relies on the ability to detect the temporal occurrence of action potentials and identify a relationship between each one of these and a unique specific neuron. However, a meaningful analysis requires the simultaneous monitoring of thousands of neurons and the performance of spike sorting algorithms increases with multichannel recordings, so the amount of data that has to be collected and processed scales up fast as does the energy consumed by the recording device.
The activity of a neuron can be viewed parametrically as a temporal point process of identical spikes and can be considered very redundant in signal space. These are conditions that make neural information suitable to modern sampling techniques, which allow to sample below the Nyquist sampling criterion with no information loss. We propose a novel algorithm for the acquisition of neural activity information at sub-Nyquist rates by combining results from finite rate of innovation sampling and compressed sensing.
We apply the proposed method to extracellular spike recordings with sampling rates x4 below Nyquist. After reconstruction, a standard spike sorting algorithm was able to produce the same sorting performance than with data sampled at Nyquist rate. This implies that the sampling and reconstruction method is able to reproduce characteristic patterns in neural spikes that enable reliable sorting.
Spike-sorting at sub-Nyquist rates
J. Caballero, J. A. Urigüen, S. R. Schultz, P. L. Dragotti
Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 585-588, Kyoto, Japan, 2012
Spike sorting at sub-Nyquist rates
M.Sc. Thesis, Imperial College London, 2011