Image-driven population analysis through mixture modeling

Groupwise registration with global-local graph shrinkage in atlas construction

Graph-based groupwise registration methods are widely used in atlas construction. Given a group of images, a graph is built whose nodes represent the images, and whose edges represent a geodesic path between two nodes. The distribution of images on an image manifold is explored through edge traversal in a graph. The final atlas is a mean image at the population center of the distribution on the manifold. The procedure of warping all images to the mean image turns to dynamic graph shrinkage in which nodes become closer to each other. Most conventional groupwise registration frameworks construct and shrink a graph without considering the local distribution of images on the dataset manifold and the local structure variations between image pairs. Neglecting the local information fundamentally decrease the accuracy and efficiency when population atlases are built for organs with large inter-subject anatomical variabilities. To overcome the problem, this paper proposes a global-local graph shrinkage approach that can generate accurate atlas. A connected graph is constructed automatically based on global similarities across the images to explore the global distribution. A local image distribution obtained by image clustering is used to simplify the edges of the constructed graph. Subsequently, local image similarities refine the deformation estimated through global image similarity for each image warping along the graph edges. Through the image warping, the overall simplified graph shrinks gradually to yield the atlas with respecting both global and local features. The proposed method is evaluated on 61 synthetic and 20 clinical liver datasets, and the results are compared with those of six state-of-the-art groupwise registration methods. The experimental results show that the proposed method outperforms non-global-local method approaches in terms of accuracy.

An Evaluation of Atlas Selection Methods for Atlas-Based Automatic Segmentation in Radiotherapy Treatment Planning

Atlas-based automatic segmentation is used in radiotherapy planning to accelerate the delineation of organs at risk (OARs). Atlas selection has been proposed as a way to improve the accuracy and execution time of segmentation, assuming that, the more similar the atlas is to the patient, the better the results will be. This paper presents an analysis of atlas selection methods in the context of radiotherapy treatment planning. For a range of commonly contoured OARs, a thorough comparison of a large class of typical atlas selection methods has been performed. For this evaluation, clinically contoured CT images of the head and neck ( N=316 ) and thorax ( N=280 ) were used. The state-of-the-art intensity and deformation similarity-based atlas selection methods were found to compare poorly to perfect atlas selection. Counter-intuitively, atlas selection methods based on a fixed set of representative atlases outperformed atlas selection methods based on the patient image. This study suggests that atlas-based segmentation with currently available selection methods compares poorly to the potential best performance, hampering the clinical utility of atlas-based segmentation. Effective atlas selection remains an open challenge in atlas-based segmentation for radiotherapy planning.

Deep Learning Deformation Initialization for Rapid Groupwise Registration of Inhomogeneous Image Populations

Groupwise image registration tackles biases that can potentially arise from inappropriate template selection. It typically involves simultaneous registration of a cohort of images to a common space that is not specified a priori. Existing groupwise registration methods are computationally complex and are only effective for image populations without large anatomical variations. In this paper, we propose a deep learning framework to rapidly estimate large deformations between images to significantly reduce structural variability. Specifically, we employ a multi-level graph coarsening method to agglomerate similar images into clusters, each represented by an exemplar image. We then use a deep learning framework to predict the initial deformations between images. Warping with the estimated deformations brings the images closer in the image manifold and their alignment can be further refined using conventional groupwise registration algorithms. We evaluated the effectiveness of our method in groupwise registration of MR brain images and compared it against state-of-the-art groupwise registration methods. Experimental results indicate that deformation initialization enables groupwise registration to converge significantly faster with competitive accuracy, therefore facilitates large-scale imaging studies.

Sampling arterial input function (AIF) from peripheral arteries: Comparison of a temporospatial-feature based method against conventional manual method

It is often difficult to accurately localize small arteries in images of peripheral organs, and even more so with vascular abnormality vasculatures, including collateral arteries, in peripheral artery disease (PAD). This poses a challenge for manually sampling arterial input function (AIF) in quantifying dynamic contrast-enhanced (DCE) MRI data of peripheral organs. In this study, we designed a multi-step screening approach that utilizes both the temporal and spatial information of the dynamic images, and is presumably suitable for localizing small and unpredictable peripheral arteries. In 41 DCE MRI datasets acquired from human calf muscles, the proposed method took <5 s on average for sampling AIF for each case, much more efficient than the manual sampling method; AIFs by the two methods were comparable, with Pearson's correlation coefficient of 0.983 ± 0.004 (p-value < 0.01) and relative difference of 2.4% ± 2.6%. In conclusion, the proposed temporospatial-feature based method enables efficient and accurate sampling of AIF from peripheral arteries, and would improve measurement precision and inter-observer consistency for quantitative DCE MRI of peripheral tissues.

A Neonatal Bimodal MR-CT Head Template

Neonatal MR templates are appropriate for brain structural analysis and spatial normalization. However, they do not provide the essential accurate details of cranial bones and fontanels-sutures. Distinctly, CT images provide the best contrast for bone definition and fontanels-sutures. In this paper, we present, for the first time, an approach to create a fully registered bimodal MR-CT head template for neonates with a gestational age of 39 to 42 weeks. Such a template is essential for structural and functional brain studies, which require precise geometry of the head including cranial bones and fontanels-sutures. Due to the special characteristics of the problem (which requires inter-subject inter-modality registration), a two-step intensity-based registration method is proposed to globally and locally align CT images with an available MR template. By applying groupwise registration, the new neonatal CT template is then created in full alignment with the MR template to build a bimodal MR-CT template. The mutual information value between the CT and the MR template is 1.17 which shows their perfect correspondence in the bimodal template. Moreover, the average mutual information value between normalized images and the CT template proposed in this study is 1.24±0.07. Comparing this value with the one reported in a previously published approach (0.63±0.07) demonstrates the better generalization properties of the new created template and the superiority of the proposed method for the creation of CT template in the standard space provided by MR neonatal head template. The neonatal bimodal MR-CT head template is freely downloadable from https://www.u-picardie.fr/labo/GRAMFC.

Beyond Lumping and Splitting: A Review of Computational Approaches for Stratifying Psychiatric Disorders

Heterogeneity is a key feature of all psychiatric disorders that manifests on many levels, including symptoms, disease course, and biological underpinnings. These form a substantial barrier to understanding disease mechanisms and developing effective, personalized treatments. In response, many studies have aimed to stratify psychiatric disorders, aiming to find more consistent subgroups on the basis of many types of data. Such approaches have received renewed interest after recent research initiatives, such as the National Institute of Mental Health Research Domain Criteria and the European Roadmap for Mental Health Research, both of which emphasize finding stratifications that are based on biological systems and that cut across current classifications. We first introduce the basic concepts for stratifying psychiatric disorders and then provide a methodologically oriented and critical review of the existing literature. This shows that the predominant clustering approach that aims to subdivide clinical populations into more coherent subgroups has made a useful contribution but is heavily dependent on the type of data used; it has produced many different ways to subgroup the disorders we review, but for most disorders it has not converged on a consistent set of subgroups. We highlight problems with current approaches that are not widely recognized and discuss the importance of validation to ensure that the derived subgroups index clinically relevant variation. Finally, we review emerging techniques-such as those that estimate normative models for mappings between biology and behavior-that provide new ways to parse the heterogeneity underlying psychiatric disorders and evaluate all methods to meeting the objectives of such as the National Institute of Mental Health Research Domain Criteria and Roadmap for Mental Health Research.

Statistical shape analysis: From landmarks to diffeomorphisms

We offer a blazingly brief review of evolution of shape analysis methods in medical imaging. As the representations and the statistical models grew more sophisticated, the problem of shape analysis has been gradually redefined to accept images rather than binary segmentations as a starting point. This transformation enabled shape analysis to take its rightful place in the arsenal of tools for extracting and understanding patterns in large clinical image sets. We speculate on the future developments in shape analysis and potential applications that would bring this mathematically rich area to bear on clinical practice.

HYDRA: Revealing heterogeneity of imaging and genetic patterns through a multiple max-margin discriminative analysis framework

Multivariate pattern analysis techniques have been increasingly used over the past decade to derive highly sensitive and specific biomarkers of diseases on an individual basis. The driving assumption behind the vast majority of the existing methodologies is that a single imaging pattern can distinguish between healthy and diseased populations, or between two subgroups of patients (e.g., progressors vs. non-progressors). This assumption effectively ignores the ample evidence for the heterogeneous nature of brain diseases. Neurodegenerative, neuropsychiatric and neurodevelopmental disorders are largely characterized by high clinical heterogeneity, which likely stems in part from underlying neuroanatomical heterogeneity of various pathologies. Detecting and characterizing heterogeneity may deepen our understanding of disease mechanisms and lead to patient-specific treatments. However, few approaches tackle disease subtype discovery in a principled machine learning framework. To address this challenge, we present a novel non-linear learning algorithm for simultaneous binary classification and subtype identification, termed HYDRA (Heterogeneity through Discriminative Analysis). Neuroanatomical subtypes are effectively captured by multiple linear hyperplanes, which form a convex polytope that separates two groups (e.g., healthy controls from pathologic samples); each face of this polytope effectively defines a disease subtype. We validated HYDRA on simulated and clinical data. In the latter case, we applied the proposed method independently to the imaging and genetic datasets of the Alzheimer's Disease Neuroimaging Initiative (ADNI 1) study. The imaging dataset consisted of T1-weighted volumetric magnetic resonance images of 123 AD patients and 177 controls. The genetic dataset consisted of single nucleotide polymorphism information of 103 AD patients and 139 controls. We identified 3 reproducible subtypes of atrophy in AD relative to controls: (1) diffuse and extensive atrophy, (2) precuneus and extensive temporal lobe atrophy, as well some prefrontal atrophy, (3) atrophy pattern very much confined to the hippocampus and the medial temporal lobe. The genetics dataset yielded two subtypes of AD characterized mainly by the presence/absence of the apolipoprotein E (APOE) ε4 genotype, but also involving differential presence of risk alleles of CD2AP, SPON1 and LOC39095 SNPs that were associated with differences in the respective patterns of brain atrophy, especially in the precuneus. The results demonstrate the potential of the proposed approach to map disease heterogeneity in neuroimaging and genetic studies.

Capturing heterogeneous group differences using mixture-of-experts: Application to a study of aging

In MRI studies, linear multi-variate methods are often employed to identify regions or connections that are affected due to disease or normal aging. Such linear models inherently assume that there is a single, homogeneous abnormality pattern that is present in all affected individuals. While kernel-based methods can implicitly model a non-linear effect, and therefore the heterogeneity in the affected group, extracting and interpreting information about affected regions is difficult. In this paper, we present a method that explicitly models and captures heterogeneous patterns of change in the affected group relative to a reference group of controls. For this purpose, we use the Mixture-of-Experts (MOE) framework, which combines unsupervised modeling of mixtures of distributions with supervised learning of classifiers. MOE approximates the non-linear boundary between the two groups with a piece-wise linear boundary, thus allowing discovery of multiple patterns of group differences. In the case of patient/control comparisons, each such pattern aims to capture a different dimension of a disease, and hence to identify patient subgroups. We validated our model using multiple simulation scenarios and performance measures. We applied this method to resting state functional MRI data from the Baltimore Longitudinal Study of Aging, to investigate heterogeneous effects of aging on brain function in cognitively normal older adults (>85years) relative to a reference group of normal young to middle-aged adults (<60years). We found strong evidence for the presence of two subgroups of older adults, with similar age distributions in each subgroup, but different connectivity patterns associated with aging. While both older subgroups showed reduced functional connectivity in the Default Mode Network (DMN), increases in functional connectivity within the pre-frontal cortex as well as the bilateral insula were observed only for one of the two subgroups. Interestingly, the subgroup showing this increased connectivity (unlike the other subgroup) was, cognitively similar at baseline to the young and middle-aged subjects in two of seven cognitive domains, and had a faster rate of cognitive decline in one of seven domains. These results suggest that older individuals whose baseline cognitive performance is comparable to that of younger individuals recruit their "cognitive reserve" later in life, to compensate for reduced connectivity in other brain regions.

Geodesic Information Flows: Spatially-Variant Graphs and Their Application to Segmentation and Fusion

Clinical annotations, such as voxel-wise binary or probabilistic tissue segmentations, structural parcellations, pathological regions-of-interest and anatomical landmarks are key to many clinical studies. However, due to the time consuming nature of manually generating these annotations, they tend to be scarce and limited to small subsets of data. This work explores a novel framework to propagate voxel-wise annotations between morphologically dissimilar images by diffusing and mapping the available examples through intermediate steps. A spatially-variant graph structure connecting morphologically similar subjects is introduced over a database of images, enabling the gradual diffusion of information to all the subjects, even in the presence of large-scale morphological variability. We illustrate the utility of the proposed framework on two example applications: brain parcellation using categorical labels and tissue segmentation using probabilistic features. The application of the proposed method to categorical label fusion showed highly statistically significant improvements when compared to state-of-the-art methodologies. Significant improvements were also observed when applying the proposed framework to probabilistic tissue segmentation of both synthetic and real data, mainly in the presence of large morphological variability.

A Kalman Filtering Perspective for Multiatlas Segmentation

In multiatlas segmentation, one typically registers several atlases to the novel image, and their respective segmented label images are transformed and fused to form the final segmentation. In this work, we provide a new dynamical system perspective for multiatlas segmentation, inspired by the following fact: The transformation that aligns the current atlas to the novel image can be not only computed by direct registration but also inferred from the transformation that aligns the previous atlas to the image together with the transformation between the two atlases. This process is similar to the global positioning system on a vehicle, which gets position by inquiring from the satellite and by employing the previous location and velocity-neither answer in isolation being perfect. To solve this problem, a dynamical system scheme is crucial to combine the two pieces of information; for example, a Kalman filtering scheme is used. Accordingly, in this work, a Kalman multiatlas segmentation is proposed to stabilize the global/affine registration step. The contributions of this work are twofold. First, it provides a new dynamical systematic perspective for standard independent multiatlas registrations, and it is solved by Kalman filtering. Second, with very little extra computation, it can be combined with most existing multiatlas segmentation schemes for better registration/segmentation accuracy.

Maximum-margin based representation learning from multiple atlases for Alzheimer's disease classification

In order to establish the correspondences between different brains for comparison, spatial normalization based morphometric measurements have been widely used in the analysis of Alzheimer's disease (AD). In the literature, different subjects are often compared in one atlas space, which may be insufficient in revealing complex brain changes. In this paper, instead of deploying one atlas for feature extraction and classification, we propose a maximum-margin based representation learning (MMRL) method to learn the optimal representation from multiple atlases. Unlike traditional methods that perform the representation learning separately from the classification, we propose to learn the new representation jointly with the classification model, which is more powerful in discriminating AD patients from normal controls (NC). We evaluated the proposed method on the ADNI database, and achieved 90.69% for AD/NC classification and 73.69% for p-MCI/s-MCI classification.

Multiatlas segmentation as nonparametric regression

This paper proposes a novel theoretical framework to model and analyze the statistical characteristics of a wide range of segmentation methods that incorporate a database of label maps or atlases; such methods are termed as label fusion or multiatlas segmentation. We model these multiatlas segmentation problems as nonparametric regression problems in the high-dimensional space of image patches. We analyze the nonparametric estimator's convergence behavior that characterizes expected segmentation error as a function of the size of the multiatlas database. We show that this error has an analytic form involving several parameters that are fundamental to the specific segmentation problem (determined by the chosen anatomical structure, imaging modality, registration algorithm, and label-fusion algorithm). We describe how to estimate these parameters and show that several human anatomical structures exhibit the trends modeled analytically. We use these parameter estimates to optimize the regression estimator. We show that the expected error for large database sizes is well predicted by models learned on small databases. Thus, a few expert segmentations can help predict the database sizes required to keep the expected error below a specified tolerance level. Such cost-benefit analysis is crucial for deploying clinical multiatlas segmentation systems.

Metric optimization for surface analysis in the Laplace-Beltrami embedding space

In this paper, we present a novel approach for the intrinsic mapping of anatomical surfaces and its application in brain mapping research. Using the Laplace-Beltrami eigen-system, we represent each surface with an isometry invariant embedding in a high dimensional space. The key idea in our system is that we realize surface deformation in the embedding space via the iterative optimization of a conformal metric without explicitly perturbing the surface or its embedding. By minimizing a distance measure in the embedding space with metric optimization, our method generates a conformal map directly between surfaces with highly uniform metric distortion and the ability of aligning salient geometric features. Besides pairwise surface maps, we also extend the metric optimization approach for group-wise atlas construction and multi-atlas cortical label fusion. In experimental results, we demonstrate the robustness and generality of our method by applying it to map both cortical and hippocampal surfaces in population studies. For cortical labeling, our method achieves excellent performance in a cross-validation experiment with 40 manually labeled surfaces, and successfully models localized brain development in a pediatric study of 80 subjects. For hippocampal mapping, our method produces much more significant results than two popular tools on a multiple sclerosis study of 109 subjects.

Multiatlas-based segmentation with preregistration atlas selection

PURPOSE

Automatic, atlas-based segmentation of medical images benefits from using multiple atlases, mainly in terms of robustness. However, a large disadvantage of using multiple atlases is the large computation time that is involved in registering atlas images to the target image. This paper aims to reduce the computation load of multiatlas-based segmentation by heuristically selecting atlases before registration.

METHODS

To be able to select atlases, pairwise registrations are performed for all atlas combinations. Based on the results of these registrations, atlases are clustered, such that each cluster contains atlas that registers well to each other. This can all be done in a preprocessing step. Then, the representatives of each cluster are registered to the target image. The quality of the result of this registration is estimated for each of the representatives and used to decide which clusters to fully register to the target image. Finally, the segmentations of the registered images are combined into a single segmentation in a label fusion procedure.

RESULTS

The authors perform multiatlas segmentation once with postregistration atlas selection and once with the proposed preregistration method, using a set of 182 segmented atlases of prostate cancer patients. The authors performed the full set of 182 leave-one-out experiments and in each experiment compared the result of the atlas-based segmentation procedure to the known segmentation of the atlas that was chosen as a target image. The results show that preregistration atlas selection is slightly less accurate than postregistration atlas selection, but this is not statistically significant.

CONCLUSIONS

Based on the results the authors conclude that the proposed method is able to reduce the number of atlases that have to be registered to the target image with 80% on average, without compromising segmentation accuracy.

Neonatal atlas construction using sparse representation

Atlas construction generally includes first an image registration step to normalize all images into a common space and then an atlas building step to fuse the information from all the aligned images. Although numerous atlas construction studies have been performed to improve the accuracy of the image registration step, unweighted or simply weighted average is often used in the atlas building step. In this article, we propose a novel patch-based sparse representation method for atlas construction after all images have been registered into the common space. By taking advantage of local sparse representation, more anatomical details can be recovered in the built atlas. To make the anatomical structures spatially smooth in the atlas, the anatomical feature constraints on group structure of representations and also the overlapping of neighboring patches are imposed to ensure the anatomical consistency between neighboring patches. The proposed method has been applied to 73 neonatal MR images with poor spatial resolution and low tissue contrast, for constructing a neonatal brain atlas with sharp anatomical details. Experimental results demonstrate that the proposed method can significantly enhance the quality of the constructed atlas by discovering more anatomical details especially in the highly convoluted cortical regions. The resulting atlas demonstrates superior performance of our atlas when applied to spatially normalizing three different neonatal datasets, compared with other start-of-the-art neonatal brain atlases.

Unsupervised segmentation, clustering, and groupwise registration of heterogeneous populations of brain MR images

Population analysis of brain morphology from magnetic resonance images contributes to the study and understanding of neurological diseases. Such analysis typically involves segmentation of a large set of images and comparisons of these segmentations between relevant subgroups of images (e.g., "normal" versus "diseased"). The images of each subgroup are usually selected in advance in a supervised way based on clinical knowledge. Their segmentations are typically guided by one or more available atlases, assumed to be suitable for the images at hand. We present a data-driven probabilistic framework that simultaneously performs atlas-guided segmentation of a heterogeneous set of brain MR images and clusters the images in homogeneous subgroups, while constructing separate probabilistic atlases for each cluster to guide the segmentation. The main benefits of integrating segmentation, clustering and atlas construction in a single framework are that: 1) our method can handle images of a heterogeneous group of subjects and automatically identifies homogeneous subgroups in an unsupervised way with minimal prior knowledge, 2) the subgroups are formed by automatical detection of the relevant morphological features based on the segmentation, 3) the atlases used by our method are constructed from the images themselves and optimally adapted for guiding the segmentation of each subgroup, and 4) the probabilistic atlases represent the morphological pattern that is specific for each subgroup and expose the groupwise differences between different subgroups. We demonstrate the feasibility of the proposed framework and evaluate its performance with respect to image segmentation, clustering and atlas construction on simulated and real data sets including the publicly available BrainWeb and ADNI data. It is shown that combined segmentation and atlas construction leads to improved segmentation accuracy. Furthermore, it is demonstrated that the clusters generated by our unsupervised framework largely coincide with the clinically determined subgroups in case of disease-specific differences in brain morphology and that the differences between the cluster-specific atlases are in agreement with the expected disease-specific patterns, indicating that our method is capable of detecting the different modes in a population. Our method can thus be seen as a comprehensive image-driven population analysis framework that can contribute to the detection of novel subgroups and distinctive image features, potentially leading to new insights in the brain development and disease.

Fully automatic segmentation of the mitral leaflets in 3D transesophageal echocardiographic images using multi-atlas joint label fusion and deformable medial modeling

Comprehensive visual and quantitative analysis of in vivo human mitral valve morphology is central to the diagnosis and surgical treatment of mitral valve disease. Real-time 3D transesophageal echocardiography (3D TEE) is a practical, highly informative imaging modality for examining the mitral valve in a clinical setting. To facilitate visual and quantitative 3D TEE image analysis, we describe a fully automated method for segmenting the mitral leaflets in 3D TEE image data. The algorithm integrates complementary probabilistic segmentation and shape modeling techniques (multi-atlas joint label fusion and deformable modeling with continuous medial representation) to automatically generate 3D geometric models of the mitral leaflets from 3D TEE image data. These models are unique in that they establish a shape-based coordinate system on the valves of different subjects and represent the leaflets volumetrically, as structures with locally varying thickness. In this work, expert image analysis is the gold standard for evaluating automatic segmentation. Without any user interaction, we demonstrate that the automatic segmentation method accurately captures patient-specific leaflet geometry at both systole and diastole in 3D TEE data acquired from a mixed population of subjects with normal valve morphology and mitral valve disease.

INTER-GROUP IMAGE REGISTRATION BY HIERARCHICAL GRAPH SHRINKAGE

In this paper, we propose a novel inter-group image registration method to register different groups of images (e.g., young and elderly brains) simultaneously. Specifically, we use a hierarchical two-level graph to model the distribution of entire images on the manifold, with intra-graph representing the image distribution in each group and the inter-graph describing the relationship between two groups. Then the procedure of inter-group registration is formulated as a dynamic evolution of graph shrinkage. The advantage of our method is that the topology of entire image distribution is explored to guide the image registration. In this way, each image coordinates with its neighboring images on the manifold to deform towards the population center, by following the deformation pathway simultaneously optimized within the graph. Our proposed method has been also compared with other state-of-the-art inter-group registration methods, where our method achieves better registration results in terms of registration accuracy and robustness.

Atlas learning in fetal brain development

Magnetic resonance imaging has become an important noninvasive technique to gain insight into fetal brain development. Its capabilities go beyond ultrasound when diagnosing high-risk pregnancies. To summarize observations across a population in magnetic resonance imaging studies, reference systems such as atlases that establish correspondences across a cohort are key. In this article, we review the evolution of atlas-building methods in light of their relevance, limitations, and benefits for the modeling of human brain development. Starting with single anatomical templates to which brain scans where mapped to such as Talairach and Montreal Neurological Institute space, we explore the uses of atlases as a means to establish correspondences across a cohort and as a model that captures the population characteristics of the cases the atlas is built from. We discuss methods that capture features of increasingly heterogeneous populations and approaches that are able to generalize with only minimal annotation. The main focus of this review are methods that explicitly model the variability in the population with regard to time, such as in the modeling of disease progression and brain development. We highlight the applicability and limitations of state-of-the art approaches, how insights from the study of disease progression are helpful in developmental studies, and point to the directions of future research that is still necessary.

Hierarchical unbiased graph shrinkage (HUGS): a novel groupwise registration for large data set

Normalizing all images in a large data set into a common space is a key step in many clinical and research studies, e.g., for brain development, maturation, and aging. Recently, groupwise registration has been developed for simultaneous alignment of all images without selecting a particular image as template, thus potentially avoiding bias in the registration. However, most conventional groupwise registration methods do not explore the data distribution during the image registration. Thus, their performance could be affected by large inter-subject variations in the data set under registration. To solve this potential issue, we propose to use a graph to model the distribution of all image data sitting on the image manifold, with each node representing an image and each edge representing the geodesic pathway between two nodes (or images). Then, the procedure of warping all images to their population center turns to the dynamic shrinking of the graph nodes along their graph edges until all graph nodes become close to each other. Thus, the topology of image distribution on the image manifold is always preserved during the groupwise registration. More importantly, by modeling the distribution of all images via a graph, we can potentially reduce registration error since every time each image is warped only according to its nearby images with similar structures in the graph. We have evaluated our proposed groupwise registration method on both infant and adult data sets, by also comparing with the conventional group-mean based registration and the ABSORB methods. All experimental results show that our proposed method can achieve better performance in terms of registration accuracy and robustness.

Quantitative imaging biomarkers: the application of advanced image processing and analysis to clinical and preclinical decision making

The importance of medical imaging for clinical decision making has been steadily increasing over the last four decades. Recently, there has also been an emphasis on medical imaging for preclinical decision making, i.e., for use in pharamaceutical and medical device development. There is also a drive towards quantification of imaging findings by using quantitative imaging biomarkers, which can improve sensitivity, specificity, accuracy and reproducibility of imaged characteristics used for diagnostic and therapeutic decisions. An important component of the discovery, characterization, validation and application of quantitative imaging biomarkers is the extraction of information and meaning from images through image processing and subsequent analysis. However, many advanced image processing and analysis methods are not applied directly to questions of clinical interest, i.e., for diagnostic and therapeutic decision making, which is a consideration that should be closely linked to the development of such algorithms. This article is meant to address these concerns. First, quantitative imaging biomarkers are introduced by providing definitions and concepts. Then, potential applications of advanced image processing and analysis to areas of quantitative imaging biomarker research are described; specifically, research into osteoarthritis (OA), Alzheimer's disease (AD) and cancer is presented. Then, challenges in quantitative imaging biomarker research are discussed. Finally, a conceptual framework for integrating clinical and preclinical considerations into the development of quantitative imaging biomarkers and their computer-assisted methods of extraction is presented.

Groupwise spatial normalization of fMRI data based on multi-range functional connectivity patterns

Spatial alignment of functional magnetic resonance images (fMRI) of different subjects is a necessary precursor to improve functional consistency across subjects for group analysis in fMRI studies. Traditional structural MRI (sMRI) based registration methods cannot achieve accurate inter-subject functional consistency in that functional units are not necessarily located relative to anatomical structures consistently due to functional variability across subjects. Although spatial smoothing commonly used in fMRI data preprocessing can reduce the inter-subject functional variability, it may blur the functional signals and thus lose the fine-grained information. To overcome the limitations of exiting techniques, in this paper, we propose a novel method for spatial normalization of fMRI data by matching their multi-range functional connectivity patterns progressively. In particular, the image registration of different subjects is achieved by maximizing inter-subject similarity of their functional images' local functional connectivity patterns that characterize functional connectivity information for each voxel of the images to its spatial neighbors. The neighborhood size for computing the local functional connectivity patterns is gradually increased with the progression of image registration to capture the functional connectivity information in larger ranges. We also adopt the congealing groupwise image registration strategy to simultaneously warp a group of subjects to an unbiased template. Experimental comparisons between the proposed method and other fMRI image registration methods have demonstrated that the proposed method could achieve superior registration performance for resting state fMRI data. Experiment results based on real resting-state fMRI data have further demonstrated that the proposed fMRI registration method can achieve a statistically significant improvement in functional consistency across subjects.

A statistical framework for inter-group image registration

Groupwise image registration plays an important role in medical image analysis. The principle of groupwise image registration is to align a given set of images to a hidden template space in an iteratively manner without explicitly selecting any individual image as the template. Although many approaches have been proposed to address the groupwise image registration problem for registering a single group of images, few attentions and efforts have been paid to the registration problem between two or more different groups of images. In this paper, we propose a statistical framework to address the registration problems between two different image groups. The main contributions of this paper lie in the following aspects: (1) In this paper, we demonstrate that directly registering the group mean images estimated from two different image groups is not sufficient to establish the reliable transformation from one image group to the other image group. (2) A novel statistical framework is proposed to extract anatomical features from the white matter, gray matter and cerebrospinal fluid tissue maps of all aligned images as morphological signatures for each voxel. The extracted features provide much richer anatomical information than the voxel intensity of the group mean image, and can be integrated with the multi-channel Demons registration algorithm to perform the registration process. (3) The proposed method has been extensively evaluated on two publicly available brain MRI databases: the LONI LPBA40 and the IXI databases, and it is also compared with a conventional inter-group image registration approach which directly performs deformable registration between the group mean images of two image groups. Experimental results show that the proposed method consistently achieves higher registration accuracy than the method under comparison.

Multi-Atlas Segmentation with Joint Label Fusion

Multi-atlas segmentation is an effective approach for automatically labeling objects of interest in biomedical images. In this approach, multiple expert-segmented example images, called atlases, are registered to a target image, and deformed atlas segmentations are combined using label fusion. Among the proposed label fusion strategies, weighted voting with spatially varying weight distributions derived from atlas-target intensity similarity have been particularly successful. However, one limitation of these strategies is that the weights are computed independently for each atlas, without taking into account the fact that different atlases may produce similar label errors. To address this limitation, we propose a new solution for the label fusion problem in which weighted voting is formulated in terms of minimizing the total expectation of labeling error and in which pairwise dependency between atlases is explicitly modeled as the joint probability of two atlases making a segmentation error at a voxel. This probability is approximated using intensity similarity between a pair of atlases and the target image in the neighborhood of each voxel. We validate our method in two medical image segmentation problems: hippocampus segmentation and hippocampus subfield segmentation in magnetic resonance (MR) images. For both problems, we show consistent and significant improvement over label fusion strategies that assign atlas weights independently.

Multiple Atlas construction from a heterogeneous brain MR image collection

In this paper, we propose a novel framework for computing single or multiple atlases (templates) from a large population of images. Unlike many existing methods, our proposed approach is distinguished by its emphasis on the sharpness of the computed atlases and the requirement of rotational invariance. In particular, we argue that sharp atlas images that retain crucial and important anatomical features with high fidelity are more useful for many medical imaging applications when compared with the blurry and fuzzy atlas images computed by most existing methods. The geometric notion that underlies our approach is the idea of manifold learning in a quotient space, the quotient space of the image space by the rotations. We present an extension of the existing manifold learning approach to quotient spaces by using invariant metrics, and utilizing the manifold structure for partitioning the images into more homogeneous sub-collections, each of which can be represented by a single atlas image. Specifically, we propose a three-step algorithm. First, we partition the input images into subgroups using unsupervised or semi-supervised learning methods on manifolds. Then we formulate a convex optimization problem in each subgroup to locate the atlases and determine the crucial neighbors that are used in the realization step to form the template images. We have evaluated our algorithm using whole brain MR volumes from OASIS database. Experimental results demonstrate that the atlases computed using the proposed algorithm not only discover the brain structural changes in different age groups but also preserve important structural details and generally enjoy better image quality.

Locally Weighted Multi-atlas Construction

In image-based medical research, atlases are widely used in many tasks, for example, spatial normalization and segmentation. If atlases are regarded as representative patterns for a population of images, then multiple atlases are required for a heterogeneous population. In conventional atlas construction methods, the "unit" of representative patterns is images. Every input image is associated with its most similar atlas. As the number of subjects increases, the heterogeneity increases accordingly, and a big number of atlases may be needed. In this paper, we explore using region-wise, instead of image-wise, patterns to represent a population. Different parts of an input image is fuzzily associated with different atlases according to voxel-level association weights. In this way, regional structure patterns from different atlases can be combined together. Based on this model, we design a variational framework for multi-atlas construction. In the application to two T1-weighted MRI data sets, the method shows promising performance, in comparison with a conventional unbiased atlas construction method.

Quantification and Analysis of Large Multimodal Clinical Image Studies: Application to Stroke

We present an analysis framework for large studies of multimodal clinical quality brain image collections. Processing and analysis of such datasets is challenging due to low resolution, poor contrast, mis-aligned images, and restricted field of view. We adapt existing registration and segmentation methods and build a computational pipeline for spatial normalization and feature extraction. The resulting aligned dataset enables clinically meaningful analysis of spatial distributions of relevant anatomical features and of their evolution with age and disease progression. We demonstrate the approach on a neuroimaging study of stroke with more than 800 patients. We show that by combining data from several modalities, we can automatically segment important biomarkers such as white matter hyperintensity and characterize pathology evolution in this heterogeneous cohort. Specifically, we examine two sub-populations with different dynamics of white matter hyperintensity changes as a function of patients' age. Pipeline and analysis code is available at http://groups.csail.mit.edu/vision/medical-vision/stroke/.

Neighbourhood approximation forests

Methods that leverage neighbourhood structures in high-dimensional image spaces have recently attracted attention. These approaches extract information from a new image using its "neighbours" in the image space equipped with an application-specific distance. Finding the neighbourhood of a given image is challenging due to large dataset sizes and costly distance evaluations. Furthermore, automatic neighbourhood search for a new image is currently not possible when the distance is based on ground truth annotations. In this article we present a general and efficient solution to these problems. "neighbourhood approximation forests" (NAF) is a supervised learning algorithm that approximates the neighbourhood structure resulting from an arbitrary distance. As NAF uses only image intensities to infer neighbours it can also be applied to distances based on ground truth annotations. We demonstrate NAF in two scenarios: (i) choosing neighbours with respect to a deformation-based distance, and (ii) age prediction from brain MRI. The experiments show NAF's approximation quality, computational advantages and use in different contexts.

Generative-discriminative basis learning for medical imaging

This paper presents a novel dimensionality reduction method for classification in medical imaging. The goal is to transform very high-dimensional input (typically, millions of voxels) to a low-dimensional representation (small number of constructed features) that preserves discriminative signal and is clinically interpretable. We formulate the task as a constrained optimization problem that combines generative and discriminative objectives and show how to extend it to the semi-supervised learning (SSL) setting. We propose a novel large-scale algorithm to solve the resulting optimization problem. In the fully supervised case, we demonstrate accuracy rates that are better than or comparable to state-of-the-art algorithms on several datasets while producing a representation of the group difference that is consistent with prior clinical reports. Effectiveness of the proposed algorithm for SSL is evaluated with both benchmark and medical imaging datasets. In the benchmark datasets, the results are better than or comparable to the state-of-the-art methods for SSL. For evaluation of the SSL setting in medical datasets, we use images of subjects with mild cognitive impairment (MCI), which is believed to be a precursor to Alzheimer's disease (AD), as unlabeled data. AD subjects and normal control (NC) subjects are used as labeled data, and we try to predict conversion from MCI to AD on follow-up. The semi-supervised extension of this method not only improves the generalization accuracy for the labeled data (AD/NC) slightly but is also able to predict subjects which are likely to converge to AD.

Directed graph based image registration

In this paper, a novel image registration method is proposed to achieve accurate registration between images having large shape differences with the help of a set of appropriate intermediate templates. We first demonstrate that directionality is a key factor in both pairwise image registration and groupwise registration, which is defined in this paper to describe the influence of the registration direction and paths on the registration performance. In our solution, the intermediate template selection and intermediate template guided registration are two coherent steps with directionality being considered. To take advantage of the directionality, a directed graph is built based on the asymmetric distance defined on all ordered image pairs in the image population, which is fundamentally different from the undirected graph with symmetric distance metrics in all previous methods, and the shortest distance between template and subject on the directed graph is calculated. The allocated directed path can be thus utilized to better guide the registration by successively registering the subject through the intermediate templates one by one on the path towards the template. The proposed directed graph based solution can also be used in groupwise registration. Specifically, by building a minimum spanning arborescence (MSA) on the directed graph, the population center, i.e., a selected template, as well as the directed registration paths from all the rest of images to the population center, is determined simultaneously. The performance of directed graph based registration algorithm is demonstrated by the spatial normalization on both synthetic dataset and real brain MR images. It is shown that our method can achieve more accurate registration results than both the undirected graph based solution and the direct pairwise registration.

A novel framework for longitudinal atlas construction with groupwise registration of subject image sequences

Longitudinal atlas construction plays an important role in medical image analysis. Given a set of longitudinal images from different subjects, the task of longitudinal atlas construction is to build an atlas sequence which can represent the trend of anatomical changes of the population. The major challenge for longitudinal atlas construction is how to effectively incorporate both the subject-specific information and population information to build the unbiased atlases. In this paper, a novel groupwise longitudinal atlas construction framework is proposed to address this challenge, and the main contributions of the proposed framework lie in the following aspects: (1) The subject-specific longitudinal information is captured by building the growth model for each subject. (2) The longitudinal atlas sequence is constructed by performing groupwise registration among all the subject image sequences, and only one transformation is needed to transform each subject's image sequence to the atlas space. The constructed longitudinal atlases are unbiased and no explicit template is assumed. (3) The proposed method is general, where the number of longitudinal images of each subject and the time points at which they are taken can be different. The proposed method is extensively evaluated on two longitudinal databases, namely the BLSA and ADNI databases, to construct the longitudinal atlas sequence. It is also compared with a state-of-the-art longitudinal atlas construction algorithm based on kernel regression on the temporal domain. Experimental results demonstrate that the proposed method consistently achieves higher registration accuracies and more consistent spatial-temporal correspondences than the compared method on both databases.

SharpMean: groupwise registration guided by sharp mean image and tree-based registration

Groupwise registration has become more and more popular due to its attractiveness for unbiased analysis of population data. One of the most popular approaches for groupwise registration is to iteratively calculate the group mean image and then register all subject images towards the latest estimated group mean image. However, its performance might be undermined by the fuzzy mean image estimated in the very beginning of groupwise registration procedure, because all subject images are far from being well-aligned at that moment. In this paper, we first point out the significance of always keeping the group mean image sharp and clear throughout the entire groupwise registration procedure, which is intuitively important but has not been explored in the literature yet. To achieve this, we resort to developing the robust mean-image estimator by the adaptive weighting strategy, where the weights are adaptive across not only the individual subject images but also all spatial locations in the image domain. On the other hand, we notice that some subjects might have large anatomical variations from the group mean image, which challenges most of the state-of-the-art registration algorithms. To ensure good registration results in each iteration, we explore the manifold of subject images and build a minimal spanning tree (MST) with the group mean image as the root of the MST. Therefore, each subject image is only registered to its parent node often with similar shapes, and its overall transformation to the group mean image space is obtained by concatenating all deformations along the paths connecting itself to the root of the MST (the group mean image). As a result, all the subjects will be well aligned to the group mean image adaptively. Our method has been evaluated in both real and simulated datasets. In all experiments, our method outperforms the conventional algorithm which generally produces a fuzzy group mean image throughout the entire groupwise registration.

Feature-based groupwise registration by hierarchical anatomical correspondence detection

Groupwise registration has been widely investigated in recent years due to its importance in analyzing population data in many clinical applications. To our best knowledge, most of the groupwise registration algorithms only utilize the intensity information. However, it is well known that using intensity only is not sufficient to achieve the anatomically sound correspondences in medical image registration. In this article, we propose a novel feature-based groupwise registration algorithm to establish the anatomical correspondence across subjects by using the attribute vector that is defined as the morphological signature for each voxel. Similar to most of the state-of-the-art groupwise registration algorithms, which simultaneously estimate the transformation fields for all subjects, we develop an energy function to minimize the intersubject discrepancies on anatomical structures and drive all subjects toward the hidden common space. To make the algorithm efficient and robust, we decouple the complex groupwise registration problem into two easy-to-solve subproblems, namely (1) robust correspondence detection and (2) dense transformation field estimation, which are systematically integrated into a unified framework. To achieve the robust correspondences in the step (1), several strategies are adopted. First, the procedure of feature matching is evaluated within a neighborhood, rather than only on a single voxel. Second, the driving voxels with distinctive image features are designed to drive the transformations of other nondriving voxels. Third, we take advantage of soft correspondence assignment not only in the spatial domain but also across the population of subjects. Specifically, multiple correspondences are allowed to alleviate the ambiguity in establishing correspondences w.r.t. a particular subject and also the contributions from different subjects are dynamically controlled throughout the registration. Eventually in the step (2), based on the correspondences established for the driving voxels, thin-plate spline is used to propagate correspondences on the driving voxels to other locations in the image. By iteratively repeating correspondence detection and dense deformation estimation, all the subjects will be aligned onto the common space. Our feature-based groupwise registration algorithm has been extensively evaluated over 18 elderly brains, 16 brains from NIREP (with 32 manually delineated labels), 40 brains from LONI LPBA40 (with 54 manually delineated labels), and 12 pairs of normal controls and simulated atrophic brain images. In all experiments, our algorithm achieves more robust and accurate registration results, compared with another groupwise algorithm and a pairwise registration method.

Towards Effcient Label Fusion by Pre-Alignment of Training Data

Label fusion is a multi-atlas segmentation approach that explicitly maintains and exploits the entire training dataset, rather than a parametric summary of it. Recent empirical evidence suggests that label fusion can achieve significantly better segmentation accuracy over classical parametric atlas methods that utilize a single coordinate frame. However, this performance gain typically comes at an increased computational cost due to the many pairwise registrations between the novel image and training images. In this work, we present a modified label fusion method that approximates these pairwise warps by first pre-registering the training images via a diffeomorphic groupwise registration algorithm. The novel image is then only registered once, to the template image that represents the average training subject. The pairwise spatial correspondences between the novel image and training images are then computed via concatenation of appropriate transformations. Our experiments on cardiac MR data suggest that this strategy for nonparametric segmentation dramatically improves computational efficiency, while producing segmentation results that are statistically indistinguishable from those obtained with regular label fusion. These results suggest that the key benefit of label fusion approaches is the underlying nonparametric inference algorithm, and not the multiple pairwise registrations.

A generative model for image segmentation based on label fusion

We propose a nonparametric, probabilistic model for the automatic segmentation of medical images, given a training set of images and corresponding label maps. The resulting inference algorithms rely on pairwise registrations between the test image and individual training images. The training labels are then transferred to the test image and fused to compute the final segmentation of the test subject. Such label fusion methods have been shown to yield accurate segmentation, since the use of multiple registrations captures greater inter-subject anatomical variability and improves robustness against occasional registration failures. To the best of our knowledge, this manuscript presents the first comprehensive probabilistic framework that rigorously motivates label fusion as a segmentation approach. The proposed framework allows us to compare different label fusion algorithms theoretically and practically. In particular, recent label fusion or multiatlas segmentation algorithms are interpreted as special cases of our framework. We conduct two sets of experiments to validate the proposed methods. In the first set of experiments, we use 39 brain MRI scans-with manually segmented white matter, cerebral cortex, ventricles and subcortical structures-to compare different label fusion algorithms and the widely-used FreeSurfer whole-brain segmentation tool. Our results indicate that the proposed framework yields more accurate segmentation than FreeSurfer and previous label fusion algorithms. In a second experiment, we use brain MRI scans of 282 subjects to demonstrate that the proposed segmentation tool is sufficiently sensitive to robustly detect hippocampal volume changes in a study of aging and Alzheimer's Disease.

ABSORB: Atlas Building by Self-organized Registration and Bundling

To achieve more accurate and consistent registration in an image population, a novel hierarchical groupwise registration framework, called Atlas Building by Self-Organized Registration and Bundling (ABSORB), is proposed in this paper. In this new framework, the global structure, i.e., the relative distribution of subject images is always preserved during the registration process by constraining each subject image to deform only locally with respect to its neighbors within the learned image manifold. To achieve this goal, two novel strategies, i.e., the self-organized registration by warping one image towards a set of its eligible neighbors and image bundling to cluster similar images, are specially proposed. By using these two strategies, this new framework can perform groupwise registration in a hierarchical way. Specifically, in the high level, it will perform on a much smaller dataset formed by the representative subject images of all subgroups that are generated in the previous levels of registration. Compared to the other groupwise registration methods, our proposed framework has several advantages: (1) it explores the local data distribution and uses the obtained distribution information to guide the registration; (2) the possible registration error can be greatly reduced by requiring each individual subject to move only towards its nearby subjects with similar structures; (3) it can produce a smoother registration path, in general, from each subject image to the final built atlas than other groupwise registration methods. Experimental results on both synthetic and real datasets show that the proposed framework can achieve substantial improvements, compared to the other two widely used groupwise registration methods, in terms of both registration accuracy and robustness.

Learning task-optimal registration cost functions for localizing cytoarchitecture and function in the cerebral cortex

Image registration is typically formulated as an optimization problem with multiple tunable, manually set parameters. We present a principled framework for learning thousands of parameters of registration cost functions, such as a spatially-varying tradeoff between the image dissimilarity and regularization terms. Our approach belongs to the classic machine learning framework of model selection by optimization of cross-validation error. This second layer of optimization of cross-validation error over and above registration selects parameters in the registration cost function that result in good registration as measured by the performance of the specific application in a training data set. Much research effort has been devoted to developing generic registration algorithms, which are then specialized to particular imaging modalities, particular imaging targets and particular postregistration analyses. Our framework allows for a systematic adaptation of generic registration cost functions to specific applications by learning the "free" parameters in the cost functions. Here, we consider the application of localizing underlying cytoarchitecture and functional regions in the cerebral cortex by alignment of cortical folding. Most previous work assumes that perfectly registering the macro-anatomy also perfectly aligns the underlying cortical function even though macro-anatomy does not completely predict brain function. In contrast, we learn 1) optimal weights on different cortical folds or 2) optimal cortical folding template in the generic weighted sum of squared differences dissimilarity measure for the localization task. We demonstrate state-of-the-art localization results in both histological and functional magnetic resonance imaging data sets.

An automated pipeline for cortical sulcal fundi extraction

In this paper, we propose a novel automated pipeline for extraction of sulcal fundi from triangulated cortical surfaces. This method consists of four consecutive steps. Firstly, we adopt a finite difference method to estimate principal curvatures, principal directions and curvature derivatives, along the principal directions, for each vertex. Then, we detect the sulcal fundi segment in each triangle of the cortical surface based on curvatures and curvature derivatives. Afterwards, we link the sulcal fundi segments into continuous curves. Finally, we connect breaking sulcal fundi and smooth bumping sulcal fundi by using the fast marching method on the cortical surface. The proposed method can find the accurate sulcal fundi using curvatures and curvature derivatives without any manual interaction. The method was applied to 10 normal brain MR images on inner cortical surfaces. We quantitatively evaluated the accuracy of the sulcal fundi extraction method using manually labeled sulcal fundi by experts. The average difference between automatically extracted major sulcal fundi and the expert labeled results is consistently around 1.0mm on 10 subject images, indicating the good performance of the proposed method.

CAVIAR: CLASSIFICATION VIA AGGREGATED REGRESSION AND ITS APPLICATION IN CLASSIFYING OASIS BRAIN DATABASE

This paper presents a novel classification via aggregated regression algorithm - dubbed CAVIAR - and its application to the OASIS MRI brain image database. The CAVIAR algorithm simultaneously combines a set of weak learners based on the assumption that the weight combination for the final strong hypothesis in CAVIAR depends on both the weak learners and the training data. A regularization scheme using the nearest neighbor method is imposed in the testing stage to avoid overfitting. A closed form solution to the cost function is derived for this algorithm. We use a novel feature - the histogram of the deformation field between the MRI brain scan and the atlas which captures the structural changes in the scan with respect to the atlas brain - and this allows us to automatically discriminate between various classes within OASIS [1] using CAVIAR. We empirically show that CAVIAR significantly increases the performance of the weak classifiers by showcasing the performance of our technique on OASIS.

Robust Atlas-Based Segmentation of Highly Variable Anatomy: Left Atrium Segmentation

Automatic segmentation of the heart's left atrium offers great benefits for planning and outcome evaluation of atrial ablation procedures. However, the high anatomical variability of the left atrium presents significant challenges for atlas-guided segmentation. In this paper, we demonstrate an automatic method for left atrium segmentation using weighted voting label fusion and a variant of the demons registration algorithm adapted to handle images with different intensity distributions. We achieve accurate automatic segmentation that is robust to the high anatomical variations in the shape of the left atrium in a clinical dataset of MRA images.

Feature-based morphometry: discovering group-related anatomical patterns

This paper presents feature-based morphometry (FBM), a new fully data-driven technique for discovering patterns of group-related anatomical structure in volumetric imagery. In contrast to most morphometry methods which assume one-to-one correspondence between subjects, FBM explicitly aims to identify distinctive anatomical patterns that may only be present in subsets of subjects, due to disease or anatomical variability. The image is modeled as a collage of generic, localized image features that need not be present in all subjects. Scale-space theory is applied to analyze image features at the characteristic scale of underlying anatomical structures, instead of at arbitrary scales such as global or voxel-level. A probabilistic model describes features in terms of their appearance, geometry, and relationship to subject groups, and is automatically learned from a set of subject images and group labels. Features resulting from learning correspond to group-related anatomical structures that can potentially be used as image biomarkers of disease or as a basis for computer-aided diagnosis. The relationship between features and groups is quantified by the likelihood of feature occurrence within a specific group vs. the rest of the population, and feature significance is quantified in terms of the false discovery rate. Experiments validate FBM clinically in the analysis of normal (NC) and Alzheimer's (AD) brain images using the freely available OASIS database. FBM automatically identifies known structural differences between NC and AD subjects in a fully data-driven fashion, and an equal error classification rate of 0.80 is achieved for subjects aged 60-80 years exhibiting mild AD (CDR=1).

Asymmetric image-template registration

A natural requirement in pairwise image registration is that the resulting deformation is independent of the order of the images. This constraint is typically achieved via a symmetric cost function and has been shown to reduce the effects of local optima. Consequently, symmetric registration has been successfully applied to pairwise image registration as well as the spatial alignment of individual images with a template. However, recent work has shown that the relationship between an image and a template is fundamentally asymmetric. In this paper, we develop a method that reconciles the practical advantages of symmetric registration with the asymmetric nature of image-template registration by adding a simple correction factor to the symmetric cost function. We instantiate our model within a log-domain diffeomorphic registration framework. Our experiments show exploiting the asymmetry in image-template registration improves alignment in the image coordinates.