Separating Stimulus-Induced and Background Components of Dynamic Functional Connectivity in Naturalistic fMRI

• URL: http://arxiv.org/abs/2102.10331v1
• Date: Sun, 24 Jan 2021 11:35:39 GMT
• Title: Separating Stimulus-Induced and Background Components of Dynamic Functional Connectivity in Naturalistic fMRI
• Authors: Chee-Ming Ting, Jeremy I. Skipper, Steven L. Small, Hernando Ombao
• Abstract summary: We propose a novel, data-driven approach to isolate stimulus-driven dynamic changes in brain functional connectivity (FC) from the background noise. To recover the shared low-rank subspace, we introduce a fusion-type penalty on the differences between the rows of the low-rank matrix. We develop an efficient algorithm via a linearized alternating direction method of multipliers to solve the fused-PCP.
• Score: 13.112514419777593
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We consider the challenges in extracting stimulus-related neural dynamics from other intrinsic processes and noise in naturalistic functional magnetic resonance imaging (fMRI). Most studies rely on inter-subject correlations (ISC) of low-level regional activity and neglect varying responses in individuals. We propose a novel, data-driven approach based on low-rank plus sparse (L+S) decomposition to isolate stimulus-driven dynamic changes in brain functional connectivity (FC) from the background noise, by exploiting shared network structure among subjects receiving the same naturalistic stimuli. The time-resolved multi-subject FC matrices are modeled as a sum of a low-rank component of correlated FC patterns across subjects, and a sparse component of subject-specific, idiosyncratic background activities. To recover the shared low-rank subspace, we introduce a fused version of principal component pursuit (PCP) by adding a fusion-type penalty on the differences between the rows of the low-rank matrix. The method improves the detection of stimulus-induced group-level homogeneity in the FC profile while capturing inter-subject variability. We develop an efficient algorithm via a linearized alternating direction method of multipliers to solve the fused-PCP. Simulations show accurate recovery by the fused-PCP even when a large fraction of FC edges are severely corrupted. When applied to natural fMRI data, our method reveals FC changes that were time-locked to auditory processing during movie watching, with dynamic engagement of sensorimotor systems for speech-in-noise. It also provides a better mapping to auditory content in the movie than ISC.

Related papers

• Interpretable Spatio-Temporal Embedding for Brain Structural-Effective Network with Ordinary Differential Equation [56.34634121544929]
  In this study, we first construct the brain-effective network via the dynamic causal model. We then introduce an interpretable graph learning framework termed Spatio-Temporal Embedding ODE (STE-ODE) This framework incorporates specifically designed directed node embedding layers, aiming at capturing the dynamic interplay between structural and effective networks.
  arXiv  Detail & Related papers  (2024-05-21T20:37:07Z)
• Capturing functional connectomics using Riemannian partial least squares [0.0]
  For neurological disorders and diseases, functional and anatomical connectomes of the human brain can be used to better inform interventions and treatment strategies. One approach to analysing functional connectivity is using partial least squares (PLS), a multivariate regression technique designed for high-dimensional predictor data.
  arXiv  Detail & Related papers  (2023-06-30T02:24:34Z)
• The Predictive Forward-Forward Algorithm [79.07468367923619]
  We propose the predictive forward-forward (PFF) algorithm for conducting credit assignment in neural systems. We design a novel, dynamic recurrent neural system that learns a directed generative circuit jointly and simultaneously with a representation circuit. PFF efficiently learns to propagate learning signals and updates synapses with forward passes only.
  arXiv  Detail & Related papers  (2023-01-04T05:34:48Z)
• fMRI from EEG is only Deep Learning away: the use of interpretable DL to unravel EEG-fMRI relationships [68.8204255655161]
  We present an interpretable domain grounded solution to recover the activity of several subcortical regions from multichannel EEG data. We recover individual spatial and time-frequency patterns of scalp EEG predictive of the hemodynamic signal in the subcortical nuclei.
  arXiv  Detail & Related papers  (2022-10-23T15:11:37Z)
• Spatio-temporally separable non-linear latent factor learning: an application to somatomotor cortex fMRI data [0.0]
  Models of fMRI data that can perform whole-brain discovery of latent factors are understudied. New methods for efficient spatial weight-sharing are critical to deal with the high dimensionality of the data and the presence of noise. Our approach is evaluated on data with multiple motor sub-tasks to assess whether the model captures disentangled latent factors that correspond to each sub-task.
  arXiv  Detail & Related papers  (2022-05-26T21:30:22Z)
• Cross-Frequency Coupling Increases Memory Capacity in Oscillatory Neural Networks [69.42260428921436]
  Cross-frequency coupling (CFC) is associated with information integration across populations of neurons. We construct a model of CFC which predicts a computational role for observed $theta - gamma$ oscillatory circuits in the hippocampus and cortex. We show that the presence of CFC increases the memory capacity of a population of neurons connected by plastic synapses.
  arXiv  Detail & Related papers  (2022-04-05T17:13:36Z)
• Learning shared neural manifolds from multi-subject FMRI data [13.093635609349874]
  We propose a neural network called MRMD-AEmani that learns a common embedding from multiple subjects in an experiment. We show that our learned common space represents antemporal manifold (where new points not seen during training can be mapped), improves the classification of stimulus features of unseen timepoints. We believe this framework can be used for many downstream applications such as guided brain-computer interface (BCI) training in the future.
  arXiv  Detail & Related papers  (2021-12-22T23:08:39Z)
• Complex-valued Federated Learning with Differential Privacy and MRI Applications [51.34714485616763]
  We introduce the complex-valued Gaussian mechanism, whose behaviour we characterise in terms of $f$-DP, $(varepsilon, delta)$-DP and R'enyi-DP. We present novel complex-valued neural network primitives compatible with DP. Experimentally, we showcase a proof-of-concept by training federated complex-valued neural networks with DP on a real-world task.
  arXiv  Detail & Related papers  (2021-10-07T14:03:00Z)
• Identification of brain states, transitions, and communities using functional MRI [0.5872014229110214]
  We propose a Bayesian model-based characterization of latent brain states and showcase a novel method based on posterior predictive discrepancy. Our results obtained through an analysis of task-fMRI data show appropriate lags between external task demands and change-points between brain states.
  arXiv  Detail & Related papers  (2021-01-26T08:10:00Z)
• Augmenting interictal mapping with neurovascular coupling biomarkers by structured factorization of epileptic EEG and fMRI data [3.2268407474728957]
  We develop a novel structured matrix-tensor factorization for EEG-fMRI analysis. We show that the extracted source signatures provide a sensitive localization of the ictal onset zone. We also show that complementary localizing information can be derived from the spatial variation of the hemodynamic response.
  arXiv  Detail & Related papers  (2020-04-29T13:27:45Z)
• Kullback-Leibler Divergence-Based Fuzzy $C$-Means Clustering Incorporating Morphological Reconstruction and Wavelet Frames for Image Segmentation [152.609322951917]
  We come up with a Kullback-Leibler (KL) divergence-based Fuzzy C-Means (FCM) algorithm by incorporating a tight wavelet frame transform and a morphological reconstruction operation. The proposed algorithm works well and comes with better segmentation performance than other comparative algorithms.
  arXiv  Detail & Related papers  (2020-02-21T05:19:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.