首页> 美国卫生研究院文献>High-Throughput >Fast-GPU-PCC: A GPU-Based Technique to Compute Pairwise Pearson’s Correlation Coefficients for Time Series Data—fMRI Study
【2h】

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

机译:Fast-GPU-PCC:基于GPU的技术用于计算时间序列数据的成对Pearson相关系数-fMRI研究

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

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.
机译:功能磁共振成像(fMRI)是一种非侵入性的大脑成像技术,在过去的几年中,该技术已定期用于研究大脑的功能活动。皮尔逊的相关系数是一种非常有用的捕获大脑功能关联的方法。皮尔逊相关性被广泛用于构建功能网络和研究大脑的动态功能连接性。这些是了解大脑疾病对大脑区域之间的连接性影响的有用措施。 fMRI扫描仪会产生大量体素,并且使用传统的基于中央处理器(CPU)的技术来计算成对相关性非常耗时,尤其是在研究大量对象时。在本文中,我们提出了一种基于图形处理单元(GPU)的算法,称为Fast-GPU-PCC,用于计算成对的Pearson相关系数。基于皮尔逊相关性的对称性,此方法返回位于相关矩阵严格上三角部分的N(N-1)/ 2个相关系数。按照本文提出的顺序将相关性存储在一维数组中对于进一步使用很有用。我们针对不同数量的体素和不同时间序列长度的真实和合成fMRI数据进行的实验表明,该方法优于基于GPU的技术以及基于顺序CPU的技术。我们显示,Fast-GPU-PCC的运行速度是基于CPU的版本的62倍,比其他两种基于GPU的现有方法的速度快约2至3倍。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号