Show simple item record

dc.contributor.authorPhilips, Stefanen_US
dc.contributor.authorHlawitschka, Marioen_US
dc.contributor.authorScheuermann, Geriken_US
dc.contributor.editorMichael Bronstein and Jean Favre and Kai Hormannen_US
dc.description.abstractMost 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.en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectProgramming Techniques [D.1.3]en_US
dc.subjectConcurrent Programmingen_US
dc.subjectParallel programmingen_US
dc.subjectComputer Graphics [I.3.3]en_US
dc.subjectPicture/Image Generationen_US
dc.subjectLine and curve generationen_US
dc.subjectNumerical Analysis [G.1.6]en_US
dc.subjectNumerical Analysis [G.1.6]en_US
dc.subjectSimulated annealingen_US
dc.titleParallelized Global Brain Tractographyen_US
dc.description.seriesinformationVision, Modeling & Visualizationen_US

Files in this item


This item appears in the following Collection(s)

  • VMV13
    ISBN 978-3-905674-51-4

Show simple item record