Advertisement

Adaptive Spike Sorting with a Gaussian Mixture Model

Chapter

Abstract

Spike sorting is an important step in the processing of action potentials recorded from electrodes implanted into the brain. When such signals are acquired over long time spans, the shape of action potential waveforms often changes, requiring corresponding changes in spike sorting algorithm parameters. To avoid manual update of these parameters, an adaptive spike sorting method is needed. Here we present an adaptive spike sorting method based on the Gaussian mixture model and variational Bayesian inference. This approach treats classification of new spikes as clustering under a Gaussian mixture model with a strong Bayesian prior comprising of the previous clustering parameters. The result of this clustering gives the label of the new waveform as well as updates the clustering parameters. We also include a model for how clustering parameters change over time. We demonstrate this method on synthetic data as well as real neural data.

Keywords

Spike sorting Adaptive method Gaussian mixture model Variational Bayes 

References

  1. Bar-Hillel A, Spiro A, Stark E. Spike sorting: Bayesian clustering of non-stationary data. JNeurosci Methods. 2006;157(2):303–16.CrossRefGoogle Scholar
  2. Bishop CM. Pattern recognition and machine learning. New York: Springer; 2006.Google Scholar
  3. Calabrese A, Paninski L. Kalman filter mixture model for spike sorting of non-stationary data. JNeurosci Methods. 2011;196(1):159–69.CrossRefGoogle Scholar
  4. Dempster AP, Laird NM, Rubin DB. Maximum likelihood from incomplete data via the EM algorithm. J R Stat Soc Ser B (Methodol). 1977;39(1):1–38.Google Scholar
  5. Gasthaus J, Wood F, Görür D, Teh YW. Dependent Dirichlet process spike sorting. In: Advances in neural information processing systems 22. Cambridge: MIT Press; 2009.Google Scholar
  6. Gauvain JL, Lee CH. Bayesian learning of Gaussian mixture densities for hidden Markov models. In: DARPA speech and natural language workshop.Harriman; 1991. p. 272–277.Google Scholar
  7. Gibson S, Judy JW, Markovic D. Spike sorting. IEEE Signal Process Mag. 2012;29:124–43.CrossRefGoogle Scholar
  8. Harris KD, Henze DA, Csicsvari J, Hirase H, Buzsaki G. Accuracy of tetrode spike separation as determined by simultaneous intracellular and extracellular measurements. J Neurophysiol. 2000;84(1):401–14.PubMedGoogle Scholar
  9. Lewicki MS. A review of methods for spike sorting: the detection and classification of neural action potentials. Netw Comput Neural Syst. 1998;9(4):53–78.CrossRefGoogle Scholar
  10. Li Z, O’Doherty JE, Hanson TL, Lebedev MA, Henriquez CS, Nicolelis MAL. Unscented Kalman filter for brain-machine interfaces. PLoS One. 2009;4(7):e6243.CrossRefPubMedPubMedCentralGoogle Scholar
  11. Paraskevopoulou SE, Wu D, Eftekhar A, Constandinou TG. Hierarchical Adaptive Means (HAM) clustering for hardware-efficient, unsupervised and real-time spike sorting. J Neurosci Methods. 2014;235:145–56.CrossRefPubMedGoogle Scholar
  12. Sahani M. Latent variable models for neural data analysis. Ph. D. thesis, California Institute of Technology; 1999.Google Scholar
  13. Ventura V. Automatic spike sorting using tuning information. Neural Comput. 2009;21:2466–501.CrossRefPubMedPubMedCentralGoogle Scholar
  14. Wolf MT, Burdick JW. Bayesian clustering and tracking of neuronal signals for autonomous neural interfaces. In CDC 2008. 47th IEEE conference on decision and control; 2008. pp. 1992–1999.Google Scholar

Copyright information

© Springer Science+Business Media Singapore 2016

Authors and Affiliations

  1. 1.State Key Laboratory of Cognitive Neuroscience and Learning & IDG/McGovern Institute for Brain ResearchBeijing Normal UniversityBeijingChina
  2. 2.Center for Collaboration and Innovation in Brain and Learning SciencesBeijing Normal UniversityBeijingChina

Personalised recommendations