Abstract
Abstract
Image registration is an inherently ill-posed problem that lacks the constraints needed for a unique mapping between voxels of the two images being registered. As such, one must regularize the registration to achieve physically meaningful transforms. The regularization penalty is usually a function of derivatives of the displacement-vector field and can be calculated either analytically or numerically. The numerical approach, however, is computationally expensive depending on the image size, and therefore a computationally efficient analytical framework has been developed. Using cubic B-splines as the registration transform, we develop a generalized mathematical framework that supports five distinct regularizers: diffusion, curvature, linear elastic, third-order, and total displacement. We validate our approach by comparing each with its numerical counterpart in terms of accuracy. We also provide benchmarking results showing that the analytic solutions run significantly faster—up to two orders of magnitude—than finite differencing based numerical implementations.
Funder
National Science Foundation
National Institutes of Health
Reference27 articles.
1. A fast diffeomorphic image registration algorithm;Ashburner;Neuroimage,2007
2. Optimal registration of deformed images;Broit;Ph.D. Thesis,1981
3. A hyperelastic regularization energy for image registration;Burger;SIAM J. Sci. Comput.,2013
4. Fourier methods for nonparametric image registration;Cahill,2007
5. A demons algorithm for image registration with locally adaptive regularization;Cahill,2009