Incompressible image registration using divergence-conforming B-splines
Lucas Fidon, Michael Ebner, Luis C. Garcia-Peraza-Herrera, Marc Modat,, Sebastien Ourselin, Tom Vercauteren

TL;DR
This paper introduces a novel image registration method using divergence-conforming B-splines to ensure exact volumetric preservation, improving accuracy and flexibility over previous approaches.
Contribution
The paper presents a new framework for incompressible image registration with divergence-free velocity fields using divergence-conforming B-splines, enabling exact volume preservation.
Findings
Achieves exact divergence-free velocity fields at any point in the domain.
Demonstrates improved accuracy and volume preservation compared to state-of-the-art methods.
Provides theoretical insights into numerical incompressibility error.
Abstract
Anatomically plausible image registration often requires volumetric preservation. Previous approaches to incompressible image registration have exploited relaxed constraints, ad hoc optimisation methods or practically intractable computational schemes. Divergence-free velocity fields have been used to achieve incompressibility in the continuous domain, although, after discretisation, no guarantees have been provided. In this paper, we introduce stationary velocity fields (SVFs) parameterised by divergence-conforming B-splines in the context of image registration. We demonstrate that sparse linear constraints on the parameters of such divergence-conforming B-Splines SVFs lead to being exactly divergence-free at any point of the continuous spatial domain. In contrast to previous approaches, our framework can easily take advantage of modern solvers for constrained optimisation, symmetric…
| Error measures | Affine | Cubic B-splines | Ours |
|---|---|---|---|
| RMSE (transformation) | 2,28 (0,68) | 0.96 (0.44) | 0.90 (0.45) |
| MAE() | 0.0062 (0.005) | 0.054 (0.02) | 0.00079 (0.0004) |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
11institutetext: School of Biomedical Engineering & Imaging Sciences, King’s College London, UK 22institutetext: University College London, UK
Incompressible image registration
using divergence-conforming B-splines
Lucas Fidon 11
Michael Ebner 1122
Luis C. Garcia-Peraza-Herrera 1122
Marc Modat 11
Sébastien Ourselin 11
Tom Vercauteren 11
Abstract
Anatomically plausible image registration often requires volumetric preservation. Previous approaches to incompressible image registration have exploited relaxed constraints, ad hoc optimisation methods or practically intractable computational schemes. Divergence-free velocity fields have been used to achieve incompressibility in the continuous domain, although, after discretisation, no guarantees have been provided. In this paper, we introduce stationary velocity fields (SVFs) parameterised by divergence-conforming B-splines in the context of image registration. We demonstrate that sparse linear constraints on the parameters of such divergence-conforming B-Splines SVFs lead to being exactly divergence-free at any point of the continuous spatial domain. In contrast to previous approaches, our framework can easily take advantage of modern solvers for constrained optimisation, symmetric registration approaches, arbitrary image similarity and additional regularisation terms. We study the numerical incompressibility error for the transformation in the case of an Euler integration, which gives theoretical insights on the improved accuracy error over previous methods. We evaluate the proposed framework using synthetically deformed multimodal brain images, and the STACOM’11 myocardial tracking challenge. Accuracy measurements demonstrate that our method compares favourably with state-of-the-art methods whilst achieving volume preservation.
1 Introduction
Medical image registration consists of finding a spatial transformation that aligns two or more images. The intrinsic ill-posedness of registration can lead to anatomically implausible transformations associated with unrealistic volumetric distortion of the anatomy. For certain anatomical regions, such as the myocardium, physiologically plausible image registration requires volumetric preservation which corresponds to so-called incompressible registration [2, 7, 10].
Incompressible medical image registration between a pair of images can be defined as a constrained optimisation problem:
[TABLE]
where is the image domain, is the incompressible region, an image dissimilarity measure, a regularisation term, the group of diffeomorphic transformations from onto itself, and the Jacobian matrix of the transformation .
In practice, to solve (1), the transformation must be parameterised by a finite number of parameters, and the constraint must be reduced to a finite number of equality constraints. There are two approaches to discretise the constraint:
- relaxing the constraint into an additive soft constraint [1, 3, 5, 9].
- using a specific parameterisation for the transformation [2, 6, 7]. Soft constraints introduce hyperparameters that are difficult to tune reliably and cannot guarantee an incompressible transformation. In [2], the transformation is parameterised by a divergence-free displacement. Yet, this approach only provides a first order approximation of an incompressible deformation, still requiring a soft constraint. Recently [6, 7] proposed to parameterise the transformation by a divergence-free stationary velocity field (SVF). The transformation is obtained via the Lie exponential mapping that maps any divergence-free SVF into an incompressible transformation [6, 7]. This reduces the non-convex constraint in (1) to a linear constraint in the continuous domain. However, in [6, 7] the SVF is parameterised as linear B-splines, and the linear constraint is discretised by imposing the constraint only on the points of the deformation grid. As a result, guarantees to obtain a continuous incompressible transformation do not hold anymore. To mitigate this issue, [6] proposed to work with images of higher resolution with a finer grid for the linear B-spline leading to the need for distributed super-computing. Moreover, [6, 7] methods are limited to using sum of squared differences (SSD) as image similarity metric, which limits their applicability to images with similar intensity distributions.
In this paper, we propose a constrained optimisation framework for incompressible diffeomorphic registration that allows to use any smooth image similarity and regularisation penalty. As an efficient means of discrete SVF parameterisation for this problem, we introduce multivariate divergence-conforming B-splines that have recently raised interest in computational physics [4]. We demonstrate that their properties can be exploited to impose bounds on the divergence of the SVF over the entire continuous space using sparse linear constraints on its finite parameters. Our general problem formulation allows us to solve incompressible registration using any state-of-the-art optimiser for constrained non-convex optimisation (e.g. IPOPT [11]). For evaluation, we initially apply our method for multi-modal incompressible registration of synthetically deformed brains. We then compare our approach against the state-of-the-art results published for the STACOM’11 myocardial tracking challenge dataset [10] and achieve similar results while better retaining the incompressibility.
2 Method
2.0.1 Divergence-conforming B-splines
General B-splines are very popular to parameterise deformations and velocity fields over a continuous spatial domain with a finite number of parameters :
[TABLE]
where are the knots of a regular grid of spacing and are the 1D B-spline basis functions of order in the direction (see supplemental material for more details). Popular choices of the order are (linear B-splines) [6, 7] and (cubic B-splines) [10]. A fundamental property of 1D B-spline basis functions of the variable , on a regular grid of spacing with knots is that:
[TABLE]
This implies that the derivative of a 1D B-spline on a regular grid is also a 1D B-spline on the same grid, albeit of lower order. However, this property does not extend to 3D B-splines using definition (2). Especially, the divergence of those 3D B-splines are not B-splines, because of the mixed order appearing with first partial derivatives. This limitation makes it more difficult to relate properties of the velocity field to the values of the parameters .
To overcome this limitation, we propose to use a 3D divergence-conforming B-splines [4] to parameterise . The orders of the 3D B-splines basis of each component are chosen so that the divergence of is, in a continuous sense, exactly a 1D B-spline of order . Using the same notations as in (2), and using , we have:
[TABLE]
Using (3), we obtain the continuous divergence for all :
[TABLE]
As a consequence, the following lemma states that is uniformly bounded at any point of a continuous subregion provided that a finite number of linear constraints are satisfied by the coefficients .
Lemma 1
Let , and be a non-empty subset of . Let and let . If
[TABLE]
then at any point , it holds that .
Proof
The proof follows from (5) and the fact that the value of a B-spline at any point is bounded by the values of the B-spline coefficients associated to the knots that are close to (see supplementary material for more details).
2.0.2 Optimisation formulation and implementation
In this section, we formulate the optimisation problem for diffeomorphic registration with the proposed incompressibility constraint on a subregion . Using Lemma 1 and previous notations, our (symmetric) optimisation formulation of (1) is:
[TABLE]
where is an approximation of the Lie exponential. Thus we obtain a constrained optimisation formulation that guarantees the SVF to be exactly divergence-free over the entire continuous subregion and that can be solved with efficient state-of-the-art optimisers. Using state-of-the-art solvers like IPOPT, that uses a primal-dual interior-point filter line-search method, an approximated solution of (6) that satisfies the constraints up to machine precision can be obtained.
2.0.3 Lie exponential approximation and incompressibility
As the Lie exponential has to be approximated in practice, having a divergence-free velocity field does not strictly guarantee that the resulting deformation will be incompressible. We now quantify this approximation in our framework with respect to the time step for the Euler method. Let denote a (SVF) solution of (6) that fulfills the divergence-free constraint up to machine precision . For any point , the Jacobian of the first step of the Euler method, , fulfills:
[TABLE]
Then, by composing times, if the point remains inside during the Euler integration, the Jacobian of satisfies (see supplementary material):
[TABLE]
This approximation is independent to the spatial spacing and only depends on the time integration step . This is, to the best of our knowledge, a new state-of-the-art approximation for an incompressible diffeomorphic deformation parameterised by an SVF. However, it is worth noting that (8) is only guaranteed if remains inside during the Euler integration. Thus, when is not equal to the entire spatial domain, this approximation may not hold for large deformations.
3 Evaluation on synthetic data for incompressible multi-modal registration
We start by evaluating our method on synthetic incompressible registration in the context of multi-modal MRI data.
3.0.1 Data generation method
We used T1, T2 and PD brain images from the IXI dataset111https://brain-development.org/ixi-dataset/. We generated realistic ground-truth incompressible transformations in two steps. First, we non-linearly registered a pair of T1 images coming from different patients using a classical cubic B-splines SVF . Second, we generated a quasi-divergence-free SVF by projecting on the space of quasi-divergence-free SVFs. This corresponds to solving:
[TABLE]
where and are parameterised with classical cubic B-splines as in (2). We note that any potential bias towards the space of divergence-conforming B-splines is avoided in this comparison. We used IPOPT [11] to solve (9).
3.0.2 Evaluation
We generated a ground-truth quasi-incompressible SVF for 10 patients using the previous generation procedure, taking as fixed images 10 other patients. Then for a given subject and for any pair of imaging modalities , we warped the first image using the inverse of the ground-truth transformation. The task consists in estimating by registering to . We compared the proposed method with divergence-conforming B-splines SVF under incompressibility constraint to a classic registration approach based on cubic B-splines SVF similar to the one used to generate the ground-truth. We also performed an affine registration to illustrate that the ground-truth transformation is not just affine.
3.0.3 Implementation details
We used NiftyReg [8] for the diffeomorphic registrations using cubic B-splines SVF. For both NiftyReg and our incompressible implementation we used the same hyperparameters (grid size 5mm, levels of pyramid) and objective function, consisting of Normalised Mutual Information (NMI) as a similarity measure (weight ) and a bending energy regularisation term (weight ). The optimiser differs, as we used IPOPT optimiser while a Conjugate Gradient approach is used in NiftyReg.
3.0.4 Results
NiftyReg and our approach recovered the ground-truth SVF up to a RMSE of the order of the images resolution, as shown in Table. 1. In addition, our method recovered the incompresibility with a higher accuracy.
4 Evaluation for myocardial tracking
We evaluate the proposed method on the STACOM’11 myocardial tracking challenge [10]. In particular, this allows a direct comparison of our framework with iLogDemons[7] a state-of-the-art incompressible registration method.
4.0.1 Data
The STACOM’11 dataset222http://stacom.cardiacatlas.org/motion-tracking-challenge/ contains 4D cine Steady State Free Precession (SSFP) of a full cardiac cycle with time points for patients. Those SSFP come with manually tracked landmarks. We used only 13 of the 15 patients available because we found a shift between the images and the landmarks for two of them which we reported to the organisers. The coordinates of the landmarks obtained by competitive methods of the challenge are available alongside the original data. This allows a direct comparison with our method.
4.0.2 Implementation details
We used a similar implementation to the one of iLogDemons for this challenge, where we registered the first frame to all subsequent frames for each patient and used a manually delineated mask for the first frame. Yet, we used Local Normalised Cross Correlation as a similarity measure. We used a bending energy regularisation, and a grid size of mm.
4.0.3 Results
The evaluation of the myocardial tracking is based on the manually annotated landmarks at End Diastole and End Systole. Using a Wilcoxon signed-rank test, we found that our results, shown in Fig. 2, are not statistically different from the results of iLogDemons [7] in terms of landmark tracking error. The log-Jacobian map of Fig. 1 illustrates our approximation results (8): for a small deformation, our registration framework can guarantee an incompressible deformation in a subregion with high accuracy. While Fig. 2 illustrates the degradation of this result for larger deformation, i.e. when registering frames at the opposite of the cardiac cycle.
5 Conclusion and Future Work
5.0.1 Limitations
Similar to [6, 7], the divergence-free constraint is imposed on the stationary velocity field (SVF) in a subregion , rather than imposing incompressibility on . A voxel that is originally in might exit during the integration of the SVF and start being transported by velocity vectors that are not divergence-free (see supplemental material for a mathematical justification). In this case, the deformation of this voxel is no longer incompressible. As a result, using an SVF for incompressible registration applies only for deformations that are small enough or when the whole spatial domain is constrained to be divergence-free. Investigating other diffeomorphic parameterisations is left for future work.
5.0.2 Advantages compared to previous methods
Our method for incompressible registration relies on the parametrisation of the velocity field by a divergence conforming B-splines [4]. In contrast to classical B-splines used in [6, 7], it guarantees that the divergence of the velocity field is still a B-spline. This parametrisation along with constrained optimisation methods allows us to impose the velocity field to be divergence-free up to machine precision ( in our experiments). This is irrespective of the grid resolution chosen for the velocity field. As a result, the proposed method is scalable to 3D images with high resolution.
We also proved an error bound for the incompressibility of the deformation for the proposed method in the case an Euler integration of the velocity field is used (8). The study of the error bound for other integrators, that may require additional interpolations (e.g. scaling-and-squaring), is left for future works. Additionally, previous (quasi-)incompressible registration methods [6, 7] have been limited to using SSD as image similarity metric. We are proposing the first incompressible non-linear registration method that supports any smooth image similarity measure and spatial regularization.
Acknowledgments
This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement TRABIT No 765148; Wellcome [203148/Z/16/Z; 203145Z/16/Z; WT101957], EPSRC [NS/A000049/1; NS/A000050/1; NS/A000027/1; EP/L016478/1]. TV is supported by a Medtronic / RAEng Research Chair [RCSRF1819\7\34].
1 B-splines notations
To simplify the notations, let us assume that:
- •
is the continuous spatial domain of the images,
- •
, the order of the B-splines basis, is less than (higher order values are rarely used in practice)
- •
is a regular spacing with ,
- •
is a regular grid of knots for the spacing on .
We use the following notations for the B-splines basis functions of order :
[TABLE]
where the for are defined by:
[TABLE]
Using those notations, in equation (7) we define a 3D divergence-conforming SVF of order and parameters as, for all ,
[TABLE]
Remark: Support of B-splines basis functions
The support of a function is the set of points where is non-zero, i.e. . For any direction , for , the support of the function is .
2 Proof of Lemma 1
In this subsection, we give more details on the proof of Lemma 1. We start by showing equation (5). The functions have the property:
[TABLE]
So using the chain rule, we obtain for all and ,
[TABLE]
Similarly, for the directions we obtain:
[TABLE]
Thus, if , for all :
[TABLE]
Separating the sum into two sums and using the change of index in the second sum, we obtain:
[TABLE]
We have for all (see remark in 1.1), so we can group the two sums and we finally obtain:
[TABLE]
Similarly we obtain, for all :
[TABLE]
As a result, for all , the divergence of at is given by:
[TABLE]
We are now ready to prove Lemma 1. Let us assume that , and is a non-empty subset of . Let and
[TABLE]
contains all the indices so that the support of the function is non-zero for at least one point of .
As a result, if for all
[TABLE]
Then, for all ,
[TABLE]
Which concludes the proof of Lemma 1.
3 Proof for Lie exponential approximation and incompressibility
In this subsection, we give a detailed proof for the error of incompressibility with an Euler approximation of the Lie exponential (8). Let , let be the time step in the Euler integration. The Euler approximation of the Lie exponential for the time step is given by:
[TABLE]
where is the identity mapping.
Let be a non-empty subregion of the spatial domain and . The Jacobian of the first step of the Euler integration at is given by:
[TABLE]
Let us note:
[TABLE]
Using the chain rule and the fact that the determinant of the composition of two matrices is equal to the product of their determinant, we obtain:
[TABLE]
Let us now assume that satisfies the condition of Lemma 1 for close to [math], up to machine precision (typically ). If in addition, . Then, , and
[TABLE]
As a result, we obtain the approximation given in (8):
[TABLE]
Remark: divergence-free SVF does not guarantee incompressibility of the transformation when is local and the deformation is large
In the case at least one of the is outside of , inequalities (10) do not hold anymore. Although the divergence of the SVF is uniformly close to [math] on , some point can be deformed in a compressible manner. This happens when the deformation is large and points that were initially inside end up outside of during the Euler integration. In practice, deviations from an incompressible deformation in can be observe for accurate divergence-free SVFs in , as illustrated in Fig. 2.
Fortunately, the definition of implies the presence of margins around the incompressible region . As a consequence, inequalities (10) are verified in practice for small and moderate deformations in , as illustrated in Fig. 1. One can verify that thoses margins are linear in the order of the B-splines basis.
It is worth noting that this limitation is due to the use of SVFs, also used in previous works. In addition, when is equal to the entire image domain , inequalities (10) are always satisfied for a divergence-free SVF obtained by our method.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Aganj, I., Reuter, M., Sabuncu, M.R., Fischl, B.: Avoiding symmetry-breaking spatial non-uniformity in deformable image registration via a quasi-volume-preserving constraint. Neuroimage (2015)
- 2[2] Bistoquet, A., Oshinski, J., Škrinjar, O.: Myocardial deformation recovery from cine MRI using a nearly incompressible biventricular model. Med. Image Anal. (2008)
- 3[3] De Craene, M., Piella, G., Camara, O., Duchateau, N., Silva, E., Doltra, A., D’hooge, J., Brugada, J., Sitges, M., Frangi, A.F.: Temporal diffeomorphic free-form deformation: Application to motion and strain estimation from 3D echocardiography. Med. Image Anal. (2012)
- 4[4] Evans, J.A., Hughes, T.J.: Isogeometric divergence-conforming B-Splines for the unsteady Navier-Stokes equations. J. Comput. Phys. (2013)
- 5[5] Heyde, B., Alessandrini, M., Hermans, J., Barbosa, D., Claus, P., D’hooge, J.: Anatomical image registration using volume conservation to assess cardiac deformation from 3D ultrasound recordings. Trans. Med. Imaging (2016)
- 6[6] Mang, A., Gholami, A., Davatzikos, C., Biros, G.: CLAIRE: A distributed-memory solver for constrained large deformation diffeomorphic image registration. ar Xiv preprint ar Xiv:1808.04487 (2018)
- 7[7] Mansi, T., Pennec, X., Sermesant, M., Delingette, H., Ayache, N.: I Log Demons: A demons-based registration algorithm for tracking incompressible elastic biological tissues. Int. J. Comput. Vis. (2011)
- 8[8] Modat, M., Ridgway, G.R., Taylor, Z.A., Lehmann, M., Barnes, J., Hawkes, D.J., Fox, N.C., Ourselin, S.: Fast free-form deformation using graphics processing units. Comput. Methods Programs Biomed. (2010)
