Dataset Information

Methods for computing the maximum performance of computational models of fMRI responses.

ABSTRACT: Computational neuroimaging methods aim to predict brain responses (measured e.g. with functional magnetic resonance imaging [fMRI]) on the basis of stimulus features obtained through computational models. The accuracy of such prediction is used as an indicator of how well the model describes the computations underlying the brain function that is being considered. However, the prediction accuracy is bounded by the proportion of the variance of the brain response which is related to the measurement noise and not to the stimuli (or cognitive functions). This bound to the performance of a computational model has been referred to as the noise ceiling. In previous fMRI applications two methods have been proposed to estimate the noise ceiling based on either a split-half procedure or Monte Carlo simulations. These methods make different assumptions over the nature of the effects underlying the data, and, importantly, their relation has not been clarified yet. Here, we derive an analytical form for the noise ceiling that does not require computationally expensive simulations or a splitting procedure that reduce the amount of data. The validity of this analytical definition is proved in simulations, we show that the analytical solution results in the same estimate of the noise ceiling as the Monte Carlo method. Considering different simulated noise structure, we evaluate different estimators of the variance of the responses and their impact on the estimation of the noise ceiling. We furthermore evaluate the interplay between regularization (often used to estimate model fits to the data when the number of computational features in the model is large) and model complexity on the performance with respect to the noise ceiling. Our results indicate that when considering the variance of the responses across runs, computing the noise ceiling analytically results in similar estimates as the split half estimator and approaches the true noise ceiling under a variety of simulated noise scenarios. Finally, the methods are tested on real fMRI data acquired at 7 Tesla.

SUBMITTER: Lage-Castellanos A

PROVIDER: S-EPMC6426260 | biostudies-literature | 2019 Mar

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Methods for computing the maximum performance of computational models of fMRI responses.

Lage-Castellanos Agustin A Valente Giancarlo G Formisano Elia E De Martino Federico F

PLoS computational biology 20190308 3

Computational neuroimaging methods aim to predict brain responses (measured e.g. with functional magnetic resonance imaging [fMRI]) on the basis of stimulus features obtained through computational models. The accuracy of such prediction is used as an indicator of how well the model describes the computations underlying the brain function that is being considered. However, the prediction accuracy is bounded by the proportion of the variance of the brain response which is related to the measuremen ...[more]

PMID: 30849071

Similar Datasets

Project description:X-ray crystallography is a powerful method that has significantly contributed to our understanding of the biological function of proteins and other molecules. This method relies on the production of crystals that, however, are usually a bottleneck in the process. For some molecules, no crystallization has been achieved or insufficient crystals were obtained. Some other systems do not crystallize at all, such as nanoparticles which, because of their dimensions, cannot be treated by the usual crystallographic methods. To solve this, whole pair distribution function has been proposed to bridge the gap between Bragg and Debye scattering theories. To execute a fitting, the spectra of several different constructs, composed of millions of particles each, should be computed using a particle-pair or particle-particle (pp) distance algorithm. Using this computation as a test bench for current field-programmable gate array (FPGA) technology, we evaluate how the parallel computation capability of FPGAs can be exploited to reduce the computation time. We present two different solutions to the problem using two state-of-the-art FPGA technologies. In the first one, the main C program uses OmpSs (a high-level programming model developed at the Barcelona Supercomputing Center, that enables task offload to different high-performance computing devices) for task invocation, and kernels are built with OpenCL using reduced data sizes to save transmission time. The second approach uses task and data parallelism to operate on data locally and update data globally in a decoupled task. Benchmarks have been evaluated over an Intel D5005 Programmable Acceleration Card, computing a model of 2 million particles in 81.57 s - 24.5 billion atom pairs per second (bapps)- and over a ZU102 in 115.31 s. In our last test, over an up-to-date Alveo U200 board, the computation lasted for 34.68 s (57.67 bapps). In this study, we analyze the results in relation to the classic terms of speed-up and efficiency and give hints for future improvements focused on reducing the global job time.

Project description:Gait is often impaired in people with multiple sclerosis (PwMS), but detailed assessment of gait impairment in research and care remains challenging. In a previous pilot study we reported the feasibility of visual perceptive computing (VPC) for gait assessment in PwMS using the Short Maximum Speed Walk (SMSW), which assesses gait on recording distances confined to less than 4 meters.To investigate the equivalence of SMSW to rater-based timed 25ft. walk (T25FW) in a large cohort of PwMS, and to investigate the association of SMSW-derived gait parameters with clinical disability, as well as subjective and objective gait impairment, in order to validate the SMSW as a quick and objective measure of clinical relevance possibly superior to T25FW.95 PwMS and 60 healthy controls (HC) performed the SMSW using a VPC system with Microsoft Kinect. All participants received two immediate retests to establish test-retest-reliability. Both PwMS and HC performed the T25FW. PwMS were rated according to the Expanded Disability Status Scale (EDSS) and answered the 12-item Multiple Sclerosis Walking Scale (MSWS-12) as a measure of self-perceived walking impairment.PwMS showed reduced average speed (p<0.001) and higher mediolateral deviation (p = 0.002) during SMSW than HC. Average speed was the most reliable SMSW parameter in PwMS and HC (intra-class correlation coefficient (ICC) in PwMS = 0.985, and in HC = 0.977). Average speed declined with age in PwMS and HC (r in PwMS = -0.648, and in HC = -0.452, both p<0.001). Correlation of SMSW average speed and T25FW speed was high in both groups (r in PwMS = 0.783, and in HC = 0.747, both p<0.001) and mean difference (0.0013 m/s) between methods was below smallest detectable change. Average speed correlated well with both clinical disability based on EDSS (r = -0.586, p<0.001) and self-perceived walking impairment based on MSWS-12 (r = -0.546, p<0.001).VPC-assessed walking parameters during SMSW can reliably detect gait disturbance in PwMS over very short distance. Specifically, maximum gait speed can be obtained with high accuracy in this simple test set-up. Cross-sectional associations with disability and self-perceived walking impairment support clinical relevance. Given its objectivity in a simple test set-up, SMSW is superior to T25FW.

Dataset Information

Methods for computing the maximum performance of computational models of fMRI responses.

Publications

Methods for computing the maximum performance of computational models of fMRI responses.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets