Search PubMed⌕ Search

Biomedical subjects

Bertrand Thirion

Publications and source records attributed to Bertrand Thirion.

8 recordsLinked to original sources

Inverse retinotopy: inferring the visual content of images from brain activation patterns.

Traditional inference in neuroimaging consists in describing brain activations elicited and modulated by different kinds of stimuli. Recently, however, paradigms have been studied in which the converse operation is performed, thus inferring behavioral or mental states associated with activation images. Here, we use the well-known retinotopy of the visual cortex to infer the visual content of real or imaginary scenes from the brain activation patterns that they elicit. We present two decoding algorithms: an explicit technique, based on the current knowledge of the retinotopic structure of the visual areas, and an implicit technique, based on supervised classifiers. Both algorithms predicted the stimulus identity with significant accuracy. Furthermore, we extend this principle to mental imagery data: in five data sets, our algorithms could reconstruct and predict with significant accuracy a pattern imagined by the subjects.

Humans↗

Dealing with the shortcomings of spatial normalization: multi-subject parcellation of fMRI datasets.

The analysis of functional magnetic resonance imaging (fMRI) data recorded on several subjects resorts to the so-called spatial normalization in a common reference space. This normalization is usually carried out on a voxel-by-voxel basis, assuming that after coregistration of the functional images with an anatomical template image in the Talairach reference system, a correct voxel-based inference can be carried out across subjects. Shortcomings of such approaches are often dealt with by spatially smoothing the data to increase the overlap between subject-specific activated regions. This procedure, however, cannot adapt to each anatomo-functional subject configuration. We introduce a novel technique for intra-subject parcellation based on spectral clustering that delineates homogeneous and connected regions. We also propose a hierarchical method to derive group parcels that are spatially coherent across subjects and functionally homogeneous. We show that we can obtain groups (or cliques) of parcels that well summarize inter-subject activations. We also show that the spatial relaxation embedded in our procedure improves the sensitivity of random-effect analysis.

Algorithms↗

Combined permutation test and mixed-effect model for group average analysis in fMRI.

In group average analyses, we generalize the classical one-sample t test to account for heterogeneous within-subject uncertainties associated with the estimated effects. Our test statistic is defined as the maximum likelihood ratio corresponding to a Gaussian mixed-effect model. The test's significance level is calibrated using the same sign permutation framework as in Holmes et al., allowing for exact specificity control under a mild symmetry assumption about the subjects' distribution. Because our likelihood ratio test does not rely on homoscedasticity, it is potentially more sensitive than both the standard t test and its permutation-based version. We present results from the Functional Imaging Analysis Contest 2005 dataset to support this claim.

Algorithms↗

Detection of signal synchronizations in resting-state fMRI datasets.

In this paper, we propose a generic framework for the analysis of steady-state fMRI datasets, applied here to resting-state datasets. Our approach avoids the introduction of user-defined seed regions for the study of spontaneous activity. Unlike existing techniques, it yields a sparse representation of resting-state activity networks which can be characterized and investigated fairly easily in a semi-interactive fashion. We proceed in several steps, based on the idea that spectral coherence of the fMRI time courses in the low frequency band carries the information of interest. In particular, we address the question of building adapted representations of the data from the spectral coherence matrix. We analyze nine datasets taken from three subjects and show resting-state networks validated by EEG-fMRI simultaneous acquisition literature, with low intra-subject variability; we also discuss the merits of different (rapid/slow) fMRI acquisition schemes.

Algorithms↗

Finding landmarks in the functional brain: detection and use for group characterization.

FMRI group studies are usually based on stereotactic spatial normalization and present voxel by voxel average activity across subjects. This technique does not in general adequately model the inter subject spatial variability. In this work, we propose to identify functional landmarks that are reliable across subjects with subject specific Talairach coordinates that are similar -but not exactly identical- between subjects. We call these Brain Functional Landmarks (BFLs), and define them based on cross-validation techniques using 38 subjects. We explore a dataset acquired while subjects were involved in several cognitive and sensori-motor processes, and show that this representation allows to classify subjects into sub-groups on the basis of their BFL activity.

Algorithms↗

Feature characterization in fMRI data: the Information Bottleneck approach.

Clustering is a well-known technique for the analysis of Functional Magnetic Resonance Imaging (fMRI) data, whose main advantage is certainly flexibility: given a metric on the dataset, it "summarizes" the main characteristics of the data. But intrinsic to this approach are also the problem of defining correctly the quantization accuracy, and the number of clusters necessary to describe the data. The Information Bottleneck (IB) approach to vector quantization, proposed by Bialek and Tishby, addresses these difficulties: (1) it deals with an explicit trade-off between quantization and data fidelity; (2) it does so during the clustering procedure and not post hoc; (3) it takes into account the full statistical distribution of the features within the feature space and not only their most likely value; last, it is principled through an information theoretic formulation, which is relevant in many situations. In this paper, we present how to benefit from this method to analyze fMRI data. Our application is the clustering of voxels according to the magnitude of their responses to several experimental conditions. The IB quantization provides a consistent representation of the data, allowing for an easy interpretation and comparison of datasets.

Algorithms↗

Variational, geometric, and statistical methods for modeling brain anatomy and function.

We survey the recent activities of the Odyssée Laboratory in the area of the application of mathematics to the design of models for studying brain anatomy and function. We start with the problem of reconstructing sources in MEG and EEG, and discuss the variational approach we have developed for solving these inverse problems. This motivates the need for geometric models of the head. We present a method for automatically and accurately extracting surface meshes of several tissues of the head from anatomical magnetic resonance (MR) images. Anatomical connectivity can be extracted from diffusion tensor magnetic resonance images but, in the current state of the technology, it must be preceded by a robust estimation and regularization stage. We discuss our work based on variational principles and show how the results can be used to track fibers in the white matter (WM) as geodesics in some Riemannian space. We then go to the statistical modeling of functional magnetic resonance imaging (fMRI) signals from the viewpoint of their decomposition in a pseudo-deterministic and stochastic part that we then use to perform clustering of voxels in a way that is inspired by the theory of support vector machines and in a way that is grounded in information theory. Multimodal image matching is discussed next in the framework of image statistics and partial differential equations (PDEs) with an eye on registering fMRI to the anatomy. The paper ends with a discussion of a new theory of random shapes that may prove useful in building anatomical and functional atlases.

Algorithms↗

Dynamical components analysis of fMRI data through kernel PCA.

In parallel with standard model-based methods for the analysis of fMRI data, exploratory methods--such as PCA, ICA, and clustering--have been developed to give an account of the dataset with minimal priors: no assumption is made on the data content itself, but the data structure is assumed to show some properties (decorrelation, independence) that allow for the detection of structures of interest. In this paper, we present an alternative that tries to take into account some relevant knowledge for the analysis of the dataset, e.g., the experimental paradigm, while keeping the flexibility of exploratory methods: we use a prior temporal modeling of the data that characterizes each voxel time course. Two implementations are proposed: one based on the General Linear Model, the other one on more flexible short-term predictors, whose complexity is controlled by a Minimum Description Length approach. However, our main concern here is the construction of a multivariate model; the latter is performed with the help of a kernel PCA method that builds a redundant representation of the data through the nonlinearity of the kernel. This allows for a refinement in the description of the (temporal) patterns of interest. In particular, this helps in the characterization of subtle variations in the response to different experimental conditions. We illustrate the usefulness of nonlinearity through the analysis of a synthetic dataset and show on a real dataset how it helps to interpret the experimental results.

Algorithms↗