Efficient fiber clustering using parameterized polynomials

Jan Klein; Hannes Stuke; Bram Stieltjes; Olaf Konrad; Horst K. Hahn; Heinz-Otto Peitgen

doi:10.1117/12.768925

15 March 2008 Efficient fiber clustering using parameterized polynomials

Jan Klein, Hannes Stuke, Bram Stieltjes, Olaf Konrad, Horst K. Hahn, Heinz-Otto Peitgen

Proceedings Volume 6918, Medical Imaging 2008: Visualization, Image-Guided Procedures, and Modeling; 69182X (2008) https://doi.org/10.1117/12.768925
Event: Medical Imaging, 2008, San Diego, California, United States

Abstract

In the past few years, fiber clustering algorithms have shown to be a very powerful tool for grouping white matter connections tracked in DTI images into anatomically meaningful bundles. They improve the visualization and perception, and could enable robust quantification and comparison between individuals. However, most existing techniques perform a coarse approximation of the fibers due to the high complexity of the underlying clustering problem or do not allow for an efficient clustering in real time. In this paper, we introduce new algorithms and data structures which overcome both problems. The fibers are represented very precisely and efficiently by parameterized polynomials defining the x-, y-, and z-component individually. A two-step clustering method determines possible clusters having a Gaussian distributed structure within one component and, afterwards, verifies their existences by principal component analysis (PCA) with respect to the other two components. As the PCA has to be performed only n times for a constant number of points, the clustering can be done in linear time O(n), where n denotes the number of fibers. This drastically improves on existing techniques, which have a high, quadratic running time, and it allows for an efficient whole brain fiber clustering. Furthermore, our new algorithms can easily be used for detecting corresponding clusters in different brains without time-consuming registration methods. We show a high reliability, robustness and efficiency of our new algorithms based on several artificial and real fiber sets that include different elements of fiber architecture such as fiber kissing, crossing and nested fiber bundles.

Citation Download Citation

Jan Klein, Hannes Stuke, Bram Stieltjes, Olaf Konrad, Horst K. Hahn, and Heinz-Otto Peitgen "Efficient fiber clustering using parameterized polynomials", Proc. SPIE 6918, Medical Imaging 2008: Visualization, Image-Guided Procedures, and Modeling, 69182X (15 March 2008); https://doi.org/10.1117/12.768925

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available