144 research outputs found
MULTISCALE KERNELS FOR DIFFEOMORPHIC BRAIN IMAGE AND SURFACE MATCHING
Ph.DDOCTOR OF PHILOSOPH
Doctor of Philosophy
dissertationStochastic methods, dense free-form mapping, atlas construction, and total variation are examples of advanced image processing techniques which are robust but computationally demanding. These algorithms often require a large amount of computational power as well as massive memory bandwidth. These requirements used to be ful lled only by supercomputers. The development of heterogeneous parallel subsystems and computation-specialized devices such as Graphic Processing Units (GPUs) has brought the requisite power to commodity hardware, opening up opportunities for scientists to experiment and evaluate the in uence of these techniques on their research and practical applications. However, harnessing the processing power from modern hardware is challenging. The di fferences between multicore parallel processing systems and conventional models are signi ficant, often requiring algorithms and data structures to be redesigned signi ficantly for efficiency. It also demands in-depth knowledge about modern hardware architectures to optimize these implementations, sometimes on a per-architecture basis. The goal of this dissertation is to introduce a solution for this problem based on a 3D image processing framework, using high performance APIs at the core level to utilize parallel processing power of the GPUs. The design of the framework facilitates an efficient application development process, which does not require scientists to have extensive knowledge about GPU systems, and encourages them to harness this power to solve their computationally challenging problems. To present the development of this framework, four main problems are described, and the solutions are discussed and evaluated: (1) essential components of a general 3D image processing library: data structures and algorithms, as well as how to implement these building blocks on the GPU architecture for optimal performance; (2) an implementation of unbiased atlas construction algorithms|an illustration of how to solve a highly complex and computationally expensive algorithm using this framework; (3) an extension of the framework to account for geometry descriptors to solve registration challenges with large scale shape changes and high intensity-contrast di fferences; and (4) an out-of-core streaming model, which enables developers to implement multi-image processing techniques on commodity hardware
Higher-Order Momentum Distributions and Locally Affine LDDMM Registration
To achieve sparse parametrizations that allows intuitive analysis, we aim to
represent deformation with a basis containing interpretable elements, and we
wish to use elements that have the description capacity to represent the
deformation compactly. To accomplish this, we introduce in this paper
higher-order momentum distributions in the LDDMM registration framework. While
the zeroth order moments previously used in LDDMM only describe local
displacement, the first-order momenta that are proposed here represent a basis
that allows local description of affine transformations and subsequent compact
description of non-translational movement in a globally non-rigid deformation.
The resulting representation contains directly interpretable information from
both mathematical and modeling perspectives. We develop the mathematical
construction of the registration framework with higher-order momenta, we show
the implications for sparse image registration and deformation description, and
we provide examples of how the parametrization enables registration with a very
low number of parameters. The capacity and interpretability of the
parametrization using higher-order momenta lead to natural modeling of
articulated movement, and the method promises to be useful for quantifying
ventricle expansion and progressing atrophy during Alzheimer's disease
Diffeomorphic Iterative Centroid Methods for Template Estimation on Large Datasets
International audienceA common approach for analysis of anatomical variability relies on the stimation of a template representative of the population. The Large Deformation Diffeomorphic Metric Mapping is an attractive framework for that purpose. However, template estimation using LDDMM is computationally expensive, which is a limitation for the study of large datasets. This paper presents an iterative method which quickly provides a centroid of the population in the shape space. This centroid can be used as a rough template estimate or as initialization of a template estimation method. The approach is evaluated on datasets of real and synthetic hippocampi segmented from brain MRI. The results show that the centroid is correctly centered within the population and is stable for different orderings of subjects. When used as an initialization, the approach allows to substantially reduce the computation time of template estimation
Variational Image Registration Using Inhomogeneous Regularization
We present a generalization of the convolution-based variational image registration approach, in which different regularizers can be implemented by conveniently exchanging the convolution kernel, even if it is nonseparable or nonstationary. Nonseparable kernels pose a challenge because they cannot be efficiently implemented by separate 1D convolutions. We propose to use a low-rank tensor decomposition to efficiently approximate nonseparable convolution. Nonstationary kernels pose an even greater challenge because the convolution kernel depends on, and needs to be evaluated for, every point in the image. We propose to pre-compute the local kernels and efficiently store them in memory using the Tucker tensor decomposition model. In our experiments we use the nonseparable exponential kernel and a nonstationary landmark kernel. The exponential kernel replicates desirable properties of elastic image registration, while the landmark kernel incorporates local prior knowledge about corresponding points in the images. We examine the trade-off between the computational resources needed and the approximation accuracy of the tensor decomposition methods. Furthermore, we obtain very smooth displacement fields even in the presence of large landmark displacements
Kernel Bundle EPDiff: Evolution Equations for Multi-Scale Diffeomorphic Image Registration
International audienceIn the LDDMM framework, optimal warps for image registration are found as end-points of critical paths for an energy functional, and the EPDiff equations describe the evolution along such paths. The Large Deformation Diffeomorphic Kernel Bundle Mapping (LDDKBM) extension of LDDMM allows scale space information to be automatically incorporated in registrations and promises to improve the standard framework in several aspects. We present the mathematical foundations of LDDKBM and derive the KB-EPDiff evolution equations, which provide optimal warps in this new framework. To illustrate the resulting diffeomorphism paths, we give examples showing the decoupled evolution across scales and how the method automatically incorporates deformation at appropriate scales
- …