Browse
Submit Data
Databases
API
Help

Dataset Information

42 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Fast construction of interpretable whole-brain decoders.

ABSTRACT: Researchers often seek to decode mental states from brain activity measured with functional MRI. Rigorous decoding requires the use of formal neural prediction models, which are likely to be the most accurate if they use the whole brain. However, the computational burden and lack of interpretability of off-the-shelf statistical methods can make whole-brain decoding challenging. Here, we propose a method to build whole-brain neural decoders that are both interpretable and computationally efficient. We extend the partial least squares algorithm to build a regularized model with variable selection that offers a unique "fit once, tune later" approach: users need to fit the model only once and can choose the best tuning parameters post hoc. We show in real data that our method scales well with increasing data size and yields interpretable predictors. The algorithm is publicly available in multiple languages in the hope that interpretable whole-brain predictors can be implemented more widely in neuroimaging research.

SUBMITTER: Lee S

PROVIDER: S-EPMC9243546 | biostudies-literature | 2022 Jun

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Fast construction of interpretable whole-brain decoders.

Lee Sangil S Bradlow Eric T ET Kable Joseph W JW

Cell reports methods 20220606 6

Researchers often seek to decode mental states from brain activity measured with functional MRI. Rigorous decoding requires the use of formal neural prediction models, which are likely to be the most accurate if they use the whole brain. However, the computational burden and lack of interpretability of off-the-shelf statistical methods can make whole-brain decoding challenging. Here, we propose a method to build whole-brain neural decoders that are both interpretable and computationally efficien ...[more]

PMID: 35784649

Similar Datasets

Extracting interpretable signatures of whole-brain dynamics through systematic comparison.

Project description:The brain's complex distributed dynamics are typically quantified using a limited set of manually selected statistical properties, leaving the possibility that alternative dynamical properties may outperform those reported for a given application. Here, we address this limitation by systematically comparing diverse, interpretable features of both intra-regional activity and inter-regional functional coupling from resting-state functional magnetic resonance imaging (rs-fMRI) data, demonstrating our method using case-control comparisons of four neuropsychiatric disorders. Our findings generally support the use of linear time-series analysis techniques for rs-fMRI case-control analyses, while also identifying new ways to quantify informative dynamical fMRI structures. While simple statistical representations of fMRI dynamics performed surprisingly well (e.g., properties within a single brain region), combining intra-regional properties with inter-regional coupling generally improved performance, underscoring the distributed, multifaceted changes to fMRI dynamics in neuropsychiatric disorders. The comprehensive, data-driven method introduced here enables systematic identification and interpretation of quantitative dynamical signatures of multivariate time-series data, with applicability beyond neuroimaging to diverse scientific problems involving complex time-varying systems.

| S-EPMC11706466 | biostudies-literature

A recurrent neural network for closed-loop intracortical brain-machine interface decoders.

Project description:Recurrent neural networks (RNNs) are useful tools for learning nonlinear relationships in time series data with complex temporal dependences. In this paper, we explore the ability of a simplified type of RNN, one with limited modifications to the internal weights called an echostate network (ESN), to effectively and continuously decode monkey reaches during a standard center-out reach task using a cortical brain-machine interface (BMI) in a closed loop. We demonstrate that the RNN, an ESN implementation termed a FORCE decoder (from first order reduced and controlled error learning), learns the task quickly and significantly outperforms the current state-of-the-art method, the velocity Kalman filter (VKF), using the measure of target acquire time. We also demonstrate that the FORCE decoder generalizes to a more difficult task by successfully operating the BMI in a randomized point-to-point task. The FORCE decoder is also robust as measured by the success rate over extended sessions. Finally, we show that decoded cursor dynamics are more like naturalistic hand movements than those of the VKF. Taken together, these results suggest that RNNs in general, and the FORCE decoder in particular, are powerful tools for BMI decoder applications.

| S-EPMC3638090 | biostudies-literature

Accurate, fast, data efficient and interpretable glaucoma diagnosis with automated spatial analysis of the whole cup to disc profile.

Project description:BackgroundGlaucoma is the leading cause of irreversible blindness worldwide. It is a heterogeneous group of conditions with a common optic neuropathy and associated loss of peripheral vision. Both over and under-diagnosis carry high costs in terms of healthcare spending and preventable blindness. The characteristic clinical feature of glaucoma is asymmetrical optic nerve rim narrowing, which is difficult for humans to quantify reliably. Strategies to improve and automate optic disc assessment are therefore needed to prevent sight loss.MethodsWe developed a novel glaucoma detection algorithm that segments and analyses colour photographs to quantify optic nerve rim consistency around the whole disc at 15-degree intervals. This provides a profile of the cup/disc ratio, in contrast to the vertical cup/disc ratio in common use. We introduce a spatial probabilistic model, to account for the optic nerve shape, we then use this model to derive a disc deformation index and a decision rule for glaucoma. We tested our algorithm on two separate image datasets (ORIGA and RIM-ONE).ResultsThe spatial algorithm accurately distinguished glaucomatous and healthy discs on internal and external validation (AUROC 99.6% and 91.0% respectively). It achieves this using a dataset 100-times smaller than that required for deep learning algorithms, is flexible to the type of cup and disc segmentation (automated or semi-automated), utilises images with missing data, and is correlated with the disc size (p = 0.02) and the rim-to-disc at the narrowest rim (p<0.001, in external validation).DiscussionThe spatial probabilistic algorithm is highly accurate, highly data efficient and it extends to any imaging hardware in which the boundaries of cup and disc can be segmented, thus making the algorithm particularly applicable to research into disease mechanisms, and also glaucoma screening in low resource settings.

| S-EPMC6328156 | biostudies-literature

Fast and interpretable consensus clustering via minipatch learning.

Project description:Consensus clustering has been widely used in bioinformatics and other applications to improve the accuracy, stability and reliability of clustering results. This approach ensembles cluster co-occurrences from multiple clustering runs on subsampled observations. For application to large-scale bioinformatics data, such as to discover cell types from single-cell sequencing data, for example, consensus clustering has two significant drawbacks: (i) computational inefficiency due to repeatedly applying clustering algorithms, and (ii) lack of interpretability into the important features for differentiating clusters. In this paper, we address these two challenges by developing IMPACC: Interpretable MiniPatch Adaptive Consensus Clustering. Our approach adopts three major innovations. We ensemble cluster co-occurrences from tiny subsets of both observations and features, termed minipatches, thus dramatically reducing computation time. Additionally, we develop adaptive sampling schemes for observations, which result in both improved reliability and computational savings, as well as adaptive sampling schemes of features, which lead to interpretable solutions by quickly learning the most relevant features that differentiate clusters. We study our approach on synthetic data and a variety of real large-scale bioinformatics data sets; results show that our approach not only yields more accurate and interpretable cluster solutions, but it also substantially improves computational efficiency compared to standard consensus clustering approaches.

| S-EPMC9560608 | biostudies-literature

Fast and sequence-adaptive whole-brain segmentation using parametric Bayesian modeling.

Project description:Quantitative analysis of magnetic resonance imaging (MRI) scans of the brain requires accurate automated segmentation of anatomical structures. A desirable feature for such segmentation methods is to be robust against changes in acquisition platform and imaging protocol. In this paper we validate the performance of a segmentation algorithm designed to meet these requirements, building upon generative parametric models previously used in tissue classification. The method is tested on four different datasets acquired with different scanners, field strengths and pulse sequences, demonstrating comparable accuracy to state-of-the-art methods on T1-weighted scans while being one to two orders of magnitude faster. The proposed algorithm is also shown to be robust against small training datasets, and readily handles images with different MRI contrast as well as multi-contrast data.

| S-EPMC8117726 | biostudies-literature

Multi-Scale Light-Sheet Fluorescence Microscopy for Fast Whole Brain Imaging.

Project description:Whole-brain imaging has become an increasingly important approach to investigate neural structures, such as somata distribution, dendritic morphology, and axonal projection patterns. Different structures require whole-brain imaging at different resolutions. Thus, it is highly desirable to perform whole-brain imaging at multiple scales. Imaging a complete mammalian brain at synaptic resolution is especially challenging, as it requires continuous imaging from days to weeks because of the large number of voxels to sample, and it is difficult to acquire a constant quality of imaging because of light scattering during in toto imaging. Here, we reveal that light-sheet microscopy has a unique advantage over wide-field microscopy in multi-scale imaging because of its decoupling of illumination and detection. Based on this observation, we have developed a multi-scale light-sheet microscope that combines tiling of light-sheet, automatic zooming, periodic sectioning, and tissue expansion to achieve a constant quality of brain-wide imaging from cellular (3 μm × 3 μm × 8 μm) to sub-micron (0.3 μm × 0.3 μm × 1 μm) spatial resolution rapidly (all within a few hours). We demonstrated the strength of the system by testing it using mouse brains prepared using different clearing approaches. We were able to track electrode tracks as well as axonal projections at sub-micron resolution to trace the full morphology of single medial prefrontal cortex (mPFC) neurons that have remarkable diversity in long-range projections.

| S-EPMC8497830 | biostudies-literature

halSynteny: a fast, easy-to-use conserved synteny block construction method for multiple whole-genome alignments.

Project description:Large-scale sequencing projects provide high-quality full-genome data that can be used for reconstruction of chromosomal exchanges and rearrangements that disrupt conserved syntenic blocks. The highest resolution of cross-species homology can be obtained on the basis of whole-genome, reference-free alignments. Very large multiple alignments of full-genome sequence stored in a binary format demand an accurate and efficient computational approach for synteny block production. halSynteny performs efficient processing of pairwise alignment blocks for any pair of genomes in the alignment. The tool is part of the HAL comparative genomics suite and is targeted to build synteny blocks for multi-hundred-way, reference-free vertebrate alignments built with the Cactus system. halSynteny enables an accurate and rapid identification of synteny in multiple full-genome alignments. The method is implemented in C++11 as a component of the halTools software and released under MIT license. The package is available at https://github.com/ComparativeGenomicsToolkit/hal/.

| S-EPMC7254927 | biostudies-literature

EEG decoders track memory dynamics.

Project description:Encoding- and retrieval-related neural activity jointly determine mnemonic success. We ask whether electroencephalographic activity can reliably predict encoding and retrieval success on individual trials. Each of 98 participants performed a delayed recall task on 576 lists across 24 experimental sessions. Logistic regression classifiers trained on spectral features measured immediately preceding spoken recall of individual words successfully predict whether or not those words belonged to the target list. Classifiers trained on features measured during word encoding also reliably predict whether those words will be subsequently recalled and further predict the temporal and semantic organization of the recalled items. These findings link neural variability predictive of successful memory with item-to-context binding, a key cognitive process thought to underlie episodic memory function.

| S-EPMC10998865 | biostudies-literature

Fast, 3D Isotropic Imaging of Whole Mouse Brain Using Multiangle-Resolved Subvoxel SPIM.

Project description:The recent integration of light-sheet microscopy and tissue-clearing has facilitated an important alternative to conventional histological imaging approaches. However, the in toto cellular mapping of neural circuits throughout an intact mouse brain remains highly challenging, requiring complicated mechanical stitching, and suffering from anisotropic resolution insufficient for high-quality reconstruction in 3D. Here, the use of a multiangle-resolved subvoxel selective plane illumination microscope (Mars-SPIM) is proposed to achieve high-throughput imaging of whole mouse brain at isotropic cellular resolution. This light-sheet imaging technique can computationally improve the spatial resolution over six times under a large field of view, eliminating the use of slow tile stitching. Furthermore, it can recover complete structural information of the sample from images subject to thick-tissue scattering/attenuation. With Mars-SPIM, a digital atlas of a cleared whole mouse brain (≈7 mm × 9.5 mm × 5 mm) can readily be obtained with an isotropic resolution of ≈2 µm (1 µm voxel) and a short acquisition time of 30 min. It provides an efficient way to implement system-level cellular analysis, such as the mapping of different neuron populations and tracing of long-distance neural projections over the entire brain. Mars-SPIM is thus well suited for high-throughput cell-profiling phenotyping of brain and other mammalian organs.

| S-EPMC7001627 | biostudies-literature

Fractional ridge regression: a fast, interpretable reparameterization of ridge regression.

Project description:Ridge regression is a regularization technique that penalizes the L2-norm of the coefficients in linear regression. One of the challenges of using ridge regression is the need to set a hyperparameter (α) that controls the amount of regularization. Cross-validation is typically used to select the best α from a set of candidates. However, efficient and appropriate selection of α can be challenging. This becomes prohibitive when large amounts of data are analyzed. Because the selected α depends on the scale of the data and correlations across predictors, it is also not straightforwardly interpretable. The present work addresses these challenges through a novel approach to ridge regression. We propose to reparameterize ridge regression in terms of the ratio γ between the L2-norms of the regularized and unregularized coefficients. We provide an algorithm that efficiently implements this approach, called fractional ridge regression, as well as open-source software implementations in Python and matlab (https://github.com/nrdg/fracridge). We show that the proposed method is fast and scalable for large-scale data problems. In brain imaging data, we demonstrate that this approach delivers results that are straightforward to interpret and compare across models and datasets. Fractional ridge regression has several benefits: the solutions obtained for different γ are guaranteed to vary, guarding against wasted calculations; and automatically span the relevant range of regularization, avoiding the need for arduous manual exploration. These properties make fractional ridge regression particularly suitable for analysis of large complex datasets.

| S-EPMC7702219 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data