Next Article in Journal
Reactive Chemicals and Electrophilic Stress in Cancer: A Minireview
Next Article in Special Issue
Computational Convolution of SELDI Data for the Diagnosis of Alzheimer’s Disease
Previous Article in Journal
Red Blood Cell Agglutination for Blood Typing Within Passive Microfluidic Biochips
Please note that, as of 21 September 2020, High-Throughput has been renamed to BioTech and is now published here.
Open AccessArticle

Fast-GPU-PCC: A GPU-Based Technique to Compute Pairwise Pearson’s Correlation Coefficients for Time Series Data—fMRI Study

Department of Computer Science, Western Michigan University, Kalamazoo, MI 49008, USA
*
Author to whom correspondence should be addressed.
High-Throughput 2018, 7(2), 11; https://doi.org/10.3390/ht7020011
Received: 2 March 2018 / Revised: 4 April 2018 / Accepted: 17 April 2018 / Published: 20 April 2018
(This article belongs to the Special Issue Parallel and Cloud-Based Bioinformatics and Biomedicine)
Functional magnetic resonance imaging (fMRI) is a non-invasive brain imaging technique, which has been regularly used for studying brain’s functional activities in the past few years. A very well-used measure for capturing functional associations in brain is Pearson’s correlation coefficient. Pearson’s correlation is widely used for constructing functional network and studying dynamic functional connectivity of the brain. These are useful measures for understanding the effects of brain disorders on connectivities among brain regions. The fMRI scanners produce huge number of voxels and using traditional central processing unit (CPU)-based techniques for computing pairwise correlations is very time consuming especially when large number of subjects are being studied. In this paper, we propose a graphics processing unit (GPU)-based algorithm called Fast-GPU-PCC for computing pairwise Pearson’s correlation coefficient. Based on the symmetric property of Pearson’s correlation, this approach returns N ( N 1 ) / 2 correlation coefficients located at strictly upper triangle part of the correlation matrix. Storing correlations in a one-dimensional array with the order as proposed in this paper is useful for further usage. Our experiments on real and synthetic fMRI data for different number of voxels and varying length of time series show that the proposed approach outperformed state of the art GPU-based techniques as well as the sequential CPU-based versions. We show that Fast-GPU-PCC runs 62 times faster than CPU-based version and about 2 to 3 times faster than two other state of the art GPU-based methods. View Full-Text
Keywords: fMRI; Pearson’s correlation coefficient; GPU; CUDA; matrix multiplication fMRI; Pearson’s correlation coefficient; GPU; CUDA; matrix multiplication
Show Figures

Figure 1

MDPI and ACS Style

Eslami, T.; Saeed, F. Fast-GPU-PCC: A GPU-Based Technique to Compute Pairwise Pearson’s Correlation Coefficients for Time Series Data—fMRI Study. High-Throughput 2018, 7, 11. https://doi.org/10.3390/ht7020011

AMA Style

Eslami T, Saeed F. Fast-GPU-PCC: A GPU-Based Technique to Compute Pairwise Pearson’s Correlation Coefficients for Time Series Data—fMRI Study. High-Throughput. 2018; 7(2):11. https://doi.org/10.3390/ht7020011

Chicago/Turabian Style

Eslami, Taban; Saeed, Fahad. 2018. "Fast-GPU-PCC: A GPU-Based Technique to Compute Pairwise Pearson’s Correlation Coefficients for Time Series Data—fMRI Study" High-Throughput 7, no. 2: 11. https://doi.org/10.3390/ht7020011

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop