1,266 research outputs found
A novel variational model for image registration using Gaussian curvature
Image registration is one important task in many image processing
applications. It aims to align two or more images so that useful information
can be extracted through comparison, combination or superposition. This is
achieved by constructing an optimal trans- formation which ensures that the
template image becomes similar to a given reference image. Although many models
exist, designing a model capable of modelling large and smooth deformation
field continues to pose a challenge. This paper proposes a novel variational
model for image registration using the Gaussian curvature as a regulariser. The
model is motivated by the surface restoration work in geometric processing
[Elsey and Esedoglu, Multiscale Model. Simul., (2009), pp. 1549-1573]. An
effective numerical solver is provided for the model using an augmented
Lagrangian method. Numerical experiments can show that the new model
outperforms three competing models based on, respectively, a linear curvature
[Fischer and Modersitzki, J. Math. Imaging Vis., (2003), pp. 81- 85], the mean
curvature [Chumchob, Chen and Brito, Multiscale Model. Simul., (2011), pp.
89-128] and the diffeomorphic demon model [Vercauteren at al., NeuroImage,
(2009), pp. 61-72] in terms of robustness and accuracy.Comment: 23 pages, 5 figures. Key words: Image registration, Non-parametric
image registration, Regularisation, Gaussian curvature, surface mappin
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
- …