5 research outputs found
High-level cognition during story listening is reflected in high-order dynamic correlations in neural activity patterns
Our thoughts arise from coordinated patterns of interactions between brain structures that change with our ongoing experiences. High-order dynamic correlations in neural activity patterns reflect different subgraphs of the brain’s functional connectome that display homologous lower-level dynamic correlations. Here we test the hypothesis that high-level cognition is reflected in high-order dynamic correlations in brain activity patterns. We develop an approach to estimating high-order dynamic correlations in timeseries data, and we apply the approach to neuroimaging data collected as human participants either listen to a ten-minute story or listen to a temporally scrambled version of the story. We train across-participant pattern classifiers to decode (in held-out data) when in the session each neural activity snapshot was collected. We find that classifiers trained to decode from high-order dynamic correlations yield the best performance on data collected as participants listened to the (unscrambled) story. By contrast, classifiers trained to decode data from scrambled versions of the story yielded the best performance when they were trained using first-order dynamic correlations or non-correlational activity patterns. We suggest that as our thoughts become more complex, they are reflected in higher-order patterns of dynamic network interactions throughout the brain
Incorporating structured assumptions with probabilistic graphical models in fMRI data analysis
With the wide adoption of functional magnetic resonance imaging (fMRI) by
cognitive neuroscience researchers, large volumes of brain imaging data have
been accumulated in recent years. Aggregating these data to derive scientific
insights often faces the challenge that fMRI data are high-dimensional,
heterogeneous across people, and noisy. These challenges demand the development
of computational tools that are tailored both for the neuroscience questions
and for the properties of the data. We review a few recently developed
algorithms in various domains of fMRI research: fMRI in naturalistic tasks,
analyzing full-brain functional connectivity, pattern classification, inferring
representational similarity and modeling structured residuals. These algorithms
all tackle the challenges in fMRI similarly: they start by making clear
statements of assumptions about neural data and existing domain knowledge,
incorporating those assumptions and domain knowledge into probabilistic
graphical models, and using those models to estimate properties of interest or
latent structures in the data. Such approaches can avoid erroneous findings,
reduce the impact of noise, better utilize known properties of the data, and
better aggregate data across groups of subjects. With these successful cases,
we advocate wider adoption of explicit model construction in cognitive
neuroscience. Although we focus on fMRI, the principle illustrated here is
generally applicable to brain data of other modalities.Comment: update with the version accepted by Neuropsychologi
Recommended from our members
A probabilistic approach to discovering dynamic full-brain functional connectivity patterns
Recent work indicates that the covariance structure of functional magnetic resonance imaging (fMRI) data – commonly described as functional connectivity – can change as a function of the participant’s cognitive state (for review see [32]). Here we present a technique, termed hierarchical topographic factor analysis (HTFA), for efficiently discovering full-brain networks in large multi-subject neuroimaging datasets. HTFA approximates each
subject’s network by first re-representing each brain image in terms of the activations of a set of localized nodes, and then computing the covariance of the activation time series of these nodes. The number of nodes, along with their locations, sizes, and activations (over time) are learned from the data. Because the number of nodes is typically substantially smaller than the number of fMRI voxels, HTFA can be orders of magnitude more efficient
than traditional voxel-based functional connectivity approaches. In one case study, we show that HTFA recovers the known connectivity patterns underlying a synthetic dataset. In a second case study, we illustrate how HTFA may be used to discover dynamic full-brain activity and connectivity patterns in real fMRI data, collected as participants listened to a story. In a third case study, we carried out a similar series of analyses on fMRI data collected as participants viewed an episode of a television show. In these latter case studies, we found
that both the HTFA-derived activity and connectivity patterns may be used to reliably decode which moments in the story or show the participants were experiencing. Further, we found that these two classes of patterns contained partially non-overlapping information, such that classifiers trained on combinations of activity-based and dynamic connectivity-based features performed better than classifiers trained on activity or connectivity patterns
alone
Recommended from our members
A probabilistic approach to discovering dynamic full-brain functional connectivity patterns
Recent work indicates that the covariance structure of functional magnetic resonance imaging (fMRI) data – commonly described as functional connectivity – can change as a function of the participant’s cognitive state (for review see [32]). Here we present a technique, termed hierarchical topographic factor analysis (HTFA), for efficiently discovering full-brain networks in large multi-subject neuroimaging datasets. HTFA approximates each
subject’s network by first re-representing each brain image in terms of the activations of a set of localized nodes, and then computing the covariance of the activation time series of these nodes. The number of nodes, along with their locations, sizes, and activations (over time) are learned from the data. Because the number of nodes is typically substantially smaller than the number of fMRI voxels, HTFA can be orders of magnitude more efficient
than traditional voxel-based functional connectivity approaches. In one case study, we show that HTFA recovers the known connectivity patterns underlying a synthetic dataset. In a second case study, we illustrate how HTFA may be used to discover dynamic full-brain activity and connectivity patterns in real fMRI data, collected as participants listened to a story. In a third case study, we carried out a similar series of analyses on fMRI data collected as participants viewed an episode of a television show. In these latter case studies, we found
that both the HTFA-derived activity and connectivity patterns may be used to reliably decode which moments in the story or show the participants were experiencing. Further, we found that these two classes of patterns contained partially non-overlapping information, such that classifiers trained on combinations of activity-based and dynamic connectivity-based features performed better than classifiers trained on activity or connectivity patterns
alone