Graph-based fibre tractography computing shortest paths between regions of interest

Publikation: KonferencebidragKonferenceabstrakt til konferenceForskning

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: KonferencebidragKonferenceabstrakt til konferenceForskning

Harvard

Kasenburg, N, Liptrot, MG, Borgwardt, K, Ørting, SN, Nielsen, M & Feragen, A 2014, 'Graph-based fibre tractography computing shortest paths between regions of interest', Joint Annual Meeting ISMRM-ESMRMB 2014, Milano, Italien, 10/05/2014 - 16/05/2014. <http://cds.ismrm.org/protected/14MPresentations/abstracts/4512.pdf>

APA

Kasenburg, N., Liptrot, M. G., Borgwardt, K., Ørting, S. N., Nielsen, M., & Feragen, A. (2014). Graph-based fibre tractography computing shortest paths between regions of interest. Abstract fra Joint Annual Meeting ISMRM-ESMRMB 2014, Milano, Italien. http://cds.ismrm.org/protected/14MPresentations/abstracts/4512.pdf

Vancouver

Kasenburg N, Liptrot MG, Borgwardt K, Ørting SN, Nielsen M, Feragen A. Graph-based fibre tractography computing shortest paths between regions of interest. 2014. Abstract fra Joint Annual Meeting ISMRM-ESMRMB 2014, Milano, Italien.

Author

Kasenburg, Niklas ; Liptrot, Matthew George ; Borgwardt, Karsten ; Ørting, Silas Nyboe ; Nielsen, Mads ; Feragen, Aasa. / Graph-based fibre tractography computing shortest paths between regions of interest. Abstract fra Joint Annual Meeting ISMRM-ESMRMB 2014, Milano, Italien.1 s.

Bibtex

@conference{74ea97e69c554df7b09fd53a09858cb3,
title = "Graph-based fibre tractography computing shortest paths between regions of interest",
abstract = "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.",
author = "Niklas Kasenburg and Liptrot, {Matthew George} and Karsten Borgwardt and {\O}rting, {Silas Nyboe} and Mads Nielsen and Aasa Feragen",
year = "2014",
language = "English",
note = "Joint Annual Meeting ISMRM-ESMRMB 2014 : fashioning MR to improve global healthcare ; Conference date: 10-05-2014 Through 16-05-2014",

}

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