QuickBundles, a Method for Tractography Simplification
Eleftherios Garyfallidis, Matthew Brett, Marta Correia et al. · Frontiers in Neuroscience · 2012
Diffusion MR data sets produce large numbers of streamlines which are hard to visualize, interact with, and interpret in a clinically acceptable time scale, despite numerous proposed approaches. As a solution we present a simple, compact, tailor-made clustering algorithm, QuickBundles (QB), that overcomes the complexity of these large data sets and provides informative clusters in seconds. Each QB cluster can be represented by a single centroid streamline; collectively these centroid streamlines can be taken as an effective representation of the tractography. We provide a number of tests to show how the QB reduction has good consistency and robustness. We show how the QB reduction can help in the search for similarities across several subjects.
Cited by 312 works. doi:10.3389/fnins.2012.00175 Open-access PDF
Authors
References
- Maximum Likelihood from Incomplete Data Via the EM Algorithm
- Some methods for classification and analysis of multivariate observations
- Practical Statistics for Medical Research.
- The Hungarian method for the assignment problem
- Practical Statistics for Medical Research
- Practical Statistics for Medical Research.
- Clustering to minimize the maximum intercluster distance
- BIRCH: A New Data Clustering Algorithm and Its Applications
- Handbook of MRI Pulse Sequences
- The Hungarian method for the assignment problem