DT-MRI fiber tracking: A shortest paths approach
IEEE TRANSACTIONS ON MEDICAL IMAGING | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | Published : 2008
We derive a new fiber tracking algorithm for DT-MRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We demonstrate the ability to precisely reconstruct a diverse range of fiber trajectories in authentic and computer-generated DT-MRI data, for which well-known conventional tracking algorithms are shown to fail. Our approach is to pose fiber tracking as a problem in computing shortest paths in a weighted digraph. Voxels serve as vertices, and edges are included between neighboring voxels. We assign probabilities (weights) to edges using a Bayesian framework. Higher probabilities are assigned to edges that are aligned with fiber trajectories in their..View full abstract
This work was supported in part by the Australian Research Council (ARC). in part by the CASS Foundation, and in part by the Australian Academy of Science.