9,900 research outputs found
Seizure-onset mapping based on time-variant multivariate functional connectivity analysis of high-dimensional intracranial EEG : a Kalman filter approach
The visual interpretation of intracranial EEG (iEEG) is the standard method used in complex epilepsy surgery cases to map the regions of seizure onset targeted for resection. Still, visual iEEG analysis is labor-intensive and biased due to interpreter dependency. Multivariate parametric functional connectivity measures using adaptive autoregressive (AR) modeling of the iEEG signals based on the Kalman filter algorithm have been used successfully to localize the electrographic seizure onsets. Due to their high computational cost, these methods have been applied to a limited number of iEEG time-series (< 60). The aim of this study was to test two Kalman filter implementations, a well-known multivariate adaptive AR model (Arnold et al. 1998) and a simplified, computationally efficient derivation of it, for their potential application to connectivity analysis of high-dimensional (up to 192 channels) iEEG data. When used on simulated seizures together with a multivariate connectivity estimator, the partial directed coherence, the two AR models were compared for their ability to reconstitute the designed seizure signal connections from noisy data. Next, focal seizures from iEEG recordings (73-113 channels) in three patients rendered seizure-free after surgery were mapped with the outdegree, a graph-theory index of outward directed connectivity. Simulation results indicated high levels of mapping accuracy for the two models in the presence of low-to-moderate noise cross-correlation. Accordingly, both AR models correctly mapped the real seizure onset to the resection volume. This study supports the possibility of conducting fully data-driven multivariate connectivity estimations on high-dimensional iEEG datasets using the Kalman filter approach
Sparse Predictive Structure of Deconvolved Functional Brain Networks
The functional and structural representation of the brain as a complex
network is marked by the fact that the comparison of noisy and intrinsically
correlated high-dimensional structures between experimental conditions or
groups shuns typical mass univariate methods. Furthermore most network
estimation methods cannot distinguish between real and spurious correlation
arising from the convolution due to nodes' interaction, which thus introduces
additional noise in the data. We propose a machine learning pipeline aimed at
identifying multivariate differences between brain networks associated to
different experimental conditions. The pipeline (1) leverages the deconvolved
individual contribution of each edge and (2) maps the task into a sparse
classification problem in order to construct the associated "sparse deconvolved
predictive network", i.e., a graph with the same nodes of those compared but
whose edge weights are defined by their relevance for out of sample predictions
in classification. We present an application of the proposed method by decoding
the covert attention direction (left or right) based on the single-trial
functional connectivity matrix extracted from high-frequency
magnetoencephalography (MEG) data. Our results demonstrate how network
deconvolution matched with sparse classification methods outperforms typical
approaches for MEG decoding
Graph analysis of functional brain networks: practical issues in translational neuroscience
The brain can be regarded as a network: a connected system where nodes, or
units, represent different specialized regions and links, or connections,
represent communication pathways. From a functional perspective communication
is coded by temporal dependence between the activities of different brain
areas. In the last decade, the abstract representation of the brain as a graph
has allowed to visualize functional brain networks and describe their
non-trivial topological properties in a compact and objective way. Nowadays,
the use of graph analysis in translational neuroscience has become essential to
quantify brain dysfunctions in terms of aberrant reconfiguration of functional
brain networks. Despite its evident impact, graph analysis of functional brain
networks is not a simple toolbox that can be blindly applied to brain signals.
On the one hand, it requires a know-how of all the methodological steps of the
processing pipeline that manipulates the input brain signals and extract the
functional network properties. On the other hand, a knowledge of the neural
phenomenon under study is required to perform physiological-relevant analysis.
The aim of this review is to provide practical indications to make sense of
brain network analysis and contrast counterproductive attitudes
Mapping the epileptic brain with EEG dynamical connectivity: established methods and novel approaches
Several algorithms rooted in statistical physics, mathematics and machine learning are used to analyze neuroimaging data from patients suffering from epilepsy, with the main goals of localizing the brain region where the seizure originates from and of detecting upcoming seizure activity in order to trigger therapeutic neurostimulation devices. Some of these methods explore the dynamical connections between brain regions, exploiting the high temporal resolution of the electroencephalographic signals recorded at the scalp or directly from the cortical surface or in deeper brain areas. In this paper we describe this specific class of algorithms and their clinical application, by reviewing the state of the art and reporting their application on EEG data from an epileptic patient
Modeling sparse connectivity between underlying brain sources for EEG/MEG
We propose a novel technique to assess functional brain connectivity in
EEG/MEG signals. Our method, called Sparsely-Connected Sources Analysis (SCSA),
can overcome the problem of volume conduction by modeling neural data
innovatively with the following ingredients: (a) the EEG is assumed to be a
linear mixture of correlated sources following a multivariate autoregressive
(MVAR) model, (b) the demixing is estimated jointly with the source MVAR
parameters, (c) overfitting is avoided by using the Group Lasso penalty. This
approach allows to extract the appropriate level cross-talk between the
extracted sources and in this manner we obtain a sparse data-driven model of
functional connectivity. We demonstrate the usefulness of SCSA with simulated
data, and compare to a number of existing algorithms with excellent results.Comment: 9 pages, 6 figure
- …