Neural spike sorting is curial for neuroscience applications. For example, spike sorting allows designing of efficient human-computer interfaces. Therefore, many investigations, aiming for accurate computer-aided algorithms for spike detection and classification, have emerged. However, many of the available algorithms require human intervention during the classification step. This study proposes decomposition and classification of spike waveforms using dictionary learning. In sparse decomposition, each spike is represented as a unique sparse combination of the dictionary basis vectors. This can lead to interesting sorting performance. Spiking activity was detected using amplitude thresholding and a 2.5-ms window around the peak value. Under the assumption that each neuron has a consistent waveform, the dictionary atoms were learned using training samples. This learned dictionary was used to get a sparse code representation for the test samples. These codes can be used to reconstruct the original spikes and therefore it provides data compression capability. Classification of the neural spikes was done using the sparse coefficients alongside with the reconstruction error. To ensure high discrimination, the dictionary was learned such that the resultant atoms have correspondence to class labels. In other words, the dictionary is structured of sub-dictionaries each corresponds to a different spiking pattern. Subsequently, an optimization problem was solved to make sure that (i) the sub-dictionaries accurately represent the training data, and (ii) the coding coefficients are sparse and minimize the reconstruction error. A testing sample was classified by sparsely coding it over each sub-dictionary. The reconstruction error for each sub-dictionary is computed. An error function is defined for each class as the summation of the reconstruction error and the difference between the sparse code and that class average. The testing sample was assigned to the class that gave the minimum error. The algorithm was tested on four simulated data sets, each contains spiking activities from three different neurons. Approximately 10% of each class data was used to construct the dictionary. The reconstruction mean-squared error for all the training samples was 3.49. This confirms the reconstruction power and accuracy of the learned dictionary. We measured the accuracy of our algorithm at different noise levels. The classification accuracy of the proposed method is 97% ± 5%. This accuracy outperforms the existing state-of-the-art algorithms. A dictionary learning based spike sorting algorithm has been developed. The results suggest that dictionary-based representation enables us to use the sparse representation of signals without a severe loss of data; besides that, this sparse representation can be also used for classification. This could also enable estimation of missing data points or clipped signals. The reconstruction error can be used to efficiently sort spikes.
Read full abstract