Spike sorting based on multi-class support vector machine with superposition resolution

Abstract

A new spike sorting method based on the support vector machine (SVM) is proposed to resolve the superposition problem. The spike superposition is generally resolved by the template matching. Previous template matching methods separate the spikes through linear classifiers. The classification performance is severely influenced by the background noise included in spike trains. The nonlinear classifiers with high generation ability are required to deal with the task. A multi-class SVM classifier is therefore applied to separate the spikes, which contains several binary SVM classifiers. Every binary SVM classifier corresponding to one spike class is used to identify the single and superposition spikes. The superposition spikes are decomposed through template extraction. The experimental results on the simulated and real data demonstrate the utility of the proposed method.