Abstract #4512
Graph-based fibre tractography computing shortest paths between regions of interest
Niklas Kasenburg 1,2 , Matthew Liptrot 1 , Karsten M. Borgwardt 2,3 , Silas N. rting 1 , Mads Nielsen 1 , and Aasa Feragen 1,2
1
University of Copenhagen, Copenhagen,
Zealand, Denmark,
2
Max
Planck Institutes Tbingen, Tbingen, Baden-Wrttemberg,
Germany,
3
Eberhard
Karls Universitt Tbingen, Baden-Wrttemberg, Germany
We present a novel, graph-based fibre tractography
method, where the graph model can integrate any
diffusion representation provided as an ODF.
Tractography is performed by computing all possible
shortest paths between regions of interest. For each
path a confidence value is computed to assess its
quality. Voxels are scored by the average value of paths
they lie upon. Results for three different known tracts
show the robustness of the method over five healthy
subjects and a high overlap with tract atlases. The
region based approach is especially useful for creating
brain connectivity graphs while not suffering from path
length dependencies.
How to access this content:
For one year after publication, abstracts and videos are only open to registrants of this annual meeting. Registrants should use their existing login information. Non-registrant access can be purchased via the ISMRM E-Library.
After one year, current ISMRM & ISMRT members get free access to both the abstracts and videos. Non-members and non-registrants must purchase access via the ISMRM E-Library.
After two years, the meeting proceedings (abstracts) are opened to the public and require no login information. Videos remain behind password for access by members, registrants and E-Library customers.
Click here for more information on becoming a member.
