Nonparametric Statistical Thresholding for Sparse Magnetoencephalography Source Reconstructions

Frontiers in Neuroscience

Kensuke eSekihara¹  Julia Parsons Owen²  Srikantan S. Nagarajan² 

[1] Tokyo MetropolitanUniversity;University of California, San Francisco;

关键词: Magnetoencephalography;    nonparametric statistics;    sparse source reconstructions;    maximal stastic;    noninvasive brain imaging;    maximal statistic;   

DOI  :  10.3389/fnins.2012.00186

来源: DOAJ

【 摘 要 】

Uncovering brain activity from MEG data requires solving an ill-posed inverse problem, greatly confounded by noise, interference, and correlated sources.Sparse reconstruction algorithms, such as Champagne, show great promise in that they provide focal brain activations robust to these confounds. In this paper, we address the technical considerations of statistically thresholding brain images obtained from sparse reconstruction algorithms. The source power distribution of sparse algorithms makes this class of algorithms ill-suited to "conventional" techniques.We propose two nonparametric resampling methods hypothesized to be compatible with sparse algorithms.The first adapts the maximal statistic procedure to sparse reconstruction results and the second departs from maximal statistics, putting forth a less stringent procedure that protects against spurious peaks.Three MEG data sets are utilized to demonstrate the efficacy of the proposed methods. Two sparse algorithms, Champagne and generalized minimum current estimation (G-MCE), are compared to two non-sparse algorithms, a variant of minimum-norm estimation, sLORETA, and an adaptive beamformer.The results, in general, demonstrate that the already sparse images obtained from Champagne and G-MCE are further thresholded by both proposed statistical thresholding procedures.While non-sparse algorithms are thresholded by the maximal statistic procedure, they are not made sparse.The work presented here is one of the first attempts to address the problem of statistically thresholding sparse reconstructions, and aims to improve upon this already advantageous and powerful class of algorithm.

【 授权许可】

Unknown