2021
DOI: 10.1109/tbcas.2021.3134660
|View full text |Cite
|
Sign up to set email alerts
|

A Multi-Channel Spike Sorting Processor With Accurate Clustering Algorithm Using Convolutional Autoencoder

Abstract: This paper presents a spike sorting processor based on an accurate spike clustering algorithm. The proposed spike sorting algorithm employs an L2-normalized convolutional autoencoder to extract features from the input, where the autoencoder is trained using the proposed spike sorting-aware loss. In addition, we propose a similarity-based K-means clustering algorithm that conditionally updates the means by observing the cosine similarity. The modified K-means algorithm exhibits better convergence and enables on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(6 citation statements)
references
References 24 publications
0
4
0
Order By: Relevance
“…A classic approach to solve a classification/clustering problem is to allocate each data point to the neighboring class with minimal distance. In such methods, the distance/proximity metric could be the Manhattan (l 1 -norm) distance [7], [5] or cosine similarity [12]. K-means [12], [8] and template matching [6] are the distancebased methods widely used for spike sorting (Fig.…”
Section: B State-of-the-art Bmi Socsmentioning
confidence: 99%
See 1 more Smart Citation
“…A classic approach to solve a classification/clustering problem is to allocate each data point to the neighboring class with minimal distance. In such methods, the distance/proximity metric could be the Manhattan (l 1 -norm) distance [7], [5] or cosine similarity [12]. K-means [12], [8] and template matching [6] are the distancebased methods widely used for spike sorting (Fig.…”
Section: B State-of-the-art Bmi Socsmentioning
confidence: 99%
“…In such methods, the distance/proximity metric could be the Manhattan (l 1 -norm) distance [7], [5] or cosine similarity [12]. K-means [12], [8] and template matching [6] are the distancebased methods widely used for spike sorting (Fig. 2(a)).…”
Section: B State-of-the-art Bmi Socsmentioning
confidence: 99%
“…In [25], a convolutional neural network (CNN) was employed to distinguish between categories of spikes. An L 2 -normalized deep convolutional autoencoder with spike sorting-aware loss was exploited for feature extraction for fully unsupervised and online spike sorting [26]. In [27], a supervised deep learning was used to distinguish spike events from non-neural events, together with deep learning for offline spike sorting [28].…”
Section: Introductionmentioning
confidence: 99%
“…Other recent works have explored the application of neural networks to spike sorting [17], [19], [20]. While those implementations can attain high accuracies and robustness to background noise, they typically require supervised training, as well as substantial power and area, particularly when dealing with a large number of channels.…”
Section: Introductionmentioning
confidence: 99%