-
4
Aug
Template matching is a popular method in spike sorting, mostly employed in the overlap resolution task. Several algorithms have been proposed during the last 5 years, some of them featuring online implementations.
Selected publications follow:
Zhang et al. Spike sorting based on automatic template reconstruction with a partial solution to the overlapping problem. J Neurosci Methods (2004) vol. 135 (1-2) pp. 55-65
[DOI:10.1016/j.jneumeth.2003.12.001]
Rutishauser et al. Online detection and sorting of extracellularly recorded action potentials in human medial temporal lobe recordings, in vivo. J Neurosci Methods (2006) vol. 154 (1-2) pp. 204-24
[DOI:10.1016/j.jneumeth.2005.12.033]
Vargas-Irwin and Donoghue. Automated spike sorting using density grid contour clustering and subtractive waveform decomposition. J Neurosci Methods (2007) vol. 164 (1) pp. 1-18
[DOI:10.1016/j.jneumeth.2007.03.025]
Ding and Yuan. Spike sorting based on multi-class support vector machine with superposition resolution. Medical & biological engineering & computing (2008) vol. 46 (2) pp. 139-45
[DOI:10.1007/s11517-007-0248-0]
Franke et al. An online spike detection and spike classification algorithm capable of instantaneous resolution of overlapping spikes. Journal of computational neuroscience (2009) pp.
[DOI:10.1007/s10827-009-0163-5]
- Published by Dimitrios A. Adamos in: Documentation
- RSS feed subscription!