BrainIAK: The Brain Imaging Analysis Kit.

Functional magnetic resonance imaging (fMRI) offers a rich source of data for studying the neural basis of cognition. Here, we describe the Brain Imaging Analysis Kit (BrainIAK), an open-source, free Python package that provides computationally optimized solutions to key problems in advanced fMRI analysis. A variety of techniques are presently included in BrainIAK: intersubject correlation (ISC) and intersubject functional connectivity (ISFC), functional alignment via the shared response model (SRM), full correlation matrix analysis (FCMA), a Bayesian version of representational similarity analysis (BRSA), event segmentation using hidden Markov models, topographic factor analysis (TFA), inverted encoding models (IEMs), an fMRI data simulator that uses noise characteristics from real data (fmrisim), and some emerging methods. These techniques have been optimized to leverage the efficiencies of high-performance compute (HPC) clusters, and the same code can be se amlessly transferred from a laptop to a cluster. For each of the aforementioned techniques, we describe the data analysis problem that the technique is meant to solve and how it solves that problem; we also include an example Jupyter notebook for each technique and an annotated bibliography of papers that have used and/or described that technique. In addition to the sections describing various analysis techniques in BrainIAK, we have included sections describing the future applications of BrainIAK to real-time fMRI, tutorials that we have developed and shared online to facilitate learning the techniques in BrainIAK, computational innovations in BrainIAK, and how to contribute to BrainIAK. We hope that this manuscript helps readers to understand how BrainIAK might be useful in their research.

BrainIAK tutorials: User-friendly learning materials for advanced fMRI analysis.

Advanced brain imaging analysis methods, including multivariate pattern analysis (MVPA), functional connectivity, and functional alignment, have become powerful tools in cognitive neuroscience over the past decade. These tools are implemented in custom code and separate packages, often requiring different software and language proficiencies. Although usable by expert researchers, novice users face a steep learning curve. These difficulties stem from the use of new programming languages (e.g., Python), learning how to apply machine-learning methods to high-dimensional fMRI data, and minimal documentation and training materials. Furthermore, most standard fMRI analysis packages (e.g., AFNI, FSL, SPM) focus on preprocessing and univariate analyses, leaving a gap in how to integrate with advanced tools. To address these needs, we developed BrainIAK (brainiak.org), an open-source Python software package that seamlessly integrates several cutting-edge, computationally efficient techniques with other Python packages (e.g., Nilearn, Scikit-learn) for file handling, visualization, and machine learning. To disseminate these powerful tools, we developed user-friendly tutorials (in Jupyter format; https://brainiak.org/tutorials/) for learning BrainIAK and advanced fMRI analysis in Python more generally. These materials cover techniques including: MVPA (pattern classification and representational similarity analysis); parallelized searchlight analysis; background connectivity; full correlation matrix analysis; inter-subject correlation; inter-subject functional connectivity; shared response modeling; event segmentation using hidden Markov models; and real-time fMRI. For long-running jobs or large memory needs we provide detailed guidance on high-performance computing clusters. These notebooks were successfully tested at multiple sites, including as problem sets for courses at Yale and Princeton universities and at various workshops and hackathons. These materials are freely shared, with the hope that they become part of a pool of open-source software and educational materials for large-scale, reproducible fMRI analysis and accelerated discovery.

Targeted rapid knee MRI exam using T2 shuffling.

BACKGROUND: MRI is commonly used to evaluate pediatric musculoskeletal pathologies, but same-day/near-term scheduling and short exams remain challenges. PURPOSE: To investigate the feasibility of a targeted rapid pediatric knee MRI exam, with the goal of reducing cost and enabling same-day MRI access. STUDY TYPE: A cost effectiveness study done prospectively. SUBJECTS: Forty-seven pediatric patients. FIELD STRENGTH/SEQUENCE: 3T. The 10-minute protocol was based on T2 Shuffling, a four-dimensional acquisition and reconstruction of images with variable T2 contrast, and a T1 2D fast spin-echo (FSE) sequence. A distributed, compressed sensing-based reconstruction was implemented on a four-node high-performance compute cluster and integrated into the clinical workflow. ASSESSMENT: In an Institutional Review Board-approved study with informed consent/assent, we implemented a targeted pediatric knee MRI exam for assessing pediatric knee pain. Pediatric patients were subselected for the exam based on insurance plan and clinical indication. Over a 2-year period, 47 subjects were recruited for the study and 49 MRIs were ordered. Date and time information was recorded for MRI referral, registration, and completion. Image quality was assessed from 0 (nondiagnostic) to 5 (outstanding) by two readers, and consensus was subsequently reached. STATISTICAL TESTS: A Wilcoxon rank-sum test assessed the null hypothesis that the targeted exam times compared with conventional knee exam times were unchanged. RESULTS: Of the 49 cases, 20 were completed on the same day as exam referral. Median time from registration to exam completion was 18.7 minutes. Median reconstruction time for T2 Shuffling was reduced from 18.9 minutes to 95 seconds using the distributed implementation. Technical fees charged for the targeted exam were one-third that of the routine clinical knee exam. No subject had to return for additional imaging. DATA CONCLUSION: The targeted knee MRI exam is feasible and reduces the imaging time, cost, and barrier to same-day MRI access for pediatric patients. LEVEL OF EVIDENCE: 2 Technical Efficacy: Stage 6 J. Magn. Reson. Imaging 2019.

A probabilistic approach to discovering dynamic full-brain functional connectivity patterns.

Recent research shows 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 Turk-Browne, 2013). Here we present a Bayesian hierarchical matrix factorization model, 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 activities of a set of localized nodes, and then computing the covariance of the activity time series of these nodes. The number of nodes, along with their locations, sizes, and activities (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 collection of synthetic datasets. 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 the HTFA-derived activity and connectivity patterns can 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 decoders trained on combinations of activity-based and dynamic connectivity-based features performed better than decoders trained on activity or connectivity patterns alone. We replicated this latter result with two additional (previously developed) methods for efficiently characterizing full-brain activity and connectivity patterns.

Computational approaches to fMRI analysis.

Analysis methods in cognitive neuroscience have not always matched the richness of fMRI data. Early methods focused on estimating neural activity within individual voxels or regions, averaged over trials or blocks and modeled separately in each participant. This approach mostly neglected the distributed nature of neural representations over voxels, the continuous dynamics of neural activity during tasks, the statistical benefits of performing joint inference over multiple participants and the value of using predictive models to constrain analysis. Several recent exploratory and theory-driven methods have begun to pursue these opportunities. These methods highlight the importance of computational techniques in fMRI analysis, especially machine learning, algorithmic optimization and parallel computing. Adoption of these techniques is enabling a new generation of experiments and analyses that could transform our understanding of some of the most complex-and distinctly human-signals in the brain: acts of cognition such as thoughts, intentions and memories.