Multivariate point processes are increasingly being used to model neuronal response properties in the cortex. Estimating the conditional intensity functions underlying these processes is important to characterize and decode the firing patterns of cortical neurons. This paper proposes a new approach for estimating these intensity functions directly from a compressed representation of the neurons' extracellular recordings. The approach is based on exploiting a sparse representation of the extracellular spike waveforms, previously demonstrated to yield near-optimal denoising and compression properties. We show that by restricting this sparse representation to a subset of projections that simultaneously preserve features of the spike waveforms in addition to the temporal characteristics of the underlying intensity functions, we can reasonably approximate the instantaneous firing rates of the recorded neurons with variable tuning characteristics across a multitude of time scales. Such feature is highly desirable to detect subtle temporal differences in neuronal firing characteristics from single-trial data. An added advantage of this approach is that it eliminates multiple steps from the typical processing path of neural signals that are customarily performed for instantaneous neural decoding. We demonstrate the decoding performance of the approach using a stochastic cosine tuning model of motor cortical activity during a natural, nongoal-directed 2-D arm movement.
28 March 2012 in Journal of Signal Processing Systems
An essential step towards understanding how the brain orchestrates information processing at the cellular and population levels is to simultaneously observe the spiking activity of cortical neurons that mediate perception, learning, and motor processing. In this paper, we formulate an information theoretic approach to determine whether cooperation among neurons may constitute a governing mechanism of information processing when encoding external covariates. Specifically, we show that conditional independence between neuronal outputs may not provide an optimal encoding strategy when the firing probability of a neuron depends on the history of firing of other neurons connected to it. Rather, cooperation among neurons can provide a ¿message-passing¿ mechanism that preserves most of the information in the covariates under specific constraints governing their connectivity structure. Using a biologically plausible statistical learning model, we demonstrate the performance of the proposed approach in synergistically encoding a motor task using a subset of neurons drawn randomly from a large population. We demonstrate its superiority in approximating the joint density of the population from limited data compared to a statistically independent model and a pairwise maximum entropy (MaxEnt) model.
Hierarchical clustering has been extensively used in practice, where clusters can be assigned and analyzed simultaneously, especially when estimating the number of clusters is challenging. However, due to the conventional proximity measures recruited in these algorithms, they are only capable of detecting mass-shape clusters and encounter problems in identifying complex data structures. Here, we introduce two bottom-up hierarchical approaches that exploit an information theoretic proximity measure to explore the nonlinear boundaries between clusters and extract data structures further than the second order statistics. Experimental results on both artificial and real datasets demonstrate the superiority of the proposed algorithm compared to conventional and information theoretic clustering algorithms reported in the literature, especially in detecting the true number of clusters.
1 August 2010 in 2018 40th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)
Brain Machine Interface (BMI) systems demand real-time spike sorting to instantaneously decode the spike trains of simultaneously recorded cortical neurons. Real-time spike sorting, however, requires extensive computational power that is not feasible to implement in implantable BMI architectures, thereby requiring transmission of high-bandwidth raw neural data to an external computer. In this work, we describe a miniaturized, low power, programmable hardware module capable of performing this task within the resource constraints of an implantable chip. The module computes a sparse representation of the spike waveforms followed by “smart” thresholding. This cascade restricts the sparse representation to a subset of projections that preserve the discriminative features of neuron-specific spike waveforms. In addition, it further reduces telemetry bandwidth making it feasible to wirelessly transmit only the important biological information to the outside world, thereby improving the efficiency, practicality and viability of BMI systems in clinical applications.
Decoding spike trains is an essential step to translate multiple single unit activity to useful control commands in cortically controlled Brain Machine Interface (BMI) systems. Extracting the spike trains of individual neurons from the recorded mixtures requires spike sorting, a computationally prohibitive step that precludes the development of fully implantable, small size and low power electronics. Previously, we reported on the ability to extract the critical information in these spike trains such as precise spike timing and firing rate of individual neurons using a compressed sensing strategy that overcomes the computational burden of the spike sorting step. Herein, we assess the decoding performance using this method and compare it to the case where classical spike sorting takes place prior to decoding. We use the local average of the sparsely represented data as discriminative features to “informally” detect and classify spikes in the data stream. We demonstrate that there is a substantial gain in performance assessed under different decoding strategies, while much less computations are needed compared to spike sorting in the traditional sense.