Fast Clustering for Interactive Tractography Segmentation
暂无分享,去创建一个
Paolo Avesani | Nivedita Agarwal | Emanuele Olivetti | Thien Bao Nguyen | Eleftherios Garyfallidis | N. Agarwal | P. Avesani | E. Olivetti | E. Garyfallidis
[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.