Functional connectivity dynamics among cortical neurons: a dependence analysis

Evaluation of synchronization measures for capturing the lagged synchronization between EEG channels: A cognitive task recognition approach

During cognitive, perceptual and sensory tasks, connectivity profile changes across different regions of the brain. Variations of such connectivity patterns between different cognitive tasks can be evaluated using pairwise synchronization measures applied to electrophysiological signals, such as electroencephalography (EEG). However, connectivity-based task recognition approaches achieving viable recognition performance have been lacking from the literature. By using several synchronization measures, we identify time lags between channel pairs during different cognitive tasks. We employed mutual information, cross correntropy, cross correlation, phase locking value, cosine similarity and nonlinear interdependence measures. In the training phase, for each type of cognitive task, we identify the time lags that maximize the average synchronization between channel pairs. These lags are used to calculate pairwise synchronization values with which we construct the train and test feature vectors for recognition of the cognitive task carried out using Fisher's linear discriminant (FLD) analysis. We tested our framework in a motor imagery activity recognition scenario on PhysioNet Motor Movement/Imagery and BCI Competition-III Ⅳa datasets. For PhysioNet dataset, average performance results ranging between % 51 and % 61 across 20 subjects. For BCI Competition-Ⅲ dataset, we achieve an average recognition performance of % 76 which is above the minimum reliable communication rate (% 70). We achieved an average accuracy over the minimum reliable communication rate on the BCI Competition-Ⅲ dataset. Performance levels were lower on the PhysioNet dataset. These results indicate that a viable task recognition system is achievable using pairwise synchronization measures evaluated at the proper task specific lags.

An overview of Bayesian methods for neural spike train analysis

Neural spike train analysis is an important task in computational neuroscience which aims to understand neural mechanisms and gain insights into neural circuits. With the advancement of multielectrode recording and imaging technologies, it has become increasingly demanding to develop statistical tools for analyzing large neuronal ensemble spike activity. Here we present a tutorial overview of Bayesian methods and their representative applications in neural spike train analysis, at both single neuron and population levels. On the theoretical side, we focus on various approximate Bayesian inference techniques as applied to latent state and parameter estimation. On the application side, the topics include spike sorting, tuning curve estimation, neural encoding and decoding, deconvolution of spike trains from calcium imaging signals, and inference of neuronal functional connectivity and synchrony. Some research challenges and opportunities for neural spike train analysis are discussed.

Identification of sparse neural functional connectivity using penalized likelihood estimation and basis functions

One key problem in computational neuroscience and neural engineering is the identification and modeling of functional connectivity in the brain using spike train data. To reduce model complexity, alleviate overfitting, and thus facilitate model interpretation, sparse representation and estimation of functional connectivity is needed. Sparsities include global sparsity, which captures the sparse connectivities between neurons, and local sparsity, which reflects the active temporal ranges of the input-output dynamical interactions. In this paper, we formulate a generalized functional additive model (GFAM) and develop the associated penalized likelihood estimation methods for such a modeling problem. A GFAM consists of a set of basis functions convolving the input signals, and a link function generating the firing probability of the output neuron from the summation of the convolutions weighted by the sought model coefficients. Model sparsities are achieved by using various penalized likelihood estimations and basis functions. Specifically, we introduce two variations of the GFAM using a global basis (e.g., Laguerre basis) and group LASSO estimation, and a local basis (e.g., B-spline basis) and group bridge estimation, respectively. We further develop an optimization method based on quadratic approximation of the likelihood function for the estimation of these models. Simulation and experimental results show that both group-LASSO-Laguerre and group-bridge-B-spline can capture faithfully the global sparsities, while the latter can replicate accurately and simultaneously both global and local sparsities. The sparse models outperform the full models estimated with the standard maximum likelihood method in out-of-sample predictions.