702 research outputs found
Diffeomorphic density matching by optimal information transport
We address the following problem: given two smooth densities on a manifold,
find an optimal diffeomorphism that transforms one density into the other. Our
framework builds on connections between the Fisher-Rao information metric on
the space of probability densities and right-invariant metrics on the
infinite-dimensional manifold of diffeomorphisms. This optimal information
transport, and modifications thereof, allows us to construct numerical
algorithms for density matching. The algorithms are inherently more efficient
than those based on optimal mass transport or diffeomorphic registration. Our
methods have applications in medical image registration, texture mapping, image
morphing, non-uniform random sampling, and mesh adaptivity. Some of these
applications are illustrated in examples.Comment: 35 page
Diffeomorphic density registration
In this book chapter we study the Riemannian Geometry of the density
registration problem: Given two densities (not necessarily probability
densities) defined on a smooth finite dimensional manifold find a
diffeomorphism which transforms one to the other. This problem is motivated by
the medical imaging application of tracking organ motion due to respiration in
Thoracic CT imaging where the fundamental physical property of conservation of
mass naturally leads to modeling CT attenuation as a density. We will study the
intimate link between the Riemannian metrics on the space of diffeomorphisms
and those on the space of densities. We finally develop novel computationally
efficient algorithms and demonstrate there applicability for registering RCCT
thoracic imaging.Comment: 23 pages, 6 Figures, Chapter for a Book on Medical Image Analysi
Indirect Image Registration with Large Diffeomorphic Deformations
The paper adapts the large deformation diffeomorphic metric mapping framework
for image registration to the indirect setting where a template is registered
against a target that is given through indirect noisy observations. The
registration uses diffeomorphisms that transform the template through a (group)
action. These diffeomorphisms are generated by solving a flow equation that is
defined by a velocity field with certain regularity. The theoretical analysis
includes a proof that indirect image registration has solutions (existence)
that are stable and that converge as the data error tends so zero, so it
becomes a well-defined regularization method. The paper concludes with examples
of indirect image registration in 2D tomography with very sparse and/or highly
noisy data.Comment: 43 pages, 4 figures, 1 table; revise
Distributed-memory large deformation diffeomorphic 3D image registration
We present a parallel distributed-memory algorithm for large deformation
diffeomorphic registration of volumetric images that produces large isochoric
deformations (locally volume preserving). Image registration is a key
technology in medical image analysis. Our algorithm uses a partial differential
equation constrained optimal control formulation. Finding the optimal
deformation map requires the solution of a highly nonlinear problem that
involves pseudo-differential operators, biharmonic operators, and pure
advection operators both forward and back- ward in time. A key issue is the
time to solution, which poses the demand for efficient optimization methods as
well as an effective utilization of high performance computing resources. To
address this problem we use a preconditioned, inexact, Gauss-Newton- Krylov
solver. Our algorithm integrates several components: a spectral discretization
in space, a semi-Lagrangian formulation in time, analytic adjoints, different
regularization functionals (including volume-preserving ones), a spectral
preconditioner, a highly optimized distributed Fast Fourier Transform, and a
cubic interpolation scheme for the semi-Lagrangian time-stepping. We
demonstrate the scalability of our algorithm on images with resolution of up to
on the "Maverick" and "Stampede" systems at the Texas Advanced
Computing Center (TACC). The critical problem in the medical imaging
application domain is strong scaling, that is, solving registration problems of
a moderate size of ---a typical resolution for medical images. We are
able to solve the registration problem for images of this size in less than
five seconds on 64 x86 nodes of TACC's "Maverick" system.Comment: accepted for publication at SC16 in Salt Lake City, Utah, USA;
November 201
Multiple Shape Registration using Constrained Optimal Control
Lagrangian particle formulations of the large deformation diffeomorphic
metric mapping algorithm (LDDMM) only allow for the study of a single shape. In
this paper, we introduce and discuss both a theoretical and practical setting
for the simultaneous study of multiple shapes that are either stitched to one
another or slide along a submanifold. The method is described within the
optimal control formalism, and optimality conditions are given, together with
the equations that are needed to implement augmented Lagrangian methods.
Experimental results are provided for stitched and sliding surfaces
An inexact Newton-Krylov algorithm for constrained diffeomorphic image registration
We propose numerical algorithms for solving large deformation diffeomorphic
image registration problems. We formulate the nonrigid image registration
problem as a problem of optimal control. This leads to an infinite-dimensional
partial differential equation (PDE) constrained optimization problem.
The PDE constraint consists, in its simplest form, of a hyperbolic transport
equation for the evolution of the image intensity. The control variable is the
velocity field. Tikhonov regularization on the control ensures well-posedness.
We consider standard smoothness regularization based on - or
-seminorms. We augment this regularization scheme with a constraint on the
divergence of the velocity field rendering the deformation incompressible and
thus ensuring that the determinant of the deformation gradient is equal to one,
up to the numerical error.
We use a Fourier pseudospectral discretization in space and a Chebyshev
pseudospectral discretization in time. We use a preconditioned, globalized,
matrix-free, inexact Newton-Krylov method for numerical optimization. A
parameter continuation is designed to estimate an optimal regularization
parameter. Regularity is ensured by controlling the geometric properties of the
deformation field. Overall, we arrive at a black-box solver. We study spectral
properties of the Hessian, grid convergence, numerical accuracy, computational
efficiency, and deformation regularity of our scheme. We compare the designed
Newton-Krylov methods with a globalized preconditioned gradient descent. We
study the influence of a varying number of unknowns in time.
The reported results demonstrate excellent numerical accuracy, guaranteed
local deformation regularity, and computational efficiency with an optional
control on local mass conservation. The Newton-Krylov methods clearly
outperform the Picard method if high accuracy of the inversion is required.Comment: 32 pages; 10 figures; 9 table
- …