TY - JOUR
T1 - Weighted graph regularized sparse brain network construction for MCI identification
AU - Yu, Renping
AU - Qiao, Lishan
AU - Chen, Mingming
AU - Lee, Seong Whan
AU - Fei, Xuan
AU - Shen, Dinggang
N1 - Funding Information:
This work was partly supported by National Natural Science Foundation of China ( 61803342 , 61773208 , and 61501241 ), Key Technologies Research and Development Program of Henan Province ( 192102310190 , 182102210092 , 132102210560 ), Key Project at Central Government Level (2060302) and NIH grant (EB022880). Dr. S.-W. Lee was partially supported by Institute for Information & Communications Technology Promotion grant (No. 2017-0-00451).
Funding Information:
This work was partly supported by National Natural Science Foundation of China (61803342, 61773208, and 61501241), Key Technologies Research and Development Program of Henan Province (192102310190, 182102210092, 132102210560), Key Project at Central Government Level (2060302) and NIH grant (EB022880). Dr. S.-W. Lee was partially supported by Institute for Information & Communications Technology Promotion grant (No. 2017-0-00451).
Publisher Copyright:
© 2019 Elsevier Ltd
PY - 2019/6
Y1 - 2019/6
N2 - Brain functional networks (BFNs) constructed from resting-state functional magnetic resonance imaging (rs-fMRI) have been widely applied to the analysis and diagnosis of brain diseases, such as Alzheimer's disease and its prodrome, namely mild cognitive impairment (MCI). Constructing a meaningful brain network based on, for example, sparse representation (SR) is the most essential step prior to the subsequent analysis or disease identification. However, the independent coding process of SR fails to capture the intrinsic locality and similarity characteristics in the data. To address this problem, we propose a novel weighted graph (Laplacian) regularized SR framework, based on which BFN can be optimized by considering both intrinsic correlation similarity and local manifold structure in the data, as well as sparsity prior of the brain connectivity. Additionally, the non-convergence of the graph Laplacian in the self-representation model has been solved properly. Combined with a pipeline of sparse feature selection and classification, the effectiveness of our proposed method is demonstrated by identifying MCI based on the constructed BFNs.
AB - Brain functional networks (BFNs) constructed from resting-state functional magnetic resonance imaging (rs-fMRI) have been widely applied to the analysis and diagnosis of brain diseases, such as Alzheimer's disease and its prodrome, namely mild cognitive impairment (MCI). Constructing a meaningful brain network based on, for example, sparse representation (SR) is the most essential step prior to the subsequent analysis or disease identification. However, the independent coding process of SR fails to capture the intrinsic locality and similarity characteristics in the data. To address this problem, we propose a novel weighted graph (Laplacian) regularized SR framework, based on which BFN can be optimized by considering both intrinsic correlation similarity and local manifold structure in the data, as well as sparsity prior of the brain connectivity. Additionally, the non-convergence of the graph Laplacian in the self-representation model has been solved properly. Combined with a pipeline of sparse feature selection and classification, the effectiveness of our proposed method is demonstrated by identifying MCI based on the constructed BFNs.
KW - Brain functional network
KW - Graph Laplacian regularization
KW - Mild cognitive impairment (MCI)
KW - Sparse representation
UR - http://www.scopus.com/inward/record.url?scp=85060890069&partnerID=8YFLogxK
U2 - 10.1016/j.patcog.2019.01.015
DO - 10.1016/j.patcog.2019.01.015
M3 - Article
AN - SCOPUS:85060890069
SN - 0031-3203
VL - 90
SP - 220
EP - 231
JO - Pattern Recognition
JF - Pattern Recognition
ER -