Weighted graph regularized sparse brain network construction for MCI identification

Renping Yu, Lishan Qiao, Mingming Chen, Seong Whan Lee, Xuan Fei, Dinggang Shen

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)220-231
Number of pages12
JournalPattern Recognition
Volume90
DOIs
Publication statusPublished - 2019 Jun 1

Fingerprint

Brain
Feature extraction
Pipelines

Keywords

  • Brain functional network
  • Graph Laplacian regularization
  • Mild cognitive impairment (MCI)
  • Sparse representation

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence

Cite this

Weighted graph regularized sparse brain network construction for MCI identification. / Yu, Renping; Qiao, Lishan; Chen, Mingming; Lee, Seong Whan; Fei, Xuan; Shen, Dinggang.

In: Pattern Recognition, Vol. 90, 01.06.2019, p. 220-231.

Research output: Contribution to journalArticle

Yu, Renping ; Qiao, Lishan ; Chen, Mingming ; Lee, Seong Whan ; Fei, Xuan ; Shen, Dinggang. / Weighted graph regularized sparse brain network construction for MCI identification. In: Pattern Recognition. 2019 ; Vol. 90. pp. 220-231.
@article{9dd03b87d5504572bdf024c07d984d58,
title = "Weighted graph regularized sparse brain network construction for MCI identification",
abstract = "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.",
keywords = "Brain functional network, Graph Laplacian regularization, Mild cognitive impairment (MCI), Sparse representation",
author = "Renping Yu and Lishan Qiao and Mingming Chen and Lee, {Seong Whan} and Xuan Fei and Dinggang Shen",
year = "2019",
month = "6",
day = "1",
doi = "10.1016/j.patcog.2019.01.015",
language = "English",
volume = "90",
pages = "220--231",
journal = "Pattern Recognition",
issn = "0031-3203",
publisher = "Elsevier Limited",

}

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

PY - 2019/6/1

Y1 - 2019/6/1

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

UR - http://www.scopus.com/inward/citedby.url?scp=85060890069&partnerID=8YFLogxK

U2 - 10.1016/j.patcog.2019.01.015

DO - 10.1016/j.patcog.2019.01.015

M3 - Article

VL - 90

SP - 220

EP - 231

JO - Pattern Recognition

JF - Pattern Recognition

SN - 0031-3203

ER -