Low-rank tucker-2 model for multi-subject fmri data decomposition with spatial sparsity constraint

27Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Tucker decomposition 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 ℓ p norm (0

Cite

CITATION STYLE

APA

Lin, Q. H., Han, Y., Kuang, L. D., Gong, X. F., Cong, F., Wang, Y. P., & Calhoun, V. D. (2022). Low-rank tucker-2 model for multi-subject fmri data decomposition with spatial sparsity constraint. IEEE Transactions on Medical Imaging, 41(3), 667–679. https://doi.org/10.1109/TMI.2021.3122226

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free