Volume 16 Supplement 1

24th Annual Computational Neuroscience Meeting: CNS*2015

Open Access

Decoding position from multiunit activity using a marked point process filter

  • Xinyi Deng1Email author,
  • Daniel F Liu2,
  • Kenneth Kay2,
  • Loren M Frank3 and
  • Uri T Eden1
BMC Neuroscience201516(Suppl 1):P66


Published: 18 December 2015

Traditionally, experiments designed to study the role of specific spike patterns in learning and memory tasks take one of two forms, 1) observational studies that characterize statistical properties of neural activity during such tasks or 2) interventional studies that broadly alter neural activities over an entire neural population or brain region. This work is part of a larger project to allow investigators to manipulate neural populations in a content-specific way, altering spiking activity related to certain learning and memory patterns while leaving activity related to other patterns intact.

One fundamental challenge of this work is to decode the information content of specific spike sequences in real-time. Previously, we have used point process theory to develop efficient decoding algorithms based on spike train observations. However these algorithms assume the spike trains have been accurately sorted ahead of time, which is not possible for real-time decoding. Here we present a new point process decoding algorithm that does not require multiunit signals to be sorted. We use the theory of marked point processes to characterize the relationship between the coding properties of multiunit activity and features of the spike waveforms [13]. Using Bayes' rule, we compute the posterior distribution of a signal to decode given multiunit activity from a neural population.

We first characterize the spiking activity of a neural population using the conditional intensity function for marked point processes. We then construct point process filters to iteratively calculate the full posterior density of a signal. We illustrate our approach with a simulation study as well as with experimental data recorded in the hippocampus of a rat performing a spatial memory task. Our decoding framework is used to reconstruct the animal's position from unsorted multiunit spiking activity. We then compare the quality of fit of our decoding framework to that of a traditional spike-sorting and decoding framework. Our analyses show that the proposed decoding algorithm performs as well as or better than algorithms based on sorted single-unit activity. These results provide a mechanism for content-specific manipulations of population activity in hippocampus.



This research was supported in part by a grant from the Simons Foundation (SCGB 320135 to L.M.F. and SCGB 337036 to U.T.E.), NSF grant IIS-0643995 and NINDS grant R01 NS073118 to U.T.E., NIH grant R01 MH0901188 to L.M.F., and NSF GRFP grant No. 1144247 to D.F.L.

Authors’ Affiliations

Department of Mathematics and Statistics, Boston University
UC Berkeley--UCSF Graduate Program in Bioengineering, UCSF
Department of Physiology, UCSF


  1. Chen Z, Kloosterman F, Layton S, Wilson MA: Transductive Neural Decoding for Unsorted Neuronal Spikes of Rat Hippocampus. Proceedings of the 34th Annual International Conference of the IEEE EMBS. 2012Google Scholar
  2. Cox DR, Isham V: Point Processes. 1980, London: Chapman and HallGoogle Scholar
  3. Kloosterman F, Layton S, Chen Z, Wilson MA: Bayesian decoding using unsorted spikes in the rat hipposcampus. J Neurophysiol. 111: 217-227.Google Scholar


© Deng et al. 2015

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.