4.7 Article

Low-Rank Tucker-2 Model for Multi-Subject fMRI Data Decomposition With Spatial Sparsity Constraint

期刊

IEEE TRANSACTIONS ON MEDICAL IMAGING
卷 41, 期 3, 页码 667-679

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TMI.2021.3122226

关键词

Tucker decomposition; multi-subject fMRI data; sparsity constraint; low-rank; core tensor

资金

  1. National Natural Science Foundation of China [61871067, 61379012, 61901061, 61671106, 61331019, 81471742]
  2. National Science Foundation (NSF) [1539067, 0840895, 0715022]
  3. National Institutes of Health (NIH) [R01MH104680, R01MH107354, R01EB005846, 5P20GM103472, R56MH124925]
  4. Fundamental Research Funds for the Central Universities, China [DUT20ZD220]
  5. Supercomputing Center of Dalian University of Technology
  6. Division of Computing and Communication Foundations
  7. Direct For Computer & Info Scie & Enginr [GRANTS:13775188] Funding Source: National Science Foundation
  8. Division of Computing and Communication Foundations
  9. Direct For Computer & Info Scie & Enginr [0840895] Funding Source: National Science Foundation
  10. Div Of Information & Intelligent Systems
  11. Direct For Computer & Info Scie & Enginr [0715022] Funding Source: National Science Foundation

向作者/读者索取更多资源

Tucker decomposition is commonly used for analyzing multi-subject fMRI data, but traditional methods are insufficient for extracting common patterns across subjects. In this study, we propose a low rank Tucker-2 model with spatial sparsity constraint to analyze multi-subject fMRI data. The results demonstrate that this method is more effective in extracting common spatial and temporal components compared to other algorithms, and the features extracted from the core tensor show promise for subject classification.
Tuckerdecomposition can provide an intuitive summary to understand brain function by decomposing multi-subject fMRI data into a core tensor and multiple factor matrices, and was mostly used to extract functional connectivity patterns across time/subjects using orthogonality constraints. However, these algorithms are unsuitable for extracting common spatial and temporal patterns across subjects due to distinct characteristics such as high-level noise. Motivated by a successful application of Tucker decomposition to image denoising and the intrinsic sparsity of spatial activations in fMRI, we propose a low rank Tucker-2 model with spatial sparsity constraint to analyze multi-subject fMRI data. More precisely, we propose to impose a sparsity constraint on spatial maps by using an l(p) norm (0 < p <= 1), in addition to adding low-rank constraints on factormatrices via the Frobenius norm. We solve the constrained Tucker-2model using alternating direction method of multipliers, and propose to update both sparsity and low- rank constrained spatial maps using half quadratic splitting. Moreover, we extract new spatial and temporal features in addition to subject-specific intensities from the core tensor, and use these features to classify multiple subjects. The results from both simulated and experimental fMRI data verify the improvement of the proposed method, compared with four related algorithms including robust Kronecker component analysis, Tucker decomposition with orthogonality constraints, canonical polyadic decomposition, and block term decomposition in extracting common spatial and temporal components across subjects. The spatial and temporal features extracted from the core tensor show promise for characterizing subjects within the same group of patients or healthy controls as well.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据