Embarrassingly parallel acceleration of global tractography via dynamic domain partitioning

Haiyong Wu, Geng Chen, Yan Jin, Dinggang Shen, Pew Thian Yap

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Global tractography estimates brain connectivity by organizing signal-generating fiber segments in an optimal configuration 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. In other words, a fiber segment is influenced only by the fiber segments that are (or can potentially be) connected to its two 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 concurrent updating of independent fiber segments can be carried out. Experiments show that the proposed algorithm can significantly speed up global tractography, while at the same time maintain or even improve tractography performance.

Original languageEnglish
Article number25
JournalFrontiers in Neuroinformatics
Volume10
Issue numberJUL
DOIs
Publication statusPublished - 2016 Jul 13

Fingerprint

Fibers
Markov Chains
Noise
Markov processes
Observation
Program processors
Brain
Imaging techniques
Experiments
Graphics processing unit

Keywords

  • Brain connectivity
  • Diffusion magnetic resonance imaging
  • Global tractography
  • Markov chain Monte Carlo
  • Parallel computing

ASJC Scopus subject areas

  • Neuroscience (miscellaneous)
  • Biomedical Engineering
  • Computer Science Applications

Cite this

Embarrassingly parallel acceleration of global tractography via dynamic domain partitioning. / Wu, Haiyong; Chen, Geng; Jin, Yan; Shen, Dinggang; Yap, Pew Thian.

In: Frontiers in Neuroinformatics, Vol. 10, No. JUL, 25, 13.07.2016.

Research output: Contribution to journalArticle

@article{2fadad4a9ad949a0a1e897d97bca132d,
title = "Embarrassingly parallel acceleration of global tractography via dynamic domain partitioning",
abstract = "Global tractography estimates brain connectivity by organizing signal-generating fiber segments in an optimal configuration 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. In other words, a fiber segment is influenced only by the fiber segments that are (or can potentially be) connected to its two 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 concurrent updating of independent fiber segments can be carried out. Experiments show that the proposed algorithm can significantly speed up global tractography, while at the same time maintain or even improve tractography performance.",
keywords = "Brain connectivity, Diffusion magnetic resonance imaging, Global tractography, Markov chain Monte Carlo, Parallel computing",
author = "Haiyong Wu and Geng Chen and Yan Jin and Dinggang Shen and Yap, {Pew Thian}",
year = "2016",
month = "7",
day = "13",
doi = "10.3389/fninf.2016.00025",
language = "English",
volume = "10",
journal = "Frontiers in Neuroinformatics",
issn = "1662-5196",
publisher = "Frontiers Research Foundation",
number = "JUL",

}

TY - JOUR

T1 - Embarrassingly parallel acceleration of global tractography via dynamic domain partitioning

AU - Wu, Haiyong

AU - Chen, Geng

AU - Jin, Yan

AU - Shen, Dinggang

AU - Yap, Pew Thian

PY - 2016/7/13

Y1 - 2016/7/13

N2 - Global tractography estimates brain connectivity by organizing signal-generating fiber segments in an optimal configuration 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. In other words, a fiber segment is influenced only by the fiber segments that are (or can potentially be) connected to its two 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 concurrent updating of independent fiber segments can be carried out. Experiments show that the proposed algorithm can significantly speed up global tractography, while at the same time maintain or even improve tractography performance.

AB - Global tractography estimates brain connectivity by organizing signal-generating fiber segments in an optimal configuration 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. In other words, a fiber segment is influenced only by the fiber segments that are (or can potentially be) connected to its two 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 concurrent updating of independent fiber segments can be carried out. Experiments show that the proposed algorithm can significantly speed up global tractography, while at the same time maintain or even improve tractography performance.

KW - Brain connectivity

KW - Diffusion magnetic resonance imaging

KW - Global tractography

KW - Markov chain Monte Carlo

KW - Parallel computing

UR - http://www.scopus.com/inward/record.url?scp=84989874238&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84989874238&partnerID=8YFLogxK

U2 - 10.3389/fninf.2016.00025

DO - 10.3389/fninf.2016.00025

M3 - Article

AN - SCOPUS:84989874238

VL - 10

JO - Frontiers in Neuroinformatics

JF - Frontiers in Neuroinformatics

SN - 1662-5196

IS - JUL

M1 - 25

ER -