2008
DOI: 10.1016/j.jneumeth.2008.06.011
|View full text |Cite
|
Sign up to set email alerts
|

Spike sorting with hidden Markov models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
43
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 42 publications
(43 citation statements)
references
References 36 publications
0
43
0
Order By: Relevance
“…Quantification of these variations, especially when consecutive transmission events partially overlap in time, requires decomposing the transmission event into these three subcomponents. This task is unfortunately outside the scope of classical spike-sorting algorithms, where the waveforms are assumed to not overlap and remain constant in shape [an exception to the first assumption was presented by Herbst et al (2008), still requiring substantial computational resources]. Therefore, a dedicated fitting procedure was developed in MATLAB (MathWorks).…”
Section: Discussionmentioning
confidence: 99%
“…Quantification of these variations, especially when consecutive transmission events partially overlap in time, requires decomposing the transmission event into these three subcomponents. This task is unfortunately outside the scope of classical spike-sorting algorithms, where the waveforms are assumed to not overlap and remain constant in shape [an exception to the first assumption was presented by Herbst et al (2008), still requiring substantial computational resources]. Therefore, a dedicated fitting procedure was developed in MATLAB (MathWorks).…”
Section: Discussionmentioning
confidence: 99%
“…The clustering can be performed in a variety of feature spaces spanned by features such as peak or valley amplitude, principal components, or wavelet coefficients. In addition to these commercial or widely used tools, new algorithms for performing spike sorting continue to be developed [5][6][7][8][9][10][11][12].…”
Section: Introductionmentioning
confidence: 99%
“…Considered as a state-of-the-art spike sorting algorithm [11], Wave clus has been reported to be the second most highly cited spike sorting algorithm in the literature [21].…”
Section: Introductionmentioning
confidence: 99%
“…This study aims for the online estimation of the discharge rate of each train, despite these interferences and despite unknown action potential shapes (although a rough initial shape is necessary). It uses some of the concepts proposed in [8] and [9], where the information carried by spike trains is encoded by action potentials waveforms and decoded offline using a Viterbi algorithm. Like [10] and [11], it tackles the online problem, but it also uses tools from reliability theory to handle the regularity of the trains.…”
Section: Introductionmentioning
confidence: 99%