Cookies on this website
We use cookies to ensure that we give you the best experience on our website. If you click 'Continue' we'll assume that you are happy to receive all cookies and you won't see this message again. Click 'Find out more' for information on how to change your cookie settings.

Graph-based distributed tractography of the brain provides an alternative to streamline approaches. However, graph-based tracking through complex fibre configurations has not been extensively studied and existing methods have inherent limitations. In this study, we discuss these limitations and present a new approach for robustly propagating through fibre crossings, as these are depicted by the Q-ball orientation distribution functions (ODFs). Complex ODFs are decomposed to components representative of single-fibre populations and an appropriate image graph is created. Path strengths are calculated using a modified version of Dijkstra's shortest path algorithm. A comparison with existing methods is performed on simulated and on human Q-ball imaging data. © 2009 IEEE.

Original publication

DOI

10.1109/ISBI.2009.5193326

Type

Conference

Publication Date

17/11/2009

Pages

1394 - 1397