Fiber segmentation using constrained clustering

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work we introduce the novel concept of applying constraints into the fiber segmentation problem within a clustering based framework. The segmentation process is guided in an interactive manner. It allows the definition of relationships between individual and sets of fibers. These relationships are realized as pairwise linkage constraints to perform a constrained clustering. Furthermore, they can be refined iteratively, making the process of segmenting tracts quicker and more intuitive. The current implementation is based on a constrained threshold based clustering algorithm using the mean closest point distance as measure to estimate the similarity between fibers. The feasibility and the advantage of constrained clustering are demonstrated via segmentation of a set of specific tracts such as the cortico-spinal tracts and corpus collosum. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Abdala, D. D., & Jiang, X. (2010). Fiber segmentation using constrained clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6165 LNCS, pp. 1–10). https://doi.org/10.1007/978-3-642-13923-9_1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free