Manifold-regression to predict from MEG/EEG brain signals without source modeling
Magnetoencephalography and electroencephalography (M/EEG) can reveal neuronal dynamics non-invasively in real-time and are therefore appreciated methods in medicine and neuroscience. Recent advances in modeling brain-behavior relationships have highlighted the effectiveness of Riemannian geometry for summarizing the spatially correlated time-series from M/EEG in terms of their covariance. However, after artefact-suppression, M/EEG data is often rank deficient which limits the application of Riemannian concepts. In this article, we focus on the task of regression with rank-reduced covariance matrices. We study two Riemannian approaches that vectorize the M/EEG covariance between-sensors through projection into a tangent space. The Wasserstein distance readily applies to rank-reduced data but lacks affine-invariance. This can be overcome by finding a common subspace in which the covariance matrices are full rank, enabling the affine-invariant geometric distance. We investigated the implications of these two approaches in synthetic generative models, which allowed us to control estimation bias of a linear model for prediction. We show that Wasserstein and geometric distances allow perfect out-of-sample prediction on the generative models. We then evaluated the methods on real data with regard to their effectiveness in predicting age from M/EEG covariance matrices. The findings suggest that the data-driven Riemannian methods outperform different sensor-space estimators and that they get close to the performance of biophysics-driven source-localization model that requires MRI acquisitions and tedious data processing. Our study suggests that the proposed Riemannian methods can serve as fundamental building-blocks for automated large-scale analysis of M/EEG.
Code (1)
Tasks
EEGElectroencephalogram (EEG)regressionTime Series AnalysisSimilar Papers 제목 키워드 기반
Scalable Geometric Learning with Correlation-Based Functional Brain Networks
The correlation matrix is a central representation of functional brain networks in neuroimaging. Traditional analyses often treat pairwise interactions independently in a Euclidean setting, overlooking the intrinsic geom…
Dimensionality ReductionGeometry-Aware Deep Congruence Networks for Manifold Learning in Cross-Subject Motor Imagery
Cross-subject motor imagery decoding remains a fundamental challenge in EEG-based brain-computer interfaces due to substantial inter-subject variability. Recent approaches have leveraged Riemannian geometry by representi…
Eeg DecodingDecoding finger flexion from band-specific ECoG signals in humans
This article presents the method that won the brain-computer interface (BCI) competition IV addressed to the prediction of the finger flexion from electrocorticogram (ECoG) signals. ECoG-based BCIs have recently drawn th…
Brain Computer InterfaceBrain DecodingEEGElectroencephalogram (EEG)Riemannian-geometry-based modeling and clustering of network-wide non-stationary time series: The brain-network case
This paper advocates Riemannian multi-manifold modeling in the context of network-wide non-stationary time-series analysis. Time-series data, collected sequentially over time and across a network, yield features which ar…
ClusteringTime SeriesTime Series AnalysisDeep Learning Human Mind for Automated Visual Classification
What if we could effectively read the mind and transfer human visual capabilities to computer vision methods? In this paper, we aim at addressing this question by developing the first visual object classifier driven by h…
ClassificationDeep LearningEEGElectroencephalogram (EEG)+3