DTI connectivity by segmentation

0Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graph-based approaches to connectivity definition, but formulates the estimation problem in the continuum. In particular, it defines the connectivity through the minimum cut in tensor-weighted space. It is therefore closely related to prior work on segmentation using continuous versions of graph cuts. A numerical solution based on a staggered grid is proposed which allows for the computation of flux directly through diffusion tensors. The resulting global connectivity measure is the maximum diffusive flow supported between two regions of interest. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Niethammer, M., Boucharin, A., Zach, C., Shi, Y., Maltbie, E., Sanchez, M., & Styner, M. (2010). DTI connectivity by segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6326 LNCS, pp. 200–210). https://doi.org/10.1007/978-3-642-15699-1_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free