By Topic

Graph-Laplacian Features for Neural Waveform Classification

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ghanbari, Y. ; Dept. of Electr. Eng., Southern Methodist Univ., Dallas, TX, USA ; Papamichalis, P.E. ; Spence, L.

Analysis of extracellular recordings of neural action potentials (known as spikes) is highly dependent upon the accuracy of neural waveform classification, commonly referred to as spike sorting. Feature extraction is an important stage of this process because it can limit the quality of clustering that is performed in the feature space. Principal components analysis (PCA) is the most commonly used feature extraction method employed for neural spike recordings. To improve upon PCA's feature extraction performance for neural spike sorting, we revisit the PCA procedure to analyze its weaknesses and describe an improved feature extraction method. This paper proposes a linear feature extraction technique that we call graph-Laplacian features, which simultaneously minimizes the graph Laplacian and maximizes variance. The algorithm's performance is compared with PCA and a wavelet-coefficient-based feature extraction algorithm on simulated single-electrode neural data. A cluster-quality metric is proposed to quantitatively measure the algorithm performance. The results show that the proposed algorithm produces more compact and well-separated clusters compared to the other approaches.

Published in:

Biomedical Engineering, IEEE Transactions on  (Volume:58 ,  Issue: 5 )