Graph-based fibre tractography computing shortest paths between regions of interest
Publikation: Konferencebidrag › Konferenceabstrakt til konference › Forskning
Standard
Graph-based fibre tractography computing shortest paths between regions of interest. / Kasenburg, Niklas; Liptrot, Matthew George; Borgwardt, Karsten; Ørting, Silas Nyboe; Nielsen, Mads; Feragen, Aasa.
2014. Abstract fra Joint Annual Meeting ISMRM-ESMRMB 2014, Milano, Italien.Publikation: Konferencebidrag › Konferenceabstrakt til konference › Forskning
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - ABST
T1 - Graph-based fibre tractography computing shortest paths between regions of interest
AU - Kasenburg, Niklas
AU - Liptrot, Matthew George
AU - Borgwardt, Karsten
AU - Ørting, Silas Nyboe
AU - Nielsen, Mads
AU - Feragen, Aasa
PY - 2014
Y1 - 2014
N2 - 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.
AB - 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.
M3 - Conference abstract for conference
T2 - Joint Annual Meeting ISMRM-ESMRMB 2014
Y2 - 10 May 2014 through 16 May 2014
ER -
ID: 151951706