Spike sorting based on radial basis function network with overlap decomposition

Spike sorting based on radial basis function network with overlap decomposition

0.00 Avg rating0 Votes
Article ID: iaor20119570
Volume: 62
Issue: 7
Start Page Number: 2736
End Page Number: 2742
Publication Date: Oct 2011
Journal: Computers and Mathematics with Applications
Authors: , ,
Keywords: medicine, networks, simulation, biology
Abstract:

Spike sorting is the essential step in analyzing recording spike signals for studying information processing mechanisms within the nervous system. Overlapping is one of the most serious problems in the spike sorting for multi‐channel recordings. In this paper, a modified radial basis function (RBF) network is proposed to decompose the overlapping signals and separate spikes within the same RBF network. A modified radial basis function based on the Gaussian function is employed in the method to improve the accuracy of overlap decomposition. In addition, the improved constructing algorithm reduces the calculation cost by taking advantage of the symmetry of the RBF network. The performance of the presented method is tested at various signal‐to‐noise ratio levels based on simulated data coming from the University of Leicester and Wave‐clus software. Experiment results show that our method successfully solves the fully overlapping problem and has higher accuracy comparing with the Gaussian function.

Reviews

Required fields are marked *. Your email address will not be published.