Wu Haiyong, Chen Geng, Yang Zhongxue, Shen Dinggang, Yap Pew-Thian
Key Laboratory of Trusted Cloud Computing and Big Data Analysis, Xiaozhuang University, Nanjing, China.
Data Processing Center, Northwestern Polytechnical University, Xi'an, China.
Comput Diffus MRI. 2016;2016:121-130. doi: 10.1007/978-3-319-28588-7_11. Epub 2016 Apr 9.
Global tractography estimates brain connectivity by determining the optimal configuration of signal-generating fiber segments that best describes the measured diffusion-weighted data, promising better stability than local greedy methods with respect to imaging noise. However, global tractography is computationally very demanding and requires computation times that are often prohibitive for clinical applications. We present here a reformulation of the global tractography algorithm for fast parallel implementation amendable to acceleration using multi-core CPUs and general-purpose GPUs. Our method is motivated by the key observation that each fiber segment is affected by a limited spatial neighborhood. That is, a fiber segment is influenced only by the fiber segments that are (or can potentially be) connected to its both ends and also by the diffusion-weighted signal in its proximity. This observation makes it possible to parallelize the Markov chain Monte Carlo (MCMC) algorithm used in the global tractography algorithm so that updating of independent fiber segments can be done concurrently. The experiments show that the proposed algorithm can significantly speed up global tractography, while at the same time maintain or improve tractography performance.
全局纤维束成像通过确定能最佳描述测量的扩散加权数据的信号生成纤维段的最优配置来估计脑连接性,相较于局部贪婪方法,有望在成像噪声方面具有更好的稳定性。然而,全局纤维束成像在计算上要求极高,其所需的计算时间对于临床应用而言往往令人望而却步。我们在此提出一种全局纤维束成像算法的重新表述,以便能进行快速并行实现,适合使用多核CPU和通用GPU进行加速。我们的方法基于这样一个关键观察结果:每个纤维段仅受有限空间邻域的影响。也就是说,一个纤维段仅受与其两端相连(或可能相连)的纤维段以及其附近的扩散加权信号的影响。这一观察结果使得全局纤维束成像算法中使用的马尔可夫链蒙特卡罗(MCMC)算法能够并行化,从而可以同时更新独立的纤维段。实验表明,所提出的算法能够显著加快全局纤维束成像的速度,同时保持或提高纤维束成像的性能。