title: BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.
abstract: Bootstrap methods have recently been introduced to diffusion-weighted magnetic resonance imaging to estimate the measurement uncertainty of ensuing diffusion parameters directly from the acquired data without the necessity to assume a noise model. These methods have been previously combined with deterministic streamline tractography algorithms to allow for the assessment of connection probabilities in the human brain. Thereby, the local noise induced disturbance in the diffusion data is accumulated additively due to the incremental progression of streamline tractography algorithms. Graph based approaches have been proposed to overcome this drawback of streamline techniques. For this reason, the bootstrap method is in the present work incorporated into a graph setup to derive a new probabilistic fiber tractography method, called BootGraph. The acquired data set is thereby converted into a weighted, undirected graph by defining a vertex in each voxel and edges between adjacent vertices. By means of the cone of uncertainty, which is derived using the wild bootstrap, a weight is thereafter assigned to each edge. Two path finding algorithms are subsequently applied to derive connection probabilities. While the first algorithm is based on the shortest path approach, the second algorithm takes all existing paths between two vertices into consideration. Tracking results are compared to an established algorithm based on the bootstrap method in combination with streamline fiber tractography and to another graph based algorithm. The BootGraph shows a very good performance in crossing situations with respect to false negatives and permits incorporating additional constraints, such as a curvature threshold. By inheriting the advantages of the bootstrap method and graph theory, the BootGraph method provides a computationally efficient and flexible probabilistic tractography setup to compute connection probability maps and virtual fiber pathways without the drawbacks of streamline tractography algorithms or the assumption of a noise distribution. Moreover, the BootGraph can be applied to common DTI data sets without further modifications and shows a high repeatability. Thus, it is very well suited for longitudinal studies and meta-studies based on DTI.
authors.affiliation: Institute for Biomedical Engineering, University and ETH Zurich, Gloriastrasse 35, 8092 Zurich, Switzerland. Electronic address: vorburger@biomed.ee.ethz.ch.
authors.forename: Robert S
authors.initials: RS
authors.lastname: Vorburger
authors.affiliation: Institute for Biomedical Engineering, University and ETH Zurich, Gloriastrasse 35, 8092 Zurich, Switzerland.
authors.forename: Carolin
authors.initials: C
authors.lastname: Reischauer
authors.affiliation: Institute for Biomedical Engineering, University and ETH Zurich, Gloriastrasse 35, 8092 Zurich, Switzerland.
authors.forename: Peter
authors.initials: P
authors.lastname: Boesiger
mesh_terms: D000465:Algorithms; D001931:Brain Mapping / Q000379:methods*; D038524:Diffusion Magnetic Resonance Imaging / Q000379:methods*; D056324:Diffusion Tensor Imaging / Q000379:methods*; D006801:Humans; D007091:Image Processing, Computer-Assisted / Q000379:methods*; D011336:Probability
keywords: Bootstrap; Connectivity map; Diffusion tensor imaging; Graph theory; Probabilistic tractography