Shift-Invariant Canonical Polyadic Decomposition of Complex-Valued Multi-Subject fMRI Data With a Phase Sparsity Constraint

IEEE Trans Med Imaging. 2020 Apr;39(4):844-853. doi: 10.1109/TMI.2019.2936046. Epub 2019 Aug 19.

Abstract

Canonical polyadic decomposition (CPD) of multi-subject complex-valued fMRI data can be used to provide spatially and temporally shared components among groups with both magnitude and phase information. However, the CPD model is not well formulated due to the large subject variability in the spatial and temporal modalities, as well as the high noise level in complex-valued fMRI data. Considering that the shift-invariant CPD can model temporal variability across subjects, we propose to further impose a phase sparsity constraint on the shared spatial maps to denoise the complex-valued components and to model the inter-subject spatial variability as well. More precisely, subject-specific time delays are first estimated for the complex-valued shared time courses in the framework of real-valued shift-invariant CPD. Source phase sparsity is then imposed on the complex-valued shared spatial maps. A smoothed l0 norm is specifically used to reduce voxels with large phase values after phase de-ambiguity based on the small phase characteristic of BOLD-related voxels. The results from both the simulated and experimental fMRI data demonstrate improvements of the proposed method over three complex-valued algorithms, namely, tensor-based spatial ICA, shift-invariant CPD and CPD without spatiotemporal constraints. When comparing with a real-valued algorithm combining shift-invariant CPD and ICA, the proposed method detects 178.7% more contiguous task-related activations.

Publication types

  • Research Support, N.I.H., Extramural
  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms
  • Brain / diagnostic imaging
  • Humans
  • Image Processing, Computer-Assisted / methods*
  • Magnetic Resonance Imaging / methods*
  • Signal Processing, Computer-Assisted*