TY - JOUR
T1 - Accessing dynamic functional connectivity using l0-regularized sparse-smooth inverse covariance estimation from fMRI
AU - Zhang, Li
AU - Fu, Zening
AU - Zhang, Wenwen
AU - Huang, Gan
AU - Liang, Zhen
AU - Li, Linling
AU - Biswal, Bharat B.
AU - Calhoun, Vince D.
AU - Zhang, Zhiguo
N1 - Publisher Copyright:
© 2021 Elsevier B.V.
PY - 2021/7/5
Y1 - 2021/7/5
N2 - Inferring dynamic functional connectivity (dFC) from functional magnetic resonance imaging (fMRI) is crucial to understand the time-variant functional inter-relationships among brain regions. Because of the sparse property of functional connectivity networks, sparsity-promoting dFC estimation methods, which are mainly based on l1-norm regularization, are gaining popularity. However, l1-norm regularization cannot provide the maximum sparsity solution as the most natural sparsity promoting norm, the l0-norm. But l0-norm is seldom used to infer sparse dFC because an efficient algorithm to address the non-convexity problem of l0-norm is lacking. In this work, we develop a new l0-norm regularization-based inverse covariance estimation method for estimating dFC from fMRI. This novel method employs l0-norm regularizations on both spatial and temporal scales to enhance the spatial sparsity and temporal smoothness of dFC estimates. To overcome the non-convexity of l0-norm, we further propose an effective optimization algorithm based on the coordinate descent (CD). The performance of the proposed l0-norm-based sparse-smooth regularization (L0-SSR) method is examined using a series of synthetic datasets concerning various types of network topology. We further apply the proposed L0-SSR method to real fMRI data recorded in block-design motor tasks from 45 participants for the exploration of task induced dFC. Results on synthetic and real-world fMRI data show that, the L0-SSR method can achieve more accurate and interpretable dFC estimates than conventional l1-norm-based dFC estimation methods. Hence, the proposed L0-SSR method could serve as a powerful analytical tool to infer highly complex, variable, and sparse dFC patterns.
AB - Inferring dynamic functional connectivity (dFC) from functional magnetic resonance imaging (fMRI) is crucial to understand the time-variant functional inter-relationships among brain regions. Because of the sparse property of functional connectivity networks, sparsity-promoting dFC estimation methods, which are mainly based on l1-norm regularization, are gaining popularity. However, l1-norm regularization cannot provide the maximum sparsity solution as the most natural sparsity promoting norm, the l0-norm. But l0-norm is seldom used to infer sparse dFC because an efficient algorithm to address the non-convexity problem of l0-norm is lacking. In this work, we develop a new l0-norm regularization-based inverse covariance estimation method for estimating dFC from fMRI. This novel method employs l0-norm regularizations on both spatial and temporal scales to enhance the spatial sparsity and temporal smoothness of dFC estimates. To overcome the non-convexity of l0-norm, we further propose an effective optimization algorithm based on the coordinate descent (CD). The performance of the proposed l0-norm-based sparse-smooth regularization (L0-SSR) method is examined using a series of synthetic datasets concerning various types of network topology. We further apply the proposed L0-SSR method to real fMRI data recorded in block-design motor tasks from 45 participants for the exploration of task induced dFC. Results on synthetic and real-world fMRI data show that, the L0-SSR method can achieve more accurate and interpretable dFC estimates than conventional l1-norm-based dFC estimation methods. Hence, the proposed L0-SSR method could serve as a powerful analytical tool to infer highly complex, variable, and sparse dFC patterns.
KW - Dynamic functional connectivity
KW - Inverse covariance estimation
KW - Sparse network
KW - Spatial–temporal smoothness constraints
KW - l-regularization
UR - http://www.scopus.com/inward/record.url?scp=85103108600&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85103108600&partnerID=8YFLogxK
U2 - 10.1016/j.neucom.2021.02.081
DO - 10.1016/j.neucom.2021.02.081
M3 - Article
AN - SCOPUS:85103108600
SN - 0925-2312
VL - 443
SP - 147
EP - 161
JO - Neurocomputing
JF - Neurocomputing
ER -