Symmetric Algorithmic Components for Shape Analysis with Diffeomorphisms

06/07/2019 ∙ by N. Guigui, et al. ∙ 0

In computational anatomy, the statistical analysis of temporal deformations and inter-subject variability relies on shape registration. However, the numerical integration and optimization required in diffeomorphic registration often lead to important numerical errors. In many cases, it is well known that the error can be drastically reduced in the presence of a symmetry. In this work, the leading idea is to approximate the space of deformations and images with a possibly non-metric symmetric space structure using an involution, with the aim to perform parallel transport. Through basic properties of symmetries, we investigate how the implementations of a midpoint and the involution compare with the ones of the Riemannian exponential and logarithm on diffeomorphisms and propose a modification of these maps using registration errors. This leads us to identify transvections, the composition of two symmetries, as a mean to measure how far from symmetric the underlying structure is. We test our method on a set of 138 cardiac shapes and demonstrate improved numerical consistency in the Pole Ladder scheme.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

1 Introduction

Computational anatomy aims at modeling the temporal evolution and cross-sectional variability of anatomical shapes. The deformations between shapes are obtained by applying non-rigid registration algorithms that seek the smallest transformation - in a sense that will be defined precisely - of the ambient space to match two shapes. In the diffeomorphic registration setting, the deformations are modeled by diffeomorphisms, that provide invertible and folding-free transformations.

In the Large Deformation Diffeomorphic Metric Mapping (LDDMM) framework, the space of diffeomorphisms is endowed with a right invariant metric and deformations of interest are obtained by geodesic flows from the identity transformation. They are parameterized by their initial velocity fields, which are tangent vectors at the identity deformation, defined by initial control points and dual momenta. A transformation is then computed by integration of differential equations. Registration is performed by solving an optimization problem on the initial momenta and control points with a gradient descent. These numerical schemes efficiently implement an exponential and logarithm map on a subspace of diffeomorphisms.

However in practice, the optimization problem is relaxed to enforce smooth deformations and results in inexact matching. Therefore we can think of the exponential map as not going “far enough”. In this work we introduce a modified exponential map that accounts for a residual error due to registration, indifferent to the choice of the regularization parameter.

The choice of the metric and regularization parameter affects the geometric structure of the space of deformations under consideration. Many convergence results depend on the curvature of this space, e. g. [pennec_parallel_nodate], and especially on its covariant derivative. This gradient being null in locally symmetric spaces, they form a very convenient setting to perform statistics on shapes. In order to assess how far from symmetric our structure is, it would therefore be valuable to develop a procedure to measure this gradient. In this paper we build on a specific parallel transport scheme.

Figure 1: Pole Ladder

In the statistical analysis of temporal deformations, parallel transport along geodesics is commonly used to perform inter-subject normalization, that is the vector transport of velocity fields from each subject’s space to a common atlas’ space. An approximation based on Jacobi fields was proposed in [Younes_Jacobi, louis:hal-01560787]. A numerical implementation named Pole Ladder (PL) was proposed in [lorenzi:hal-00870489] and relies only on the computation of exponential and logarithm maps. Following the Shild’s ladder, it consists in the construction of geodesic parallelograms. The progression between two shapes and is transported to by:

  • first computing a “midpoint” on the geodesic between and . It is seen as the diagonal of the geodesic parallelogram;

  • then extending the geodesic from to by the same length to obtain ;

  • similarly extending the geodesic from to to obtain the parallel deformation of the template ;

See Fig. 1 for a schematic representation.

For large deformations that typically arise in inter-subject registration, this procedure is usually iterated. We therefore expect numerical errors to grow linearly in the number of steps, and lose crucial numerical accuracy. The accuracy of this scheme was analyzed in [pennec_parallel_nodate] and shown to be a third order scheme in general, and exact in symmetric spaces where it is equivalent to a single transvection, that is, a composition of two symmetries, in our case symmetries with respect to and .

In many cases, it is well known that numerical errors can be drastically reduced in the presence of a symmetry. This is for instance the case to diagonalize a symmetric matrix versus an arbitrary one. Using the Stationary Velocity Fields (SVF) framework for registration, a symmetric variant of Pole Ladder built on a Lie Group intrinsic symmetric structure was proposed in [jia:hal-01860274]. This procedure is recalled in section 2.2. In this work, we build on this idea, but rely on LDDMM to implement a more general involution that accounts for the registration residual. This elementary algorithmic component constructs the symmetric shape of an original shape with respect to another one. It is presented in section 2.3. In section 2.4

, we introduce the basic properties that symmetries must verify in an affine symmetric space and discuss whether these are fulfilled by our implementation. From a theoretical perspective, deviations from these properties are due to a non zero covariant derivative of the curvature tensor with the LDDMM metric. Conversely, we may interpret transvection errors as estimates of the numerical curvature gradient that encompass all the approximations due to the implementation. The numerical experiments of section 

3 show that there is an optimal regularisation parameter for which the space of deformations can best be approximated by a symmetric space.

The paper is organised as follows: in section 2.1, we recall the LDDMM framework following [durrleman_morphometry_2014] and in section 2.2 the Pole Ladder procedure. We then introduce in sections 2.3 and 2.4 the main contributions of the paper, namely accounting for residuals, defining symmetries and their properties: centrality, involutivity and transvectivity. In section 3 we present the numerical experiments and comment on the results.

2 Background and Method

2.1 The LDDMM Framework

In this work we consider shapes represented by 3D meshes. However, the methodology seamlessly applies to images. In order to define a practical finite dimensional parameterization of a subspace of diffeomorphisms acting on the ambient space , we consider time-varying velocity fields obtained by convolution of a Gaussian kernel over control points and momenta .

The set of such fields forms a pre-Hilbert space with scalar product between and defined by

(1)

Diffeomorphisms are then defined as flows of velocity fields from

. This amounts to integrating the ordinary differential equation (ODE)

between and . The scalar product on velocity fields induces a right-invariant Riemannian metric on the obtained subspace of diffeomorphisms, and geodesics of this metric are parameterized by control points and momenta that satisfy the following Hamiltonian equations:

(2)

and are thus uniquely determined by their initial control points , this dependence will be explicitly written and . In practice the interval is discretized with time steps and the ODE is solved with an iterative Euler forward or Runge-Kutta 2 method. This implements an exponential map at identity. The registration problem between a template shape and a target mesh optimizes the following criterion over initial control points and momenta :

(3)

For simplicity, we measure the distance between shapes by the distance between nodes of the meshes. is the norm defined by the scalar product of eq. 1, which is actually the metric on . The resulting is a logarithm at identity of . In fact the metric is scaled by a factor

, and this impacts the geometry of the underlying space as will be demonstrated. It allows to smoothly interpolate between solutions that belong to two paradigms:

  • : exact matching between shapes;

  • : point distribution models (PDM), no deformation.

2.2 Symmetric Pole Ladder for parallel transport

In the context of computational anatomy, the aforementioned registration framework is used to represent a subject-specific temporal deformation between shapes and , and to transport this deformation to a common atlas or template along the geodesic segment . The anatomical shapes are modeled as points in a manifold under the action of the space of diffeomorphisms described above. We suppose here that this manifold is equipped with an affine connection, which defines parallel transport and the Exp map. Locally it further defines the Log map.

Algorithm 1 presents a symmetric variant of Pole Ladder [lorenzi:hal-00870489] introduced in [jia:hal-01860274] to approximately perform parallel transport in .

- Compute the midpoint on the inter-subject geodesic;
- Compute the symmetric point of with respect to ;
- Compute the symmetric point of with respect to , and return the geodesic segment .

Algorithm 1 Mid-point symmetric Pole Ladder transport of the geodesic segment along the geodesic

A Taylor expansion at the midpoint of the error between the vector transported by Pole Ladder and exact parallel transport of the vector is derived in [pennec_parallel_nodate]. We denote by the exact transport to , and where is obtained by Pole Ladder. Let also . Then

(4)

In fact this scheme is exact in an affine locally symmetric space, where . In this case, using the local symmetries at point X, we have meaning that Pole Ladder is equivalent to a transvection. As local symmetries are affine mappings, the following diagrams commute:

T_S V[d, ”Π_S^M”] [r, ”(ds_M)_S”] & T_T V[d, ”Π_T^M”]

T_MV[r, ”-Id”] & T_MV           T_S V[d, ”Exp_S”] [r, ”(ds_M)_S”] & T_T V[d, ”Exp_T”]

V[r, ”s_M”] & V

Thus, [postnikov_geometry_2001, Prop 4.3]. So with the previous notations, and yielding .

2.3 Accounting for residuals to improve Centrality and Symmetry

Figure 2: Midpoint with Residuals

In practice the registration is never exact due to the regularization. Thus, we propose to decompose the space of shapes into a deformation part encoding the orbit of the template, and a Euclidean space of residual displacement fields

(5)

where is a displacement field between corresponding points of the two meshes. Of course different possibilities exist to compute the residual, to transport it, and to apply it to different shapes, but our experiments suggest that this very simple formulation may be sufficient, so that we will not detail other approaches in this paper. With this decomposition, a midpoint between and is defined by (Fig. 2):

(6)

Unfortunately this formulation is not symmetric in and , and registering on and shooting from results in a different midpoint in general. We will see however that using residuals decreases the distance between the midpoints obtained with the two initial points.

Figure 3: Symmetry with Residuals

Similarly, a symmetry is defined by inverting the geodesics and the residuals (Fig. 3):

(7)

The first desired consistency property which we refer to as centrality is the compatibility of the midpoint with the symmetry, namely . Note that this construction of a central midpoint and a local geodesic symmetry is possible in arbitrary affine connection manifolds for close enough points. However, these symmetries are affine mappings if and only if the space is locally symmetric [postnikov_geometry_2001, Prop 4.2].

2.4 Involutivity and Transvectivity to measure curvature gradient

By construction our symmetry verifies for all , and if the and maps are exact, . We will evaluate the exactitude of this property, called involutivity. Note that in a Lie Group of transformations, natural symmetries may be defined at by , which, at is in fact the inversion. Involutivity in this case reduces to inverse consistency: . However, in our framework, both types of errors are different because the metric exponential differs from the one defined by the canonical Cartan-Shouten connection, which is the only one compatible with the group operations.

Finally, in an affine globally symmetric space, symmetries must verify the following property that we will call transvectivity [postnikov_geometry_2001, Prop 5.3]:

(8)

We want to evaluate the exactitude of this property, and use the deviation to this ideal case as a proxy to measure the gradient of the curvature of the space in the directions of interest. At this point the role of becomes clearer, it allows to form a continuum of decompositions of the space of diffeomorphisms under consideration:

  • : the Riemannian space of deformations where the metric is not compatible with the Cartan-Shouten connection. This space is not symmetric, which shows in the transvectivity error.

  • : the shapes are considered in the ambient space with Euclidean norm, this space is of course symmetric. This is the PDM framework.

We saw in section 2.2 that Pole Ladder was doing the transvection . With the same notations and using a Taylor expansion from [pennec_parallel_nodate], the deviation to parallel transport when applying the opposite transvection is:

(9)

Thus when measuring the transvectivity error , we in fact measure where

(10)

The transvectivity error thus provides a practical way to measure the gradient of the curvature of the space even in the absence of any closed-form expression. This is noticeable in regards to the complexity of the curvature tensor itself in Mario’s formula [micheli_sobolev_2013] and it may lead in the future to new ways of estimating the curvature and its gradient.

3 Experiments and Application to Cardiac Shapes

In this section we assess the consistency of our numerical implementation of the symmetry compared to its theoretical properties. We compare the symmetry with residuals to standard symmetry without residuals () for different values of the parameter . We used Deformetrica [bone_deformetrica] for all our experiments. We also compare the parallel transport obtained by Pole Ladder with both types of symmetry to the one implemented in Deformetrica [louis:hal-01565478] using the fanning scheme.

We use a database of cardiac shapes from 138 subjects [jia:hal-01860274] for which the shapes at two time-points are available: at end-diastole () and at end-systole (). We use a population atlas as template . Four types of errors are first measured. The first is the distance between midpoints when shooting from or from . The three others are, where is the midpoint obtained by shooting from :

  • : the centrality error (Fig. 3(a))

  • : the involutivity error (Fig. 3(b))

  • : the transvectivity error (Fig. 3(c))

(a) Centrality
(b) Involutivity
(c) Transvectivity
Figure 4: The three types of errors measured

Mean results for extreme values of are given in table 1. The average registration error of on each subject’s , as well as the norm of the deformation and inverse consistency (by registering on ) for each regularisation parameter are also given for reference.

Error Type Residual No Residual Residual No Residual Residual No Residual
Centrality 0.36 0.43 0.10 0.50 5.76
Involutivity 1.42 1.55 0.33 0.80 9.39
Transvectivity 1.98 2.16 0.58 0.62 0.16
Reg. Error 0.23 0.41 5.61
Reg. Norm 42 30 1
Inverse Cons. 0.13 0.14 0.10
Table 1: Mean errors measured on cardiac shapes, in millimeters

These results illustrate the two contributions of this paper. Firstly, using residuals in the symmetry considerably improves the numerical accuracy of the computation of a midpoint. As we can see on Fig. 4(a), the distance between midpoints computed by shooting from or from is reduced when using the residuals. This error compares well with the inverse consistency error in general and is even significantly lower for .

Moreover, this increase in numerical accuracy is also visible on the centrality and involutivity errors. Indeed, for centrality (Fig. 4(b)), the error when using residuals is consistently smaller than without residuals, and this gain becomes larger as grows. It is also remarkable that this error is significantly lower than the registration error for . The same behavior is observed for the involutivity on Fig. 4(c). This means that for reasonable values of we obtain reliable implementations of the midpoint and symmetry.

Secondly, the LDDMM space endowed with the right invariant metric is not symmetric, and the transvectivity error reflects the covariant derivative of the curvature. Fig. 4(d) gives further details: pushing registration with a small generates larger errors, and there is an optimal for which the space is closest to being symmetric. Using residuals, this error decreases as the space flattens to a Euclidean space and deformations tend to the identity.

(a) Distance between Midpoints
(b) Centrality
(c) Involutivity
(d) Transvectivity
Figure 5: The four errors for different values of , with and without residuals in the computation of the midpoint and the symmetries.

Finally, in order to evaluate the result of symmetric Pole Ladder and compare it to the fanning scheme, we compute the local area strain (LAS) between end-diastole and end-systole at every landmark of the mesh. For two corresponding points that belong to triangular cells, we compute the mean of the difference of area of each of these cells between and .

(11)

This feature is commonly used by clinicians to characterise the cardiac motion [kleijn_three-dimensional_2011]. Here we use it to test the isometric property of the parallel transport scheme: we measure the area strain between the original subject’s meshes and , and compare it to the one measured between the atlas and the deformed atlas obtained by the parallel transport algorithm. We report in Fig. 5(a) the square root of the sum of squared differences over all landmarks:

(12)

As grows, both the temporal and subject-to-atlas deformations decrease, thus generating less area changes, which explains the growing errors. Furthermore, we can see on Fig. 5(b) that the area strain is dominated by a bending artifact of the valve sections at the borders. Using residuals reduces this effect in this example. Although more suitable methods may exist to directly map scalar functions from one shape to another, these results emphasize the contribution of this paper: using residuals improves the symmetry and parallel transport with Pole Ladder.

(a) Local Area Change errors for different values of with and without residuals in Pole Ladder, and with Deformetrica’s fanning scheme.
(b) Area Strain maps
Figure 6: b) Area strain maps for one patient computed between S and S’ and represented on S (top left), and computed between T and T’ and represented on T, where T’ is obtained with the different methods and .

4 Conclusion

We introduced residuals from registration errors to compute midpoints and symmetries between shapes. This results in improved numerical consistency for the centrality and involutivity properties. Furthermore the transvectivity error reflects the curvature of the underlying Riemannian space of deformations, and allows to estimate how far from symmetric this space is, depending on the regularisation parameter. Performing the same experiments in the framework of SVF with a similar implementation would yield very interesting comparison as the space is naturally symmetric, and accounting for residuals would thus provide a more consistent method for parallel transport. This gain could be even more interesting when considering registration between images. Indeed images are not in the template’s orbit in practice and residuals would encode intensity bias, which is a key source of error in image registration.

Acknowledgements:

This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement G-Statistics No 786854).

References