In this paper, we present a fast and accurate implementation of the diffusion-based non-rigid registration algorithm. Traditionally, finite differences are used to implement registration algorithms due to their ease of implementation. However, finite differences are sensitive to noise, and they have a narrow numerical stability range. Further, finite differences employ a uniform grid. This is often not desirable in the case of registration, as finer resolution is needed to capture the displacement field in regions that have a high number of image features, as opposed to homogeneous regions with fewer features. On the other hand, the less explored Finite Element Methods are ideal for the non-rigid registration task, as they use a non-uniform discretization of the image domain, placing points based on the local image-feature information. We present such an FEM-based implementation of a popular diffusion-based registration algorithm~\cite{stefanescu04}. Originally, this algorithm was implemented using finite differences. Experimentally, we show that our implementation is much faster than the corresponding finite difference implementation, and that it achieves this In this paper, we present a fast and accurate implementation of the diffusion-based non-rigid registration algorithm. Traditionally, finite differences are used to implement registration algorithms due to their ease of implementation. However, finite differences are sensitive to noise, and they have a narrow numerical stability range. Further, finite differences employ a uniform grid. This is often not desirable in the case of registration, as finer resolution is needed to capture the displacement field in regions that have a high number of image features, as opposed to homogeneous regions with fewer features. On the other hand, the less explored Finite Element Methods are ideal for the non-rigid registration task, as they use a non-uniform discretization of the image domain, placing points based on the local image-feature information. We present such an FEM-based implementation of a popular diffusion-based registration algorithm [8]. Originally, this algorithm was implemented using finite differences. Experimentally, we show that our implementation is much faster than the corresponding finite difference implementation, and that it achieves this computational speed without compromising the accuracy of the non-rigid registration results. computational speed without compromising the accuracy of the non-rigid registration results. [8] R. Stefanescu, X. Pennec, and N. Ayache, "Grid powered nonlinear image registration with locally adaptive regularization", Medical Image Analysis, 8(3):325–342, 2004.
[1]
Max A. Viergever,et al.
Efficient and reliable schemes for nonlinear diffusion filtering
,
1998,
IEEE Trans. Image Process..
[2]
Jonathan Richard Shewchuk,et al.
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
,
1996,
WACG.
[3]
Yongyi Yang,et al.
A fast approach for accurate content-adaptive mesh generation
,
2003,
IEEE Trans. Image Process..
[4]
Michael I. Miller,et al.
Volumetric transformation of brain anatomy
,
1997,
IEEE Transactions on Medical Imaging.
[5]
Michael Ian Shamos,et al.
Computational geometry: an introduction
,
1985
.
[6]
C. Broit.
Optimal registration of deformed images
,
1981
.
[7]
David Sutton,et al.
The Whole Brain Atlas
,
1999,
BMJ.
[8]
S. Brendle,et al.
Calculus of Variations
,
1927,
Nature.
[9]
Nicholas Ayache,et al.
Grid powered nonlinear image registration with locally adaptive regularization
,
2004,
Medical Image Anal..
[10]
Paul Suetens,et al.
An Elasticity Penalty: Mixing FEM and Nonrigid Registration
,
2009
.
[11]
Joachim Weickert,et al.
Fast Parallel Algorithms for a Broad Class of Nonlinear Variational Diffusion Approaches
,
2001,
Real Time Imaging.
[12]
Ron Kikinis,et al.
Registration of 3D Intraoperative MR Images of the Brain Using a Finite Element Biomechanical Model
,
2001,
IEEE Trans. Medical Imaging.