A Comparison of Metrics and Algorithms for Fiber Clustering

Abstract : Diffusion-weighted Magnetic Resonance Imaging (dMRI) can unveil the microstructure of the brain white matter. The analysis of the anisotropy observed in the dMRI contrast with tractography methods can help to understand the pattern of connections between brain regions and characterize neurological diseases. Because of the amount of information produced by such analyses and the errors carried by the reconstruction step, it is necessary to simplify this output. Clustering algorithms can be used to group samples that are similar according to a given metric. We propose to explore the well-known clustering algorithm k-means and a recently available one, QuickBundles [1]. We propose an efficient procedure to associate k-means with Point Density Model, a recently proposed metric to analyze geometric structures. We analyze the performance and usability of these algorithms on manually labeled data and a database a 10 subjects.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-00858115
Contributor : Viviana Siless <>
Submitted on : Wednesday, September 4, 2013 - 4:31:36 PM
Last modification on : Thursday, March 7, 2019 - 3:34:14 PM
Long-term archiving on : Thursday, April 6, 2017 - 3:18:38 PM

File

FiberClusteringPRNI.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00858115, version 1

Collections

Citation

Viviana Siless, Sergio Medina, Gaël Varoquaux, Bertrand Thirion. A Comparison of Metrics and Algorithms for Fiber Clustering. Pattern Recognition in NeuroImaging, Jun 2013, Philadelphia, United States. ⟨hal-00858115⟩

Share

Metrics

Record views

1100

Files downloads

559