Fast Clustering for Interactive Tractography Segmentation

We developed a novel interactive system for human brain tractography segmentation to assist neuroanatomists in identifying white matter anatomical structures of interest from diffusion magnetic resonance imaging (dMRI) data. The difficulty in segmenting and navigating tractographies lies in the very large number of reconstructed neuronal pathways, i.e. the streamlines, which are in the order of hundreds of thousands with modern dMRI techniques. The novelty of our system resides in presenting the user a clustered version of the tractography in which she selects some of the clusters to identify a superset of the streamlines of interest. This superset is then re-clustered at a finer scale and again the user is requested to select the relevant clusters. The process of re-clustering and manual selection is iterated until the remaining streamlines faithfully represent the desired anatomical structure of interest. In this work we present a solution to solve the computational issue of clustering a large number of streamlines under the strict time constraints requested by the interactive use. The solution consists in embedding the streamlines into a Euclidean space and then in adopting a state-of-the art scalable implementation of the k-means algorithm. We tested the proposed system on tractographies from amyotrophic lateral sclerosis (ALS) patients and healthy subjects that we collected for a forthcoming study about the systematic differences between their corticospinal tracts.

[1]  Charles Elkan,et al.  Fast recognition of musical genres using RBF networks , 2005, IEEE Transactions on Knowledge and Data Engineering.

[2]  Robert P. W. Duin,et al.  Prototype selection for dissimilarity-based classifiers , 2006, Pattern Recognit..

[3]  W. Eric L. Grimson,et al.  Tractography Segmentation Using a Hierarchical Dirichlet Processes Mixture Model , 2009, IPMI.

[4]  Emanuele Olivetti,et al.  The Approximation of the Dissimilarity Projection , 2012, 2012 Second International Workshop on Pattern Recognition in NeuroImaging.

[5]  Gina Belmonte,et al.  Evaluation of Corticospinal Tract Impairment in the Brain of Patients With Amyotrophic Lateral Sclerosis by Using Diffusion Tensor Imaging Acquisition Schemes With Different Numbers of Diffusion-Weighting Directions , 2010, Journal of computer assisted tomography.

[6]  David H. Laidlaw,et al.  Identifying White-Matter Fiber Bundles in DTI Data Using an Automated Proximity-Based Fiber-Clustering Method , 2008, IEEE Transactions on Visualization and Computer Graphics.

[7]  Susumu Mori,et al.  Fiber tracking: principles and strategies – a technical review , 2002, NMR in biomedicine.

[8]  Gaël Varoquaux,et al.  Scikit-learn: Machine Learning in Python , 2011, J. Mach. Learn. Res..

[9]  Yoshua Bengio,et al.  Convergence Properties of the K-Means Algorithms , 1994, NIPS.

[10]  P. Basser,et al.  MR diffusion tensor spectroscopy and imaging. , 1994, Biophysical journal.

[11]  Robert P. W. Duin,et al.  A Generalized Kernel Approach to Dissimilarity-based Classification , 2002, J. Mach. Learn. Res..

[12]  Bodo Manthey,et al.  k-Means Has Polynomial Smoothed Complexity , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[13]  D. Sculley,et al.  Web-scale k-means clustering , 2010, WWW '10.