We consider the reconstruction of brain activity from electroencephalography (EEG). This inverse problem can be formulated as a linear regression with independent Gaussian scale mixture priors for both the source and noise components. Crucial factors influencing the accuracy of the source estimation are not only the noise level but also its correlation structure, but existing approaches have not addressed the estimation of noise covariance matrices with full structure. To address this shortcoming, we develop hierarchical Bayesian (type-II maximum likelihood) models for observations with latent variables for source and noise, which are estimated jointly from data. As an extension to classical sparse Bayesian learning (SBL), where across-sensor observations are assumed to be independent and identically distributed, we consider Gaussian noise with full covariance structure. Using the majorization-maximization framework and Riemannian geometry, we derive an efficient algorithm for updating the noise covariance along the manifold of positive definite matrices. We demonstrate that our algorithm has guaranteed and fast convergence and validate it in simulations and with real MEG data. Our results demonstrate that the novel framework significantly improves upon state-of-the-art techniques in the real-world scenario where the noise is indeed non-diagonal and full-structured. Our method has applications in many domains beyond biomagnetic inverse problems.

Reconstructing complex brain source activity at a high spatiotemporal resolution from magnetoencephalography (MEG) or electroencephalography (EEG) remains a challenging problem. Adaptive beamformers are routinely deployed for this imaging domain using the sample data covariance. However adaptive beamformers have long been hindered by 1) high degree of correlation between multiple brain sources, and 2) interference and noise embedded in sensor measurements. This study develops a novel framework for minimum variance adaptive beamformers that uses a model data covariance learned from data using a sparse Bayesian learning algorithm (SBL-BF). The learned model data covariance effectively removes influence from correlated brain sources and is robust to noise and interference without the need for baseline measurements. A multiresolution framework for model data covariance computation and parallelization of the beamformer implementation enables efficient high-resolution reconstruction images. Results with both simulations and real datasets indicate that multiple highly correlated sources can be accurately reconstructed, and that interference and noise can be sufficiently suppressed. Reconstructions at 2-2.5mm resolution ( ∼ 150K voxels) are possible with efficient run times of 1-3 minutes. This novel adaptive beamforming algorithm significantly outperforms the state-of-the-art benchmarks. Therefore, SBL-BF provides an effective framework for efficiently reconstructing multiple correlated brain sources with high resolution and robustness to interference and noise.

Several problems in neuroimaging and beyond require inference on the parameters of multi-task sparse hierarchical regression models. Examples include M/EEG inverse problems, neural encoding models for task-based fMRI analyses, and climate science. In these domains, both the model parameters to be inferred and the measurement noise may exhibit a complex spatio-temporal structure. Existing work either neglects the temporal structure or leads to computationally demanding inference schemes. Overcoming these limitations, we devise a novel flexible hierarchical Bayesian framework within which the spatio-temporal dynamics of model parameters and noise are modeled to have Kronecker product covariance structure. Inference in our framework is based on majorization-minimization optimization and has guaranteed convergence properties. Our highly efficient algorithms exploit the intrinsic Riemannian geometry of temporal autocovariance matrices. For stationary dynamics described by Toeplitz matrices, the theory of circulant embeddings is employed. We prove convex bounding properties and derive update rules of the resulting algorithms. On both synthetic and real neural data from M/EEG, we demonstrate that our methods lead to improved performance.