Estimating Functional Connectivity Networks via Low-Rank Tensor Approximation With Applications to MCI Identification

Graph Convolutional Network With Self-Supervised Learning for Brain Disease Classification

Brain functional network (BFN) analysis has become a popular method for identifying neurological diseases at their early stages and revealing sensitive biomarkers related to these diseases. Due to the fact that BFN is a graph with complex structure, graph convolutional networks (GCNs) can be naturally used in the identification of BFN, and can generally achieve an encouraging performance if given large amounts of training data. In practice, however, it is very difficult to obtain sufficient brain functional data, especially from subjects with brain disorders. As a result, GCNs usually fail to learn a reliable feature representation from limited BFNs, leading to overfitting issues. In this paper, we propose an improved GCN method to classify brain diseases by introducing a self-supervised learning (SSL) module for assisting the graph feature representation. We conduct experiments to classify subjects with mild cognitive impairment (MCI) and autism spectrum disorder (ASD) respectively from normal controls (NCs). Experimental results on two benchmark databases demonstrate that our proposed scheme tends to obtain higher classification accuracy than the baseline methods.

Accurate module induced brain network construction for mild cognitive impairment identification with functional MRI

Introduction

Functional brain networks (FBNs) estimated from functional magnetic resonance imaging (fMRI) data has become a potentially useful way for computer-aided diagnosis of neurological disorders, such as mild cognitive impairment (MCI), a prodromal stage of Alzheimer's Disease (AD). Currently, Pearson's correlation (PC) is the most widely-used method for constructing FBNs. Despite its popularity and simplicity, the conventional PC-based method usually results in dense networks where regions-of-interest (ROIs) are densely connected. This is not accordance with the biological prior that ROIs may be sparsely connected in the brain. To address this issue, previous studies proposed to employ a threshold or l_1-regularizer to construct sparse FBNs. However, these methods usually ignore rich topology structures, such as modularity that has been proven to be an important property for improving the information processing ability of the brain.

Methods

To this end, in this paper, we propose an accurate module induced PC (AM-PC) model to estimate FBNs with a clear modular structure, by including sparse and low-rank constraints on the Laplacian matrix of the network. Based on the property that zero eigenvalues of graph Laplacian matrix indicate the connected components, the proposed method can reduce the rank of the Laplacian matrix to a pre-defined number and obtain FBNs with an accurate number of modules.

Results

To validate the effectiveness of the proposed method, we use the estimated FBNs to classify subjects with MCI from healthy controls. Experimental results on 143 subjects from Alzheimer's Disease Neuroimaging Initiative (ADNI) with resting-state functional MRIs show that the proposed method achieves better classification performance than previous methods.

Resting-State Functional MRI Adaptation with Attention Graph Convolution Network for Brain Disorder Identification

Multi-site resting-state functional magnetic resonance imaging (rs-fMRI) data can facilitate learning-based approaches to train reliable models on more data. However, significant data heterogeneity between imaging sites, caused by different scanners or protocols, can negatively impact the generalization ability of learned models. In addition, previous studies have shown that graph convolution neural networks (GCNs) are effective in mining fMRI biomarkers. However, they generally ignore the potentially different contributions of brain regions- of-interest (ROIs) to automated disease diagnosis/prognosis. In this work, we propose a multi-site rs-fMRI adaptation framework with attention GCN (A2GCN) for brain disorder identification. Specifically, the proposed A2GCN consists of three major components: (1) a node representation learning module based on GCN to extract rs-fMRI features from functional connectivity networks, (2) a node attention mechanism module to capture the contributions of ROIs, and (3) a domain adaptation module to alleviate the differences in data distribution between sites through the constraint of mean absolute error and covariance. The A2GCN not only reduces data heterogeneity across sites, but also improves the interpretability of the learning algorithm by exploring important ROIs. Experimental results on the public ABIDE database demonstrate that our method achieves remarkable performance in fMRI-based recognition of autism spectrum disorders.

Separating Stimulus-Induced and Background Components of Dynamic Functional Connectivity in Naturalistic fMRI

We consider the challenges in extracting stimulus-related neural dynamics from other intrinsic processes and noise in naturalistic functional magnetic resonance imaging (fMRI). Most studies rely on inter-subject correlations (ISC) of low-level regional activity and neglect varying responses in individuals. We propose a novel, data-driven approach based on low-rank plus sparse ( [Formula: see text]) decomposition to isolate stimulus-driven dynamic changes in brain functional connectivity (FC) from the background noise, by exploiting shared network structure among subjects receiving the same naturalistic stimuli. The time-resolved multi-subject FC matrices are modeled as a sum of a low-rank component of correlated FC patterns across subjects, and a sparse component of subject-specific, idiosyncratic background activities. To recover the shared low-rank subspace, we introduce a fused version of principal component pursuit (PCP) by adding a fusion-type penalty on the differences between the columns of the low-rank matrix. The method improves the detection of stimulus-induced group-level homogeneity in the FC profile while capturing inter-subject variability. We develop an efficient algorithm via a linearized alternating direction method of multipliers to solve the fused-PCP. Simulations show accurate recovery by the fused-PCP even when a large fraction of FC edges are severely corrupted. When applied to natural fMRI data, our method reveals FC changes that were time-locked to auditory processing during movie watching, with dynamic engagement of sensorimotor systems for speech-in-noise. It also provides a better mapping to auditory content in the movie than ISC.

Estimating High-Order Brain Functional Networks in Bayesian View for Autism Spectrum Disorder Identification

Brain functional network (BFN) has become an increasingly important tool to understand the inherent organization of the brain and explore informative biomarkers of neurological disorders. Pearson’s correlation (PC) is the most widely accepted method for constructing BFNs and provides a basis for designing new BFN estimation schemes. Particularly, a recent study proposes to use two sequential PC operations, namely, correlation’s correlation (CC), for constructing the high-order BFN. Despite its empirical effectiveness in identifying neurological disorders and detecting subtle changes of connections in different subject groups, CC is defined intuitively without a solid and sustainable theoretical foundation. For understanding CC more rigorously and providing a systematic BFN learning framework, in this paper, we reformulate it in the Bayesian view with a prior of matrix-variate normal distribution. As a result, we obtain a probabilistic explanation of CC. In addition, we develop a Bayesian high-order method (BHM) to automatically and simultaneously estimate the high- and low-order BFN based on the probabilistic framework. An efficient optimization algorithm is also proposed. Finally, we evaluate BHM in identifying subjects with autism spectrum disorder (ASD) from typical controls based on the estimated BFNs. Experimental results suggest that the automatically learned high- and low-order BFNs yield a superior performance over the artificially defined BFNs via conventional CC and PC.

Adaptive noise depression for functional brain network estimation

Autism spectrum disorder (ASD) is one common psychiatric illness that manifests in neurological and developmental disorders, which can last throughout a person's life and cause challenges in social interaction, communication, and behavior. Since the standard ASD diagnosis is highly based on the symptoms of the disease, it is difficult to make an early diagnosis to take the best cure opportunity. Compared to the standard methods, functional brain network (FBN) could reveal the statistical dependence among neural architectures in brains and provide potential biomarkers for the early neuro-disease diagnosis and treatment of some neurological disorders. However, there are few FBN estimation methods that take into account the noise during the data acquiring process, resulting in poor quality of FBN and thus poor diagnosis results. To address such issues, we provide a brand-new approach for estimating FBNs under a noise modeling framework. In particular, we introduce a noise term to model the representation errors and impose a regularizer to incorporate noise prior into FBNs estimation. More importantly, the proposed method can be formulated as conducting traditional FBN estimation based on transformed fMRI data, which means the traditional methods can be elegantly modified to support noise modeling. That is, we provide a plug-and-play noise module capable of being embedded into different methods and adjusted according to different noise priors. In the end, we conduct abundant experiments to identify ASD from normal controls (NCs) based on the constructed FBNs to illustrate the effectiveness and flexibility of the proposed method. Consequently, we achieved up to 13.04% classification accuracy improvement compared with the baseline methods.

Brain Function Network: Higher Order vs. More Discrimination

Brain functional network (BFN) has become an increasingly important tool to explore individual differences and identify neurological/mental diseases. For estimating a "good" BFN (with more discriminative information for example), researchers have developed various methods, in which the most popular and simplest is Pearson's correlation (PC). Despite its empirical effectiveness, PC only encodes the low-order (second-order) statistics between brain regions. To model high-order statistics, researchers recently proposed to estimate BFN by conducting two sequential PCs (denoted as PC ² in this paper), and found that PC ²-based BFN can provide additional information for group difference analysis. This inspires us to think about (1) what will happen if continuing the correlation operation to construct much higher-order BFN by PC ⁿ (n>2), and (2) whether the higher-order correlation will result in stronger discriminative ability. To answer these questions, we use PC ⁿ -based BFNs to predict individual differences (Female vs. Male) as well as identify subjects with mild cognitive impairment (MCI) from healthy controls (HCs). Through experiments, we have the following findings: (1) with the increase of n, the discriminative ability of PC ⁿ -based BFNs tends to decrease; (2) fusing the PC ⁿ -based BFNs (n>1) with the PC ¹-based BFN can generally improve the sensitivity for MCI identification, but fail to help the classification accuracy. In addition, we empirically find that the sequence of BFN adjacency matrices estimated by PC ⁿ (n = 1,2,3,⋯ ) will converge to a binary matrix with elements of ± 1.

Modularity-Guided Functional Brain Network Analysis for Early-Stage Dementia Identification

Function brain network (FBN) analysis has shown great potential in identifying brain diseases, such as Alzheimer's disease (AD) and its prodromal stage, namely mild cognitive impairment (MCI). It is essential to identify discriminative and interpretable features from function brain networks, so as to improve classification performance and help us understand the pathological mechanism of AD-related brain disorders. Previous studies usually extract node statistics or edge weights from FBNs to represent each subject. However, these methods generally ignore the topological structure (such as modularity) of FBNs. To address this issue, we propose a modular-LASSO feature selection (MLFS) framework that can explicitly model the modularity information to identify discriminative and interpretable features from FBNs for automated AD/MCI classification. Specifically, the proposed MLFS method first searches the modular structure of FBNs through a signed spectral clustering algorithm, and then selects discriminative features via a modularity-induced group LASSO method, followed by a support vector machine (SVM) for classification. To evaluate the effectiveness of the proposed method, extensive experiments are performed on 563 resting-state functional MRI scans from the public ADNI database to identify subjects with AD/MCI from normal controls and predict the future progress of MCI subjects. Experimental results demonstrate that our method is superior to previous methods in both tasks of AD/MCI identification and MCI conversion prediction, and also helps discover discriminative brain regions and functional connectivities associated with AD.

Learning Brain Functional Networks with Latent Temporal Dependency for MCI Identification

AbstractResting-state functional magnetic resonance imaging (rs-fMRI) has become a popular non-invasive way of diagnosing neurological disorders or their early stages by probing functional connectivity between different brain regions of interest (ROIs) across subjects. In the past decades, researchers have proposed many methods to estimate brain functional networks (BFNs) based on blood-oxygen-level-dependent (BOLD) signals captured by rs-fMRI. However, most of the existing methods estimate BFNs under the assumption that signals are independently sampled, which ignores the temporal dependency and sequential order of different time points (or volumes). To address this problem, in this paper, we first propose a novel BFN estimation model by introducing a latent variable to control the sequence of volumes for encoding the temporal dependency and sequential information of signals into the estimated BFNs. Then, we develop an efficient learning algorithm to solve the proposed model by the alternating optimization scheme. To verify the effectiveness of the proposed method, the estimated BFNs are used to identify subjects with mild cognitive impairment (MCIs) from normal controls (NCs). Experimental results show that our method outperforms the baseline methods in the sense of classification performance.

Constructing Dynamic Brain Functional Networks via Hyper-Graph Manifold Regularization for Mild Cognitive Impairment Classification

Brain functional networks (BFNs) constructed via manifold regularization (MR) have emerged as a powerful tool in finding new biomarkers for brain disease diagnosis. However, they only describe the pair-wise relationship between two brain regions, and cannot describe the functional interaction between multiple brain regions, or the high-order relationship, well. To solve this issue, we propose a method to construct dynamic BFNs (DBFNs) via hyper-graph MR (HMR) and employ it to classify mild cognitive impairment (MCI) subjects. First, we construct DBFNs via Pearson's correlation (PC) method and remodel the PC method as an optimization model. Then, we use k-nearest neighbor (KNN) algorithm to construct the hyper-graph and obtain the hyper-graph manifold regularizer based on the hyper-graph. We introduce the hyper-graph manifold regularizer and the L1-norm regularizer into the PC-based optimization model to optimize DBFNs and obtain the final sparse DBFNs (SDBFNs). Finally, we conduct classification experiments to classify MCI subjects from normal subjects to verify the effectiveness of our method. Experimental results show that the proposed method achieves better classification performance compared with other state-of-the-art methods, and the classification accuracy (ACC), the sensitivity (SEN), the specificity (SPE), and the area under the curve (AUC) reach 82.4946 ± 0.2827%, 77.2473 ± 0.5747%, 87.7419 ± 0.2286%, and 0.9021 ± 0.0007, respectively. This method expands the MR method and DBFNs with more biological significance. It can effectively improve the classification performance of DBFNs for MCI, and has certain reference value for the research and auxiliary diagnosis of Alzheimer's disease (AD).

Constructing Dynamic Functional Networks via Weighted Regularization and Tensor Low-Rank Approximation for Early Mild Cognitive Impairment Classification

Brain functional networks constructed via regularization has been widely used in early mild cognitive impairment (eMCI) classification. However, few methods can properly reflect the similarities and differences of functional connections among different people. Most methods ignore some topological attributes, such as connection strength, which may delete strong functional connections in brain functional networks. To overcome these limitations, we propose a novel method to construct dynamic functional networks (DFN) based on weighted regularization (WR) and tensor low-rank approximation (TLA), and apply it to identify eMCI subjects from normal subjects. First, we introduce the WR term into the DFN construction and obtain WR-based DFNs (WRDFN). Then, we combine the WRDFNs of all subjects into a third-order tensor for TLA processing, and obtain the DFN based on WR and TLA (WRTDFN) of each subject in the tensor. We calculate the weighted-graph local clustering coefficient of each region in each WRTDFN as the effective feature, and use the t-test for feature selection. Finally, we train a linear support vector machine (SVM) classifier to classify the WRTDFNs of all subjects. Experimental results demonstrate that the proposed method can obtain DFNs with the scale-free property, and that the classification accuracy (ACC), the sensitivity (SEN), the specificity (SPE), and the area under curve (AUC) reach 87.0662% ± 0.3202%, 83.4363% ± 0.5076%, 90.6961% ± 0.3250% and 0.9431 ± 0.0023, respectively. We also achieve the best classification results compared with other comparable methods. This work can effectively improve the classification performance of DFNs constructed by existing methods for eMCI and has certain reference value for the early diagnosis of Alzheimer’s disease (AD).