MultiLink Analysis: Brain Network Comparison via Sparse Connectivity Analysis

Abstract The analysis of the brain from a connectivity perspective is revealing novel insights into brain structure and function. Discovery is, however, hindered by the lack of prior knowledge used to make hypotheses. Additionally, exploratory data analysis is made complex by the high dimensionality of data. Indeed, to assess the effect of pathological states on brain networks, neuroscientists are often required to evaluate experimental effects in case-control studies, with hundreds of thousands of connections. In this paper, we propose an approach to identify the multivariate relationships in brain connections that characterize two distinct groups, hence permitting the investigators to immediately discover the subnetworks that contain information about the differences between experimental groups. In particular, we are interested in data discovery related to connectomics, where the connections that characterize differences between two groups of subjects are found. Nevertheless, those connections do not necessarily maximize the accuracy in classification since this does not guarantee reliable interpretation of specific differences between groups. In practice, our method exploits recent machine learning techniques employing sparsity to deal with weighted networks describing the whole-brain macro connectivity. We evaluated our technique on functional and structural connectomes from human and murine brain data. In our experiments, we automatically identified disease-relevant connections in datasets with supervised and unsupervised anatomy-driven parcellation approaches and by using high-dimensional datasets

Tangent functional connectomes uncover more unique phenotypic traits

Functional connectomes (FCs) contain pairwise estimations of functional couplings based on pairs of brain regions activity. FCs are commonly represented as correlation matrices that are symmetric positive definite (SPD) lying on or inside the SPD manifold. Since the geometry on the SPD manifold is non-Euclidean, the inter-related entries of FCs undermine the use of Euclidean-based distances. By projecting FCs into a tangent space, we can obtain tangent functional connectomes (tangent-FCs). Tangent-FCs have shown a higher predictive power of behavior and cognition, but no studies have evaluated the effect of such projections with respect to fingerprinting. We hypothesize that tangent-FCs have a higher fingerprint than regular FCs. Fingerprinting was measured by identification rates (ID rates) on test-retest FCs as well as on monozygotic and dizygotic twins. Our results showed that identification rates are systematically higher when using tangent-FCs. Specifically, we found: (i) Riemann and log-Euclidean matrix references systematically led to higher ID rates. (ii) In tangent-FCs, Main-diagonal regularization prior to tangent space projection was critical for ID rate when using Euclidean distance, whereas barely affected ID rates when using correlation distance. (iii) ID rates were dependent on condition and fMRI scan length. (iv) Parcellation granularity was key for ID rates in FCs, as well as in tangent-FCs with fixed regularization, whereas optimal regularization of tangent-FCs mostly removed this effect. (v) Correlation distance in tangent-FCs outperformed any other configuration of distance on FCs or on tangent-FCs across the fingerprint gradient (here sampled by assessing test-retest, Monozygotic and Dizygotic twins). (vi)ID rates tended to be higher in task scans compared to resting-state scans when accounting for fMRI scan length.Comment: 29 pages, 10 figures, 2 table

Transport on Riemannian Manifold for Connectivity-based Brain Decoding

International audienceThere is a recent interest in using functional magnetic resonance imaging (fMRI) for decoding more naturalistic, cognitive states, in which subjects perform various tasks in a continuous, self-directed manner. In this setting, the set of brain volumes over the entire task duration is usually taken as a single sample with connectivity estimates, such as Pearson's correlation, employed as features. Since covariance matrices live on the positive semidefinite cone, their elements are inherently interrelated. The assumption of uncorrelated features implicit in most classifier learning algorithms is thus violated. Coupled with the usual small sample sizes, the generalizability of the learned classifiers is limited, and the identification of significant brain connections from the classifier weights is nontrivial. In this paper, we present a Riemannian approach for connectivity-based brain decoding. The core idea is to project the covariance estimates onto a common tangent space to reduce the statistical dependencies between their elements. For this, we propose a matrix whitening transport, and compare it against parallel transport implemented via the Schild's ladder algorithm. To validate our classification approach, we apply it to fMRI data acquired from twenty four subjects during four continuous, self-driven tasks. We show that our approach provides significantly higher classification accuracy than directly using Pearson's correlation and its regularized variants as features. To facilitate result interpretation, we further propose a non-parametric scheme that combines bootstrapping and permutation testing for identifying significantly discriminative brain connections from the classifier weights. Using this scheme, a number of neuro-anatomically meaningful connections are detected, whereas no significant connections are found with pure permutation testing