We propose a fiber clustering algorithm composed by several steps, with the objective of representing the whole dataset by a small set of cluster centroids. First, a clustering is performed separately for a subset of points within the streamlines. The obtained point clusters are then used to regroup the fibers having common point clusters. Next, fiber clusters are filtered out by size and finally regroup using a quick merge based on a maximum Euclidean distance. A reduced set of regular and thin clusters is finally obtained. In contrast to previous works, the proposed method is only based on streamline structure.
How to access this content:
For one year after publication, abstracts and videos are only open to registrants of this annual meeting. Registrants should use their existing login information. Non-registrant access can be purchased via the ISMRM E-Library.
After one year, current ISMRM & ISMRT members get free access to both the abstracts and videos. Non-members and non-registrants must purchase access via the ISMRM E-Library.
After two years, the meeting proceedings (abstracts) are opened to the public and require no login information. Videos remain behind password for access by members, registrants and E-Library customers.
Keywords