Application of neuroanatomical features to tractography clustering

Population-based tract-to-region connectome of the human brain and its hierarchical topology

Connectome maps region-to-region connectivities but does not inform which white matter pathways form the connections. Here we constructed a population-based tract-to-region connectome to fill this information gap. The constructed connectome quantifies the population probability of a white matter tract innervating a cortical region. The results show that ~85% of the tract-to-region connectome entries are consistent across individuals, whereas the remaining (~15%) have substantial individual differences requiring individualized mapping. Further hierarchical clustering on cortical regions revealed dorsal, ventral, and limbic networks based on the tract-to-region connective patterns. The clustering results on white matter bundles revealed the categorization of fiber bundle systems in the association pathways. This tract-to-region connectome provides insights into the connective topology between cortical regions and white matter bundles. The derived hierarchical relation further offers a categorization of gray and white matter structures.

The brain connectome maps region-to-region connections but often ignores the role of the connecting pathways. Here, the authors mapped the tract-to-region relations to reveal the hierarchical relation of fiber bundles and dorsal, ventral, and limbic networks.

TRActs constrained by UnderLying INfant anatomy (TRACULInA): An automated probabilistic tractography tool with anatomical priors for use in the newborn brain

The ongoing myelination of white-matter fiber bundles plays a significant role in brain development. However, reliable and consistent identification of these bundles from infant brain MRIs is often challenging due to inherently low diffusion anisotropy, as well as motion and other artifacts. In this paper we introduce a new tool for automated probabilistic tractography specifically designed for newborn infants. Our tool incorporates prior information about the anatomical neighborhood of white-matter pathways from a training data set. In our experiments, we evaluate this tool on data from both full-term and prematurely born infants and demonstrate that it can reconstruct known white-matter tracts in both groups robustly, even in the presence of differences between the training set and study subjects. Additionally, we evaluate it on a publicly available large data set of healthy term infants (UNC Early Brain Development Program). This paves the way for performing a host of sophisticated analyses in newborns that we have previously implemented for the adult brain, such as pointwise analysis along tracts and longitudinal analysis, in both health and disease.

Fast density-peaks clustering for registration-free pediatric white matter tract analysis

Clustering white matter (WM) tracts from diffusion tensor imaging (DTI) is primarily important for quantitative analysis on pediatric brain development. A recently developed algorithm, density peaks (DP) clustering, demonstrates great robustness to the complex structural variations of WM tracts without any prior templates. Nevertheless, the calculation of densities, the core step of DP, is time consuming especially when the number of WM fibers is huge. In this paper, we propose a fast algorithm that accelerates the density computation about 50 times over the original one. We convert the global calculation for the density as well as critical parameter in the process into local computations, and develop a binary tree structure to orderly store the neighbors for these local computations. Hence, the density computation turns out to be a direct access of the structure, rendering significantly computational saving. Performing experiments on synthetic point data and the JHU-DTI data set and comparing results of our fast DP algorithm and existing clustering methods, we can validate the efficiency and effectiveness of our fast DP algorithm. Finally, we demonstrate the application of the proposed algorithm on the analysis of pediatric WM tract development.

Investigation into local white matter abnormality in emotional processing and sensorimotor areas using an automatically annotated fiber clustering in major depressive disorder

This work presents an automatically annotated fiber cluster (AAFC) method to enable identification of anatomically meaningful white matter structures from the whole brain tractography. The proposed method consists of 1) a study-specific whole brain white matter parcellation using a well-established data-driven groupwise fiber clustering pipeline to segment tractography into multiple fiber clusters, and 2) a novel cluster annotation method to automatically assign an anatomical tract annotation to each fiber cluster by employing cortical parcellation information across multiple subjects. The novelty of the AAFC method is that it leverages group-wise information about the fiber clusters, including their fiber geometry and cortical terminations, to compute a tract anatomical label for each cluster in an automated fashion. We demonstrate the proposed AAFC method in an application of investigating white matter abnormality in emotional processing and sensorimotor areas in major depressive disorder (MDD). Seven tracts of interest related to emotional processing and sensorimotor functions are automatically identified using the proposed AAFC method as well as a comparable method that uses a cortical parcellation alone. Experimental results indicate that our proposed method is more consistent in identifying the tracts across subjects and across hemispheres in terms of the number of fibers. In addition, we perform a between-group statistical analysis in 31 MDD patients and 62 healthy subjects on the identified tracts using our AAFC method. We find statistical differences in diffusion measures in local regions within a fiber tract (e.g. 4 fiber clusters within the identified left hemisphere cingulum bundle (consisting of 14 clusters) are significantly different between the two groups), suggesting the ability of our method in identifying potential abnormality specific to subdivisions of a white matter structure.

An anatomically curated fiber clustering white matter atlas for consistent white matter tract parcellation across the lifespan

This work presents an anatomically curated white matter atlas to enable consistent white matter tract parcellation across different populations. Leveraging a well-established computational pipeline for fiber clustering, we create a tract-based white matter atlas including information from 100 subjects. A novel anatomical annotation method is proposed that leverages population-based brain anatomical information and expert neuroanatomical knowledge to annotate and categorize the fiber clusters. A total of 256 white matter structures are annotated in the proposed atlas, which provides one of the most comprehensive tract-based white matter atlases covering the entire brain to date. These structures are composed of 58 deep white matter tracts including major long range association and projection tracts, commissural tracts, and tracts related to the brainstem and cerebellar connections, plus 198 short and medium range superficial fiber clusters organized into 16 categories according to the brain lobes they connect. Potential false positive connections are annotated in the atlas to enable their exclusion from analysis or visualization. In addition, the proposed atlas allows for a whole brain white matter parcellation into 800 fiber clusters to enable whole brain connectivity analyses. The atlas and related computational tools are open-source and publicly available. We evaluate the proposed atlas using a testing dataset of 584 diffusion MRI scans from multiple independently acquired populations, across genders, the lifespan (1 day-82 years), and different health conditions (healthy control, neuropsychiatric disorders, and brain tumor patients). Experimental results show successful white matter parcellation across subjects from different populations acquired on multiple scanners, irrespective of age, gender or disease indications. Over 99% of the fiber tracts annotated in the atlas were detected in all subjects on average. One advantage in terms of robustness is that the tract-based pipeline does not require any cortical or subcortical segmentations, which can have limited success in young children and patients with brain tumors or other structural lesions. We believe this is the first demonstration of consistent automated white matter tract parcellation across the full lifespan from birth to advanced age.

Neighborhood resolved fiber orientation distributions (NRFOD) in automatic labeling of white matter fiber pathways

Accurate digital representation of major white matter bundles in the brain is an important goal in neuroscience image computing since the representations can be used for surgical planning, intra-patient longitudinal analysis and inter-subject population connectivity studies. Reconstructing desired fiber bundles generally involves manual selection of regions of interest by an expert, which is subject to user bias and fatigue, hence an automation is desirable. To that end, we first present a novel anatomical representation based on Neighborhood Resolved Fiber Orientation Distributions (NRFOD) along the fibers. The resolved fiber orientations are obtained by generalized q-sampling imaging (GQI) and a subsequent diffusion decomposition method. A fiber-to-fiber distance measure between the proposed fiber representations is then used in a density-based clustering framework to select the clusters corresponding to the major pathways of interest. In addition, neuroanatomical priors are utilized to constrain the set of candidate fibers before density-based clustering. The proposed fiber clustering approach is exemplified on automation of the reconstruction of the major fiber pathways in the brainstem: corticospinal tract (CST); medial lemniscus (ML); middle cerebellar peduncle (MCP); inferior cerebellar peduncle (ICP); superior cerebellar peduncle (SCP). Experimental results on Human Connectome Project (HCP)'s publicly available "WU-Minn 500 Subjects + MEG2 dataset" and expert evaluations demonstrate the potential of the proposed fiber clustering method in brainstem white matter structure analysis.

AnatomiCuts: Hierarchical clustering of tractography streamlines based on anatomical similarity

Diffusion MRI tractography produces massive sets of streamlines that contain a wealth of information on brain connections. The size of these datasets creates a need for automated clustering methods to group the streamlines into meaningful bundles. Conventional clustering techniques group streamlines based on their spatial coordinates. Neuroanatomists, however, define white-matter bundles based on the anatomical structures that they go through or next to, rather than their spatial coordinates. Thus we propose a similarity measure for clustering streamlines based on their position relative to cortical and subcortical brain regions. We incorporate this measure into a hierarchical clustering algorithm and compare it to a measure that relies on Euclidean distance, using data from the Human Connectome Project. We show that the anatomical similarity measure leads to a 20% improvement in the overlap of clusters with manually labeled tracts. Importantly, this is achieved without introducing any prior information from a tract atlas into the clustering algorithm, therefore without imposing the existence of any named tracts.

Automated segmentation of white matter fiber bundles using diffusion tensor imaging data and a new density based clustering algorithm

OBJECTIVE

Robust and accurate segmentation of brain white matter (WM) fiber bundles assists in diagnosing and assessing progression or remission of neuropsychiatric diseases such as schizophrenia, autism and depression. Supervised segmentation methods are infeasible in most applications since generating gold standards is too costly. Hence, there is a growing interest in designing unsupervised methods. However, most conventional unsupervised methods require the number of clusters be known in advance which is not possible in most applications. The purpose of this study is to design an unsupervised segmentation algorithm for brain white matter fiber bundles which can automatically segment fiber bundles using intrinsic diffusion tensor imaging data information without considering any prior information or assumption about data distributions.

METHODS AND MATERIAL

Here, a new density based clustering algorithm called neighborhood distance entropy consistency (NDEC), is proposed which discovers natural clusters within data by simultaneously utilizing both local and global density information. The performance of NDEC is compared with other state of the art clustering algorithms including chameleon, spectral clustering, DBSCAN and k-means using Johns Hopkins University publicly available diffusion tensor imaging data.

RESULTS

The performance of NDEC and other employed clustering algorithms were evaluated using dice ratio as an external evaluation criteria and density based clustering validation (DBCV) index as an internal evaluation metric. Across all employed clustering algorithms, NDEC obtained the highest average dice ratio (0.94) and DBCV value (0.71).

CONCLUSIONS

NDEC can find clusters with arbitrary shapes and densities and consequently can be used for WM fiber bundle segmentation where there is no distinct boundary between various bundles. NDEC may also be used as an effective tool in other pattern recognition and medical diagnostic systems in which discovering natural clusters within data is a necessity.

An Example-Based Multi-Atlas Approach to Automatic Labeling of White Matter Tracts

We present an example-based multi-atlas approach for classifying white matter (WM) tracts into anatomic bundles. Our approach exploits expert-provided example data to automatically classify the WM tracts of a subject. Multiple atlases are constructed to model the example data from multiple subjects in order to reflect the individual variability of bundle shapes and trajectories over subjects. For each example subject, an atlas is maintained to allow the example data of a subject to be added or deleted flexibly. A voting scheme is proposed to facilitate the multi-atlas exploitation of example data. For conceptual simplicity, we adopt the same metrics in both example data construction and WM tract labeling. Due to the huge number of WM tracts in a subject, it is time-consuming to label each WM tract individually. Thus, the WM tracts are grouped according to their shape similarity, and WM tracts within each group are labeled simultaneously. To further enhance the computational efficiency, we implemented our approach on the graphics processing unit (GPU). Through nested cross-validation we demonstrated that our approach yielded high classification performance. The average sensitivities for bundles in the left and right hemispheres were 89.5% and 91.0%, respectively, and their average false discovery rates were 14.9% and 14.2%, respectively.

Overcoming the effects of false positives and threshold bias in graph theoretical analyses of neuroimaging data

Graph theory (GT) is a powerful framework for quantifying topological features of neuroimaging-derived functional and structural networks. However, false positive (FP) connections arise frequently and influence the inferred topology of networks. Thresholding is often used to overcome this problem, but an appropriate threshold often relies on a priori assumptions, which will alter inferred network topologies. Four common network metrics (global efficiency, mean clustering coefficient, mean betweenness and smallworldness) were tested using a model tractography dataset. It was found that all four network metrics were significantly affected even by just one FP. Results also show that thresholding effectively dampens the impact of FPs, but at the expense of adding significant bias to network metrics. In a larger number (n=248) of tractography datasets, statistics were computed across random group permutations for a range of thresholds, revealing that statistics for network metrics varied significantly more than for non-network metrics (i.e., number of streamlines and number of edges). Varying degrees of network atrophy were introduced artificially to half the datasets, to test sensitivity to genuine group differences. For some network metrics, this atrophy was detected as significant (p<0.05, determined using permutation testing) only across a limited range of thresholds. We propose a multi-threshold permutation correction (MTPC) method, based on the cluster-enhanced permutation correction approach, to identify sustained significant effects across clusters of thresholds. This approach minimises requirements to determine a single threshold a priori. We demonstrate improved sensitivity of MTPC-corrected metrics to genuine group effects compared to an existing approach and demonstrate the use of MTPC on a previously published network analysis of tractography data derived from a clinical population. In conclusion, we show that there are large biases and instability induced by thresholding, making statistical comparisons of network metrics difficult. However, by testing for effects across multiple thresholds using MTPC, true group differences can be robustly identified.

Sequential Hierarchical Agglomerative Clustering of White Matter Fiber Pathways

OBJECTIVE

We consider the problem of clustering white matter fiber pathways, extracted from diffusion MRI data via tractography, into bundles that are consistent with the neuroanatomy.

METHODS

We cast this problem as clustering streams of data, and use a sequential framework to process one fiber at a time. Our method, named as sequential hierarchical agglomerative clustering (HAC), represents the clusters with parametric models, performs HAC of relatively small number of fibers only when the parameters need to be initialized and/or updated, and assigns the labels to the following streams of data according to the current models.

RESULTS

Experiments on phantom data evaluate the sensitivity of our method to initialization and parameter tuning, and show its advantages over alternative techniques. Experiments on real data demonstrate its efficacy and speed in clustering white matter fiber pathways into anatomically distinct bundles.

CONCLUSION

Sequential HAC is a fast method that benefits from having a predefined number of clusters, and rapidly assigns labels to incoming data with high accuracy. It can be thought of as a mechanism that does clustering, while simultaneously accepting newly computed fibers; thereby, alleviating the burden of computing the distances between every pair of fibers in a tractogram.

SIGNIFICANCE

Sequential HAC is a practical tool that can interactively cluster fiber pathways and can be integrated into fiber tracking, which will be very useful for clinical researchers and neuroanatomists.

Non-Negative Spherical Deconvolution (NNSD) for estimation of fiber Orientation Distribution Function in single-/multi-shell diffusion MRI

Spherical Deconvolution (SD) is commonly used for estimating fiber Orientation Distribution Functions (fODFs) from diffusion-weighted signals. Existing SD methods can be classified into two categories: 1) Continuous Representation based SD (CR-SD), where typically Spherical Harmonic (SH) representation is used for convenient analytical solutions, and 2) Discrete Representation based SD (DR-SD), where the signal profile is represented by a discrete set of basis functions uniformly oriented on the unit sphere. A feasible fODF should be non-negative and should integrate to unity throughout the unit sphere S(2). However, to our knowledge, most existing SH-based SD methods enforce non-negativity only on discretized points and not the whole continuum of S(2). Maximum Entropy SD (MESD) and Cartesian Tensor Fiber Orientation Distributions (CT-FOD) are the only SD methods that ensure non-negativity throughout the unit sphere. They are however computational intensive and are susceptible to errors caused by numerical spherical integration. Existing SD methods are also known to overestimate the number of fiber directions, especially in regions with low anisotropy. DR-SD introduces additional error in peak detection owing to the angular discretization of the unit sphere. This paper proposes a SD framework, called Non-Negative SD (NNSD), to overcome all the limitations above. NNSD is significantly less susceptible to the false-positive peaks, uses SH representation for efficient analytical spherical deconvolution, and allows accurate peak detection throughout the whole unit sphere. We further show that NNSD and most existing SD methods can be extended to work on multi-shell data by introducing a three-dimensional fiber response function. We evaluated NNSD in comparison with Constrained SD (CSD), a quadratic programming variant of CSD, MESD, and an L1-norm regularized non-negative least-squares DR-SD. Experiments on synthetic and real single-/multi-shell data indicate that NNSD improves estimation performance in terms of mean difference of angles, peak detection consistency, and anisotropy contrast between isotropic and anisotropic regions.

Uncertainty estimation in diffusion MRI using the nonlocal bootstrap

In this paper, we propose a new bootstrap scheme, called the nonlocal bootstrap (NLB) for uncertainty estimation. In contrast to the residual bootstrap, which relies on a data model, or the repetition bootstrap, which requires repeated signal measurements, NLB is not restricted by the data structure imposed by a data model and obviates the need for time-consuming multiple acquisitions. NLB hinges on the observation that local imaging information recurs in an image. This self-similarity implies that imaging information coming from spatially distant (nonlocal) regions can be exploited for more effective estimation of statistics of interest. Evaluations using in silico data indicate that NLB produces distribution estimates that are in closer agreement with those generated using Monte Carlo simulations, compared with the conventional residual bootstrap. Evaluations using in vivo data demonstrate that NLB produces results that are in agreement with our knowledge on white matter architecture.

Automatic clustering of white matter fibers in brain diffusion MRI with an application to genetics

To understand factors that affect brain connectivity and integrity, it is beneficial to automatically cluster white matter (WM) fibers into anatomically recognizable tracts. Whole brain tractography, based on diffusion-weighted MRI, generates vast sets of fibers throughout the brain; clustering them into consistent and recognizable bundles can be difficult as there are wide individual variations in the trajectory and shape of WM pathways. Here we introduce a novel automated tract clustering algorithm based on label fusion--a concept from traditional intensity-based segmentation. Streamline tractography generates many incorrect fibers, so our top-down approach extracts tracts consistent with known anatomy, by mapping multiple hand-labeled atlases into a new dataset. We fuse clustering results from different atlases, using a mean distance fusion scheme. We reliably extracted the major tracts from 105-gradient high angular resolution diffusion images (HARDI) of 198 young normal twins. To compute population statistics, we use a pointwise correspondence method to match, compare, and average WM tracts across subjects. We illustrate our method in a genetic study of white matter tract heritability in twins.

Atlas-guided cluster analysis of large tractography datasets

Diffusion Tensor Imaging (DTI) and fiber tractography are important tools to map the cerebral white matter microstructure in vivo and to model the underlying axonal pathways in the brain with three-dimensional fiber tracts. As the fast and consistent extraction of anatomically correct fiber bundles for multiple datasets is still challenging, we present a novel atlas-guided clustering framework for exploratory data analysis of large tractography datasets. The framework uses an hierarchical cluster analysis approach that exploits the inherent redundancy in large datasets to time-efficiently group fiber tracts. Structural information of a white matter atlas can be incorporated into the clustering to achieve an anatomically correct and reproducible grouping of fiber tracts. This approach facilitates not only the identification of the bundles corresponding to the classes of the atlas; it also enables the extraction of bundles that are not present in the atlas. The new technique was applied to cluster datasets of 46 healthy subjects. Prospects of automatic and anatomically correct as well as reproducible clustering are explored. Reconstructed clusters were well separated and showed good correspondence to anatomical bundles. Using the atlas-guided cluster approach, we observed consistent results across subjects with high reproducibility. In order to investigate the outlier elimination performance of the clustering algorithm, scenarios with varying amounts of noise were simulated and clustered with three different outlier elimination strategies. By exploiting the multithreading capabilities of modern multiprocessor systems in combination with novel algorithms, our toolkit clusters large datasets in a couple of minutes. Experiments were conducted to investigate the achievable speedup and to demonstrate the high performance of the clustering framework in a multiprocessing environment.

Diffusion tensor image registration using hybrid connectivity and tensor features

Most existing diffusion tensor imaging (DTI) registration methods estimate structural correspondences based on voxelwise matching of tensors. The rich connectivity information that is given by DTI, however, is often neglected. In this article, we propose to integrate complementary information given by connectivity features and tensor features for improved registration accuracy. To utilize connectivity information, we place multiple anchors representing different brain anatomies in the image space, and define the connectivity features for each voxel as the geodesic distances from all anchors to the voxel under consideration. The geodesic distance, which is computed in relation to the tensor field, encapsulates information of brain connectivity. We also extract tensor features for every voxel to reflect the local statistics of tensors in its neighborhood. We then combine both connectivity features and tensor features for registration of tensor images. From the images, landmarks are selected automatically and their correspondences are determined based on their connectivity and tensor feature vectors. The deformation field that deforms one tensor image to the other is iteratively estimated and optimized according to the landmarks and their associated correspondences. Experimental results show that, by using connectivity features and tensor features simultaneously, registration accuracy is increased substantially compared with the cases using either type of features alone.

Fiber clustering versus the parcellation-based connectome

We compare two strategies for modeling the connections of the brain's white matter: fiber clustering and the parcellation-based connectome. Both methods analyze diffusion magnetic resonance imaging fiber tractography to produce a quantitative description of the brain's connections. Fiber clustering is designed to reconstruct anatomically-defined white matter tracts, while the parcellation-based white matter segmentation enables the study of the brain as a network. From the perspective of white matter segmentation, we compare and contrast the goals and methods of the parcellation-based and clustering approaches, with special focus on reviewing the field of fiber clustering. We also propose a third category of new hybrid methods that combine the aspects of parcellation and clustering, for joint analysis of connection structure and anatomy or function. We conclude that these different approaches for segmentation and modeling of the white matter can advance the neuroscientific study of the brain's connectivity in complementary ways.

A robust variational approach for simultaneous smoothing and estimation of DTI

Estimating diffusion tensors is an essential step in many applications - such as diffusion tensor image (DTI) registration, segmentation and fiber tractography. Most of the methods proposed in the literature for this task are not simultaneously statistically robust and feature preserving techniques. In this paper, we propose a novel and robust variational framework for simultaneous smoothing and estimation of diffusion tensors from diffusion MRI. Our variational principle makes use of a recently introduced total Kullback-Leibler (tKL) divergence for DTI regularization. tKL is a statistically robust dissimilarity measure for diffusion tensors, and regularization by using tKL ensures the symmetric positive definiteness of tensors automatically. Further, the regularization is weighted by a non-local factor adapted from the conventional non-local means filters. Finally, for the data fidelity, we use the nonlinear least-squares term derived from the Stejskal-Tanner model. We present experimental results depicting the positive performance of our method in comparison to competing methods on synthetic and real data examples.

Spatial transformation of DWI data using non-negative sparse representation

This paper presents an algorithm to transform and reconstruct diffusion-weighted imaging (DWI) data for alignment of micro-structures in association with spatial transformations. The key idea is to decompose the diffusion signal profile, a function defined on a unit sphere, into a series of weighted diffusion basis functions (DBFs), reorient these weighted DBFs independently based on the local affine transformation, and then recompose the reoriented weighted DBFs to obtain the final transformed diffusion signal profile. The decomposition is performed in a sparse representation framework in recognition of the fact that each diffusion signal profile is often resulting from a small number of fiber populations. A non-negative constraint is further imposed so that noise-induced negative lobes in the profile can be avoided. The proposed framework also explicitly models the isotropic component of the diffusion signals to avoid undesirable artifacts during transformation. In contrast to existing methods, the current algorithm allows the transformation to be executed directly in the signal space, thus allowing any diffusion models to be fitted to the data after transformation.