2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM) 2018
DOI: 10.1109/bibm.2018.8621401
|View full text |Cite
|
Sign up to set email alerts
|

HASS: High Accuracy Spike Sorting with Wavelet Package Decomposition and Mutual Information

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…These three spikes shape needed to be applied to the 300 spikes where the noise ratio was modified from 0.1 to 0.5 with 0.15, 0.2, 0.25, 0.3, 0.35, 0.4, 0.45 in between. In each time the alignment was performed to recognize the spikes from the background noise by applying the thresholding to filter the spikes from the noise as shown in figure (5). The process starts with generating information from the dataset and then the number of spikes is selected (here 300).…”
Section: A Template Matching Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…These three spikes shape needed to be applied to the 300 spikes where the noise ratio was modified from 0.1 to 0.5 with 0.15, 0.2, 0.25, 0.3, 0.35, 0.4, 0.45 in between. In each time the alignment was performed to recognize the spikes from the background noise by applying the thresholding to filter the spikes from the noise as shown in figure (5). The process starts with generating information from the dataset and then the number of spikes is selected (here 300).…”
Section: A Template Matching Methodsmentioning
confidence: 99%
“…In this work, we used two different intelligent modeling methods. The flowchart of the system is illustrated in figure (5). First, the information was obtained from the dataset and the number of spikes to be used for the training were selected.…”
Section: System Modelmentioning
confidence: 99%
See 2 more Smart Citations
“…They could fall into two categories, i.e., the two-stage methods (performing the feature extraction and the clustering in turn) and the one-stage methods (performing both the feature extraction and the clustering simultaneously in a unified framework) [18], [19]. On the one hand, the two-stage methods include Wave clus [20], [21] and High-Accuracy Spike Sorting (HASS) [22], [9], which extract features in a time-frequency domain. There also exist methods that extract features only in the time domain, including the features from principal component analysis [23], linear discriminant analysis [24], locality preserving projection [25], etc.…”
Section: Introductionmentioning
confidence: 99%