Philips, StefanHlawitschka, MarioScheuermann, GerikMichael Bronstein and Jean Favre and Kai Hormann2014-02-012014-02-012013978-3-905674-51-4https://doi.org/10.2312/PE.VMV.VMV13.097-104Most brain tractography algorithms suffer from lower accuracy, because they use only information in a certain neighborhood and reconstruct the tracts independently. Global brain tractography algorithms compensate the lack of accuracy of those local algorithms in certain areas by optimizing the whole tractogram. The global tractography approach by Reisert et al. showed the best results in the Fiber Cup contest, but the runtime is still a matter for a medical application. In this paper we present the non-trivial parallelization of this global tractography algorithm. The parallelization exploits properties of the algorithm and modifies the algorithm where necessary. We compare the runtimes of the serial and the parallel variant and show that the outcomes of the parallel variant are of the same quality as those of the serial algorithm. The experiments proof also that the parallelization scales well for real world datasets.Programming Techniques [D.1.3]Concurrent ProgrammingParallel programmingComputer Graphics [I.3.3]Picture/Image GenerationLine and curve generationNumerical Analysis [G.1.6]OptimizationOptimizationNumerical Analysis [G.1.6]OptimizationSimulated annealing