Skip to main content
Springer logoLink to Springer
. 2017 Jun 26;18(4):891–927. doi: 10.1007/s10208-017-9357-9

Shape-Aware Matching of Implicit Surfaces Based on Thin Shell Energies

José A Iglesias 1,, Martin Rumpf 2, Otmar Scherzer 1,3
PMCID: PMC6417424  PMID: 30956649

Abstract

A shape sensitive, variational approach for the matching of surfaces considered as thin elastic shells is investigated. The elasticity functional to be minimized takes into account two different types of nonlinear energies: a membrane energy measuring the rate of tangential distortion when deforming the reference shell into the template shell, and a bending energy measuring the bending under the deformation in terms of the change of the shape operators from the undeformed into the deformed configuration. The variational method applies to surfaces described as level sets. It is mathematically well-posed, and an existence proof of an optimal matching deformation is given. The variational model is implemented using a finite element discretization combined with a narrow band approach on an efficient hierarchical grid structure. For the optimization, a regularized nonlinear conjugate gradient scheme and a cascadic multilevel strategy are used. The features of the proposed approach are studied for synthetic test cases and a collection of geometry processing examples.

Keywords: Variational shape matching, Implicit surfaces, Thin shells, Weak lower semicontinuity

Introduction

We present a variational model for the matching of surfaces implicitly represented as level sets. The approach is inspired by the mathematical theory of nonlinear elasticity of thin shells. The model consists in an energy functional, which is to be minimized among deformations of a computational domain in which two given surfaces are embedded. A minimizer of this functional is a deformation that closely maps one (reference) surface onto the other (template) surface. As the underlying model we consider the reference surface as a thin elastic shell, i.e., a layer of an elastic material embedded in a volume of another several orders of magnitude softer isotropic elastic material. Subject to matching forces the volume is deformed in such a way that the thin shell is mapped onto the template surface. The functional reflects desired phenomena like resistance to compression and expansion of the surface, resistance to bending, and rotational invariance, while solely involving the deformation and the Jacobian of the deformation. The model is formulated in terms of projected derivatives from the tangent space of the reference surface onto the expected tangent space of the template surface. Taking into account a suitable factorization of the natural pullback under a deformation of shape operators enables us to formulate a model with appropriate convexity properties. The actual surface matching constraint is handled through a penalty, allowing for efficient numerical computation.

Through arguments of compensated compactness, we are able to show weak lower semicontinuity of the energy and consequently existence of minimizing deformations. We present a numerical approach based on a multilinear finite element ansatz for the deformation implemented on adaptive octree grids. The resulting discrete energy is minimized in a multiscale fashion applying a regularized gradient descent.

In the conference article [32], a preliminary version of this approach was presented. For the functional in that paper, lower semicontinuity could not be ensured for either the membrane or bending energies. This lack of lower semicontinuity manifests itself in applications, where compression of the surface is expected, and leads to undesired oscillations in almost-minimizing deformations, which we explore in the present work through explicit examples and computations. Additionally, to increase the efficiency the computational meshes are in the present paper adapted to the surfaces. Consequently, the number of degrees of freedom scales asymptotically almost like that of a surface problem.

The main pillar of our modeling is the use of polyconvex energy densities, first introduced in [3]. Energies of this type allow for geometric consistency properties like rotation invariance and the ability to measure area and volume changes. The core insight of this theory is that integrands consisting of convex functions of subdeterminants of the Jacobian give rise to integral functionals that are weakly lower semicontinuous in suitable Sobolev spaces. Indeed, this can be seen as an instance of compensated compactness [50]. A generic polyconvex isotropic energy density of the type used in this work is

αpAp+βqCofAq+Γ(detA), 1.1

for CofA:=detAA-T the cofactor matrix of A. Here, the coefficients and the function Γ are such that (1.1) attains a local minimum for ASO(n), that is, for rigid motions. Such an example is provided in (3.8). Often in the modeling of nonlinear elasticity the condition

limdetA0+Γ(A)=+ 1.2

is added, to reflect the noninterpenetration of matter [4]. In our model, we make use of densities both with and without this property.

Related work Linear elasticity has been extensively used in computer vision and in graphics. Prominent applications are image registration [33, 34, 38, 48, 55], optical flow extraction [35], and shape modeling [29]. Recently, theories of nonlinear elasticity have been applied in many computer vision and graphics problems such as mesh deformation [13], shape averaging [56], registration of medical images [12]. The advantage of nonlinear models is that they allow for intuitive deformations when the displacements are large.

In this paper, we present a model for nonlinear elastic matching of thin shells. A finite element method for the discretization of bending energies of biological membranes has been introduced in [5]. Their approach uses quadratic isoparametric finite elements to approximate the interface on which the gradient flow of an elastic energy of Helfrich type is considered. The papers [9, 10] discuss accurate convex relaxation of higher-order variational problems on curves described as jump sets of functions of bounded variation. In particular, it enables the numerical treatment of elastic energies on such curves.

One challenge in polyhedral surface processing is to provide consistent notions of curvatures and second fundamental forms, i.e., notions that converge (in an appropriate topology or in a measure theoretic sense) to their smooth counterparts, given a smooth limit surface. One computationally popular model for discretizing the second fundamental form is Grinspun’s et al.  [30] discrete shells model. Another efficient and robust method for nonlinear surface deformation and shape matching is PriMo [6]. This approach is based on replacing the triangles of a polyhedral surfaces by thin prisms. During a deformation, these prisms are required to stay rigid, while nonlinear elastic forces are acting between neighboring prisms to account for bending, twisting, and stretching of the surface. We refer to Botsch and Sorkine [7] for a discussion of pros and cons for various such methods. In comparison with methods based on polyhedral surfaces, level set approaches like ours are not dependent on specific triangulations of the shapes.

The matching of surfaces with elastic energies has recently been studied in [61]. Their energy contains a membrane energy depending on the Cauchy–Green strain tensor and a bending-type energy comparing the mean curvatures on the surfaces. The matching problem is formulated in terms of a binary linear program in the product space of sets of surface patches. For computations, a relaxation approach is used.

A different direction is the use of parametric approaches to reduce shape matching problems to the matching of functions on a fixed domain. For example, the methods presented in [60, 62] are based on conformal maps from the unit disk. A more general variant using conformal maps on surfaces with arbitrary topology is presented in [42]. Within the family of parametric methods, a surface matching approach related to ours is presented in [44], where nonlinear elastic energies are used for matching parametrized surface patches. In comparison with all these methods, our level set approach is nonparametric and allows surfaces of any topology, which does not need to be fixed in advance.

In [59], face matching based on a matching of corresponding level set curves on the facial surfaces is investigated. To match pairs of curves an optimal deformation between them is computed using an elastic shape analysis of curves. Compared to our approach, this model does not take into account bending dissipation of the curves.

A different direction in shape recognition and matching is exploiting the intrinsic geometry of the surfaces only, thereby producing isometry-invariant methods based on the first fundamental form, like those in [11, 24]. In comparison, bending is penalized in our model and we use all curvatures of the surfaces and their directions to be able to better match regions of edges and creases correctly.

A method for matching and blending of curves represented by level sets has been presented in [49]. Thereby, a level set evolution generates an interpolating family of curves, where the associated propagation speed of the level sets depends on differences of level set curvatures. In this class of approaches, geometric evolution problems are formulated, whereas here we focus on variational models for matching deformations. Variational registration of implicit surfaces was also considered in [40], but only through volume elasticity, in contrast to our shell terms.

To summarize, the main novelty of our contribution is the combination of independence of mesh topologies arising from the use of level sets, penalization of tangential distortion in a rotationally invariant framework, and awareness both of curvatures and curvature directions of the surfaces in the matching. We are not aware of any other methods possessing all of these features simultaneously.

Our approach is inspired by the articles [21, 22] in which surface PDE models are derived in terms of the signed distance function. Shape warping based on the framework of [21] has been discussed from a geometric perspective in [14].

Outline The paper is organized as follows. In Sect. 2, we review the required preliminaries about distance functions and formulate the geometric nondistortion and matching conditions that inspire our model. In Sect. 3, we present the different contributions to our energy. Section 4 is devoted to proving the existence of minimizing deformations under suitable Dirichlet and Neumann boundary conditions. Furthermore, the strong convergence of solutions for vanishing matching penalty parameter is discussed and counterexamples showing the lack of lower semicontinuity of related simpler models are given. In Sect. 5, a numerical strategy for minimizing the energy on adaptive octree grids is presented. Finally, Sect. 6 contains a range of numerical examples demonstrating the behavior of solutions corresponding to our design criteria and presents several potential applications.

Some useful notation For later usage and the purpose of reference, let us collect some useful notation, mostly introduced in detail in later sections:

  • |B| stands for the Lebesgue measure of BRn, and diamB=supx,yB|x-y| for its diameter.

  • Generic matrices are denoted by ABMN. We use 1 for the identity matrix. The set of rotations is denoted by O(n), and SO(n) is the set of orientation-preserving rotations. The set of all symmetric and positive definite matrices is SPD(n).

  • Components of vectors are denoted with subindices. For vRn, |v| denotes its Euclidean norm. The (n-1)-dimensional sphere is Sn-1. For a matrix M, |M| is the Frobenius norm.

  • For two column vectors v,wRn, vw is the tensor product of v and w, that is, the square matrix vwT. In particular, if |w|=1 we have the identity (vw)w=v.

  • P(e)=1-ee is the projection onto vectors orthogonal to eSn-1.

  • Deformations on Rn are denoted by ϕ, and deformations defined on a hypersurface MRn by φ. The identity deformation is denoted by id.

  • ΩRn denotes the computational domain. Every relevant deformation ϕ maps Ω into Rn. Ω has to contain all computationally relevant manifolds M. Ω has Lipschitz boundary, is open and bounded.

  • We use the notation i for partial derivatives, for the gradient of a scalar function, D for the Jacobian matrix of a vector function and D2 for the Hessian matrix of a scalar function.

  • M1,M2Ω are C2,1 compact hypersurfaces. The inside and outside components of Ω\Mi are well defined by the Jordan–Brouwer separation theorem ([31], Chapter 2, Section 5).

The signed distance function to M1,M2 is denoted by d1,d2. The sign convention is that di is negative on the inside of Mi, so that di(x)=-dist(x,Mi) if x is in the inside component of Ω\Mi and di(x)=dist(x,Mi) otherwise, where the distance functions dist(·,Mi), i=1,2 are the unique viscosity solutions of 1-|dist(·,Mi)|=0 and dist(·,Mi)=0 on Mi. The normal fields to the offsets of Mi at a point x are denoted by ni(x):=di(x). A superscript next to Mi (i=1,2), as in Mic, denotes that we are talking about a level set of di with value different from zero, so that Mic:=di-1(c).

TxMidi(x) denotes the tangent space to Midi(x) at x. The outwards normal to Midi(x) is given by ni(x), and the set of points where di is not differentiable is denoted by singdi.

We use Si=D2di for the Hessian of di, which coincides with an extended shape operator of Mi.

  • λ,μ are the Lamé coefficients of an isotropic material in linearized elasticity.

  • C0(Ω;Rn) is the space of continuous functions from the domain Ω to the range Rn, Ck,α the Hölder spaces in which the k-th derivative is α-Hölder continuous, including the Lipschitz case α=1. The range of the spaces is specified unless it is R. Sobolev spaces are denoted by W1,p and the closure of compactly supported smooth functions in them by W01,p.

  • The letter C is reserved for a generic positive constant that may have different values in each appearance. Sequence indexing is usually denoted by a superscript k, and limits by an overline, e.g., ϕkϕ¯.

Deformation and Matching of Level Set Hypersurfaces

We are given two compact, connected embedded hypersurfaces M1,M2 of class C2,1, which are diffeomorphic to each other, and both of which are contained in a bounded Lipschitz domain ΩRn. In this section, we deal with the tangential distortion and the change of the shape operator under a deformation ϕ:ΩRn.

For any cR, we denote the c-offsets to the hypersurface Mi by Mic:={xΩ|di(x)=c}. Furthermore, we define the singularity set singdi as the set of points where di is not differentiable. With the regularity of Mi that we have assumed, it is well known (e.g., Theorem 1.1, Corollary 1.3 and Remark 1.4 of [43]) that singdi has Lebesgue measure zero and dist(Mi,singdi)>0. Furthermore, combining [21, Theorem 5.6] and [45, Proposition 4.6, 7.] we see that diC2(Ω¯\singdi¯).

The gradient of the signed distance function di(x) is the outward-pointing unit normal ni(x) to Midi(x) at a point x. The tangent space to Midi(x) at x, denoted by TxMidi(x), consists of all vectors orthogonal to ni(x). Then, the corresponding projection matrices onto the tangent spaces are defined by

Pi(x):=P(ni(x))=1-ni(x)ni(x).

Note that Si(x):=D2di(x)=Dni(x)Pi(x) is the shape operator of the immersed hypersurface Midi(x) at a point x. In fact, from |ni(x)|2=1 we deduce by differentiation that niT(x)Si(x)=0. This, together with the fact that nini is the projection onto the normal of the hypersurface Si shows that

Pi(x)Dni(x)=Dni(x).

With our choice of signs for di, the symmetric matrices Si are positive semidefinite for convex hypersurfaces Mi. Further information on tangential calculus for level set functions may be found in Chapter 9 of [23].

Tangential Derivative and Area and Length Distortion

First, let us assume that ϕ exactly maps M1c onto M2c, for all c>0. Then, TxM1d1(x)=imP1(x) and Tϕ(x)ϕ(M1d1(x))=Tϕ(x)M2d2(ϕ(x))=imP2(ϕ(x)) and we define the tangential derivative induced by the deformation ϕ as

Dtgϕ(x):=P2(ϕ(x))Dϕ(x)P1(x), 2.1

capturing the tangential variation of ϕ(x) on M2 along tangential directions on M1. In the variational model, we consider below an energy term depending on Dtgϕ(x) will reflect the tangential distortion of the deformation in the context of a matching of the two hypersurfaces M1 and M2 even though ϕ(M1) does not necessarily equal M2. Indeed, in the case M2ϕ(M1) the variation along a tangent direction on M1 is still projected via Dtgϕ(x) onto the tangent space Tϕ(x)M2d2(ϕ(x)) and not onto the tangent space of the deformed hypersurface ϕ(M1) (cf. Fig. 1). Therefore, there may exist tangential directions vTxM1d1(x), such that Dtgϕ(x)v=0 even though Dϕv0. Thus Dtgϕ(x) can only be considered a measure of tangential distortion if ϕ(M1) is sufficiently close to M2 in the sense of closeness of tangent bundles.

Fig. 1.

Fig. 1

A sketch of the tangential derivative Dtgϕ in the nonexact matching case with ϕ(M1)M2

For a general deformation ψ:RnRn the Cauchy–Green strain tensor DψTDψ describes (up to first order) the deformation in a frame invariant (with respect to rigid body motions) way. Since we are interested in the effect of such a deformation between two hypersurfaces, for a suitably extended tangential gradient Dtgϕ+n2ϕn1 we define the extended tangential part of the Cauchy–Green strain tensor, measuring only tangential distortion:

Dtgϕ+(n2ϕ)n1TDtgϕ+(n2ϕ)n1=DtgϕTDtgϕ+n1n1. 2.2

The term n2(ϕ(x))n1(x) is used to complement directions that are removed by the projections in the definition of the tangential distortion Dtgϕ and can be seen to realize a nonlinear Kirchhoff–Love assumption [18, Page 336], which postulates that lines normal to the middle surface of a shell remain normal after the deformation, without stretching.

Next, we investigate the area and length distortion due to the tangential derivative Dtgϕ. For a given vector eRn we denote by Q(e) any proper rotation such that Q(e)en=e, where en denotes the n-th element of the canonical basis of Rn. Note that this condition does not specify a unique Q(e). Then, for every BRn×n satisfying wkerB and imBv for some unit vectors v,wSn-1, we have

Q(v)T(B+vw)Q(w)=Q(v)TBQ(w)+enen=B~001, 2.3

where B~ is the upper left (n-1)×(n-1) submatrix of Q(v)TBQ(w). Obviously, (2.3) implies

det(B+vw)=det(B~),|B+vw|2=tr((B+vw)T(B+vw))=1+|B~|2.

Hence, for ϕ(M1)=M2 and v=n2(ϕ(x)), w=n1(x) the area distortion under the hypersurface matching deformation ϕ at some position x is described by det(Dtgϕ(x)+n2(ϕ(x))n1(x)), which equals the positive square root of the determinant of the above Cauchy–Green strain tensor DtgϕTDtgϕ+n1n1. The squared tangential length distortion (in the sense of summing all squared distortions with respect to an orthogonal basis) is described by |Dtgϕ(x)+n2(ϕ(x))n1(x))|2 and equals the trace of the Cauchy–Green strain tensor.

Bending and Curvature Mismatch

Now, we quantify the change of curvature directions and magnitudes under the deformation ϕ. Our approach is motivated by models describing bending of elastic shells, because in our application the hypersurfaces are considered as thin shells.

In order to quantify the changes of curvature, we first assume that ϕ(M1)=M2, and compute the difference of the pull back of the shape operator S2 on M2 onto M1 under the deformation ϕ and the shape operator S1 on M1, which, for two arbitrary directions v,wRn, is given by

S2(ϕ(x))Dϕ(x)v·Dϕ(x)w-S1(x)v·w=Dϕ(x)TS2(ϕ(x))Dϕ(x)-S1(x)v·w.

If v,w are tangent vectors in TxM1, this difference describes the relative shape operator.

We define the extended relative shape operator

Srel(x):=Dϕ(x)TS2(ϕ(x))Dϕ(x)-S1(x). 2.4

For n=3 and when ϕ is an isometric deformation between M1 and M2 (that is, Dϕ(x) is an orthogonal mapping on TxM1 for all xM1), Srel appears in physical models for thin elastic shells in the context of the Γ-limit of 3D hyperelasticity [28]. Even though we do not necessarily expect our deformations to be tangentially isometric, we use this ansatz to compare curvatures of level sets in deformed and undeformed configuration, respectively. The following calculations shed some light on the properties of Srel:

D2(d2ϕ)(x)=D((Dϕ)T(n2ϕ))(x)=Dϕ(x)TS2(ϕ(x))Dϕ(x)+k=1n(n2(ϕ(x)))kD2ϕk(x). 2.5

The assumption that ϕ(M1)=M2 can be rewritten as d2ϕ(x)=0 for xM1. Let us assume that in addition d2ϕ is a distance function (that is |(d2ϕ)|=1), then d2ϕ is again a distance function, and since d2ϕ=0 it follows that the left-hand side of (2.5) is the shape operator of the hypersurface M1. The first term in the right-hand side is the pullback of S2.

Let us remark that the appearance of a second fundamental form is consistent with Koiter’s nonlinear thin shell theory [36], [18, Section 11.1]. Regardless of whether d2ϕ is a distance function or not, (2.5) implies that

Dϕ(x)TS2(ϕ(x))Dϕ(x)-S1(x)=-k=1n(n2(ϕ(x)))kD2ϕk(x)+D2(d2ϕ-d1)(x)=-k=1n(n2(ϕ(x)))kD2ϕk(x), 2.6

in case d2ϕ=d1. In the next section, we use the extended relative shape operator to derive a variational model for the mismatch of curvatures.

Energy Functional

Given two hypersurfaces M1 and M2 our ultimate goal is to describe best matching deformations ϕ, which map M1 onto M2 as the minimizer of a suitable energy. Thereby, different energy terms will reflect a set of matching conditions for a volumetric deformation ϕ:ΩRn and without a hard constraint ϕ(M1)=M2:

  • A membrane deformation energy Emem penalizes the tangential distortion measured through Dtgϕ.

  • A bending energy Ebend penalizes bending as reflected by the relative shape operator.

  • A matching penalty Ematch ensures a proper matching of the two hypersurfaces M1 onto M2 via a narrow band approach.

  • A volume energy Evol enforces a regular deformation on the whole computational domain Ω.

Our approach is based on level sets. Hence, we replace the integration over a single hypersurface, i.e., M1, for the first three energies by a weighted integration over a narrow band of width σ with 0<σ<dist(M1,singd1). To this end, we will make use of a cutoff function ησC0(R) with Rησ(t)dt=1 and suppησ=[-σ,σ]. Additionally, ησ is assumed to be even and strictly decreasing in [0,+).

In what follows we introduce the four energy contributions separately.

Tangential Distortion Energy

Picking up the insight gained in Sect. 2.1, we formulate the membrane energy in terms of the length and area change associated with the tangential distortion Dtgϕ:

Emem[ϕ]=δΩησ(d1(x))W(Dtgϕ(x)+n2(ϕ(x))n1(x))dx, 3.1

where W is a nonnegative polyconvex energy density vanishing at SO(n). The weight δ reflects the proper scaling of the tangential distortion energy in case of a thin shell model with shell thickness δ.

The energy (3.1) vanishes only on deformations ϕ whose Jacobian matrix Dϕ(x) maps TM1d1(x) isometrically onto TM2d2(ϕ(x)) for every point xsuppησd1. In consequence, both tangential expansion and compression are penalized.

Let us remark, that the extension Dtgϕ+n2(ϕ(x))n1(x) of the tangential derivative Dtgϕ defined in (2.1) with rank n-1 can degenerate or be orientation-reversing depending on the local configuration of M1 and M2 at x (cf. Fig. 2 for examples).

Fig. 2.

Fig. 2

Configurations in which for the (obviously isometric) identity we have det(Dtg1(x)+n2(1x)n1(x))=0 (left) and detDtg1(x)+n2(1x)n1(x)<0 (right) and thus the extended tangential derivative degenerates or reverses orientation

Furthermore, the energy density W should not satisfy W(B) for detB0. A straightforward modification of the arguments of Ciarlet and Geymonat ([16, 17] Theorem 4.10-2) leads to a smooth integrand W which has isometries as local minimizers, with the correct invariance properties, and with a Hessian for B=1 which matches the quadratic energy integrand of the Lamé-Navier model of linearized elasticity. With given Lamé coefficients λ,μ>0, we select the energy

W(A)=μ2|A|2+λ4(detA)2+μ+λ2e-(detA-1)-(n+2)μ2-3λ4.

This density fits into the notation of (1.1), if we choose p=q=2 and Γ(t)=ct2+de-(t-1).

Bending Energy

Now, we discuss a variational formulation of the curvature matching condition Dϕ(x)TS2(ϕ(x))Dϕ(x)=S1(x), which is equivalent to a vanishing relative shape operator [cf. (2.4)], where Si=DniPi=PiD2diPi for i=1,2 are the shape operators on the hypersurfaces M1 and M2, respectively. At first sight, it appears natural to formulate a quadratic penalization and to define a bending energy

E~bend[ϕ]=δ3Ωησ(d1(x))|Dϕ(x)TS2(ϕ(x))Dϕ(x)-S1(x)|2dx.

The weight δ3 reflects the scaling of the bending energy for thin shells of thickness δ. However, this energy is in general not weakly lower semicontinuous. Indeed, consider a situation in which S1(x)=S2(ϕ(x))=P(en). A short computation shows that the corresponding density is not convex in its matrix variable along the rank-one segment joining 1-34e1e1 and 1-12e1e1, which precludes lower semicontinuity (cf. also Example 4.8 on the lack of rank-one convexity). In fact, this kind of density is closely related to the Saint Venant–Kirchhoff energy, whose quasiconvex envelope is computed in [39].

Thus, we are asking for an alternative lower semicontinuous energy functional which gives preference to deformations ϕ for which DϕT(S2ϕ)Dϕ is close to S1. We show that this can be achieved with the extended shape operators Siext=PiD2diPi+nini for i=1,2 and factorization. For proving this, we make use of the following lemma.

Lemma 3.1

(Modified curvature matching condition) Assume that M, N are two symmetric, positive definite matrices satisfying

M=P1MP1+n1n1andN=P2NP2+n2n2.

Moreover, assume that ARn×n satisfies

AP1=P2A,

then the following statements are equivalent:

ATP2NP2A=P1MP1 3.2

and

Λ[M,N,A]:=P2N12P2AP1M-12P1+n2n1O(n). 3.3

Proof

By definition, the matrix Λ[M,N,A] is orthogonal if Λ[M,N,A]TΛ[M,N,A]=1. Therefore, if (3.3) holds, then

1=(P2N12P2AP1M-12P1+n2n1T)T(P2N12P2AP1M-12P1+n2n1T)=P1M-12P1ATP2N12P2P2N12P2AP1M-12P1+n1n2Tn2n1T=P1M-12ATP2(P2N12P2)2P2AM-12P1+n1n1T.

If we multiply this equation from left and right by P1M12P1 and take into account that (P2N12P2)2=P2NP2 and (P1M12P1)2=P1MP1 we see that this is equivalent to

P1ATP2NP2AP1=P1MP1.

Applying that AP1=P2A we finally achieve at the equivalent condition

ATP2NP2A=P1MP1.

The proof of the converse follows the same steps in opposite direction.

If the assumptions of this lemma apply to M=S1ext(x), N=S2ext(y), and A=Dϕ(x) with y=ϕ(x), then the curvature matching condition

(Dϕ(x))TP2(y)S2ext(y)P2(y)Dϕ(x)=P1(x)S1ext(x)P1(x) 3.4

is equivalent to Λ(S1ext(x),S2ext(ϕ(x)),Dϕ(x))O(n) and a lower semicontinuous energy functional penalizing deviations of Λ(S1ext(x),S2ext(ϕ(x)),Dϕ(x)) from O(n) would be a proper choice for realizing curvature matching. Unfortunately, the positive definiteness assumption of Lemma 3.1 is not fulfilled if principal curvatures of M1 or M2 are negative. Hence, we are replacing the extended shape operator matrices Siext by symmetric and positive definite curvature classification matrices Ci=C(Siext), i=1,2, respectively.

We have experimented with two different choices for C:

  • A simple choice is C(Siext)=Siext+μ1, where -μ is a strict lower bound of the principal curvatures. But in applications surfaces are frequently characterized by strong creases or rather sharp edges, leading to very large μ. As a consequence, the relative difference of the eigenvalues is significantly reduced when dealing with the resulting curvature classification matrices. Thus, the variational approach is less sensitive to different principal curvatures of the input hypersurfaces.

  • Another option is to use a truncation of the absolute value function for the eigenvalues of symmetric matrices. For a symmetric matrix BRn,n with eigenvalues λ1,,λn and a diagonalization B=QTdiag(λ1,,λn)Q we use the classification operator
    C(B)=QTdiag(|λ1|τ,,|λn|τ)Q,
    where |λ|τ=max{|λ|,τ} for some τ>0. This approach properly represents the exact shape operator matching objective in case of principal curvatures of equal sign and absolute value larger than τ. A disadvantage of this construction is that it is not able to force the deformation to correctly match curvature directions on the hypersurface with the same absolute value of the principal curvatures but with different signs. That is, locally a saddle point of the hypersurface may be mistaken for an elliptical point. However, this effect is usually compensated globally, and in applications the ansatz performs well, in particular in matching regions of edges and creases (see Sect. 6).

Like for the membrane energy (3.1), if Dϕ(x) is ensured to be orientation-preserving (detDϕ>0) and n1·(n2ϕ)>0 (cf. Fig. 2), the curvature matching condition is equivalent to

Λ(C(S1ext(x)),C(S2ext(ϕ(x))),Dϕ(x))SO(n).

Based on these considerations, a suitable choice for the bending energy is

Ebend[ϕ]=δ3Ωησ(d1(x))W(ΛC(S1ext(x)),C(S2ext(ϕ(x))),Dϕ(x))dx, 3.5

where W can be chosen as the same polyconvex density already used for Emem.

Mismatch Penalty and Volumetric Regularization Energies

So far, we have defined tangential membrane and bending energies which quantify the appropriateness of deformations ϕ:ΩRn in a narrow band around the hypersurface M1. In the derivation of these energies, we assumed the constraint ϕ(M1)=M2. However, such a constraint would be very hard to enforce numerically. Thus, we use a weaker mismatch penalty instead:

Ematch[ϕ]=1νΩ(ησd1)|d2ϕ-d1|2dx, 3.6

where 1/ν is a penalization parameter.

Moreover, we aim for a regular deformation on the whole computational domain Ω which is globally injective. This, in particular, prevents from self-intersections of the deformed hypersurface ϕ(M1). To achieve this, we introduce the following volume regularization term based on a polyconvex density W^ that enforces orientation preservation

Evol[ϕ]=ΩW^(Dϕ,CofDϕ,detDϕ)dxifdetDϕ(x)>0for a.e.x,+otherwise, 3.7

where

W^(Dϕ,CofDϕ,detDϕ)=αp|Dϕ|p+βq|CofDϕ|q+γs(detDϕ)-s, 3.8

with p>n, q>n, s>(n-1)q/(q-n), and with αp,βq,γs>0 ensuring that the density W^ attains a local minimum when DϕTDϕ=1. As mentioned in the introduction, such an energy is weakly lower semicontinuous in W1,p(Ω;Rn) when restricted to deformations whose Jacobian determinant is positive almost everywhere, and this condition is closed under weak convergence.

Choosing p=q=n+1, s=n2 and using that because of its symmetries W^ can be expressed in terms of singular values [20, Proposition 5.31], elementary but lengthy computations yield the stationarity condition at 1

(n+1)nn-12(αp+(n-1)βq)=n2γs,

and that the corresponding Hessian is positive definite. For n=3 an adequate example is then p=q=4, s=9, αp=1,βq=1, and γs=4. For n=2, one can use p=q=3, s=4, αp=βq=2 and γs=32. Notice that in this case, |Dϕ|=|CofDϕ|.

Total Energy

Summing the above terms, our energy for shape-aware level set matching reads

Eν[ϕ]=Ematch[ϕ]+Emem[ϕ]+Ebend[ϕ]+Evol[ϕ], 3.9

where the different terms depend on the fixed input geometries M1 and M2 through d1 and d2.

Existence of Optimal Matching Deformations

First, we prove the following weak continuity lemma, which is a generalization of the classical result given in [50, Theorem 4.1]. Here, the coefficients may depend on the deformed configuration.

Lemma 4.1

Let ϕkϕW1,p(Ω;Rn) and p>n. Moreover, let ViC0(Ω¯×Rn;Sn-1), i=1,2 and we denote

vik(·):=Vi(·,ϕk(·))andvi:=Vi(·,ϕ(·)),i=1,2.

Then

graphic file with name 10208_2017_9357_Equ18_HTML.gif 4.1

Moreover, for every symmetric positive definite Mi, i=1,2 with M1-12C0(Ω¯×Rn;Rn×n) and M212C0(Ω¯×Rn;Rn×n) and the corresponding compositions

Mik(·):=Mi(·,ϕk(·))andM¯i:=Mi(·,ϕ(·))

we have

graphic file with name 10208_2017_9357_Equ19_HTML.gif 4.2

Proof

To prove (4.1) let ζLpp-n(Ω). We show that

Ik:=Ωζdet(P(v2k)DϕkP(v1k)+v2kv1k)dxI:=Ωζdet(P(v2)DϕP(v1)+v2v1)dx.

Moreover, we denote

I¯k:=Ωζdet(P(v2)DϕkP(v1)+v2v1)dx.

Using the inequality (cf. [27, Theorem 4.7])

|detA-detB|C|A-B|max(|A|,|B|)n-1

and Hölder’s inequality it follows that

Ik-I¯kCΩ|ζ|P(v2k)DϕkP(v1k)-P(v2)DϕkP(v1)+v2kv1k-v2v1·max(|P(v2k)DϕkP(v1k)+v2kv1k|,|P(v2)DϕkP(v1)+v2v1|)n-1dxCζLpp-n|Dϕk|n-1+1Lpn-1·P(v2k)DϕkP(v1k)-P(v2)DϕkP(v1)+v2kv1k-v2v1LpCζLpp-n(DϕkLpn-1+1)·[DϕkLp(P(v2k)LP(v1k)-P(v1)L+P(v1)LP(v2k)-P(v2)L)+(v1k-v1L+v2k-v2L)].

Here, we have used that

|P(v2)DϕkP(v1)+v2v1|n-1(|Dϕk|+1)n-1C(|Dϕk|n-1+1).

By the Rellich–Kondrakov embedding theorem ([1], Theorem 6.3 III), there exist subsequences of vik, i=1,2, which for simplicity of notation are again denoted by vik, i=1,2, that converge uniformly to vi, i=1,2, respectively. Taking into account the Lipschitz continuity estimate

|P(e)-P(f)|=|(e-f)e+f(e-f)|2n|e-f|

and that vikvi, i=1,2 in L we obtain |Ik-I¯k|0 for k.

Next, we replace vi, i=1,2 in I¯k by a piecewise constant approximation on a grid superimposed to the computational domain Ω. Explicitly, we consider the finitely many nonempty intersection ωδz=δ(z+[0,1]n)Ω of cubical cells with Ω for zZn and define

I¯δk:=zZnωδzζdet(P(v2(zδ))DϕkP(v1(zδ))+v2(zδ)v1(zδ))dx,

where zδ is any point in Ω¯ωδz if this set is nonempty. Using analogous estimates as above, we obtain

I¯δk-I¯kCζLpp-n(DϕkLpn-1+1)·[DϕkLp(P(v2,δ)LP(v1,δ)-P(v1)L+P(v1)LP(v2,δ)-P(v2)L)+(v2,δ-v2L+v1,δ-v1L)],

where v1,δ and v2,δ are piecewise constant functions in L with v1,δ|ωδz=v1(zδ) and v2,δ|ωδz=v2(zδ), respectively.

Using the uniform continuity of v2 and v1 on Ω¯, we obtain that I¯δk-I¯kβ(δ) for a monotonically increasing continuous function β:R0+R with β(0)=0. In particular, the convergence is uniform with respect to k. The same argument applies for the difference of I and

I¯δ:=zZnωδzζdet(P(v2(zδ))DϕP(v1(zδ))+v2(zδ)v1(zδ))dx

and we get I¯δ-I<Cβ(δ). Using (2.3) it follows that

Q(v2(zδ))T(P(v2(zδ))AP(v1(zδ))+v2(zδ)v1(zδ))Q(v1(zδ))=A~001.

Thus det(P(v2(zδ))AP(v1(zδ))+v2(zδ)v1(zδ))=det(A~) represents an (n-1)×(n-1) minor of the linear mapping corresponding to the matrix A with respect to different orthogonal basis in preimage space (associated with P(v1(zδ)) and v1(zδ)) and the image space (associated with P(v2(zδ)) and v2(zδ)). Indeed, denoting Qi:=Q(vi(zδ)) we have

ωδzζ(x)det(P(v2(zδ))Dϕk(x)P(v1(zδ))+v2(zδ)v1(zδ))dx=ωδzζ(x)det(Q2T(P(v2(zδ))Dϕk(x)P(v1(zδ))+v2(zδ)v1(zδ))Q1)dx=ωδzζ(x)det(Q2TP(v2(zδ))Q2Q2TDϕk(x)Q1Q1TP(v1(zδ))Q1+enen)dx=ωδzζ(x)det(P(en)Q2TDϕk(x)Q1P(en)+enen)dx=Q1Tωδzζ(Q1y)det(P(en)D(Q2TϕkQ1)(y)P(en)+enen)dy=Q1Tωδzζ(Q1y)Cofnn(D(Q2TϕkQ1)(y))dy,

where we have used the orthogonal change of variables y=Q1Tx and Cofnn denotes the minor obtained by erasing the last column and the last row. This change of orthogonal coordinates is fixed on each cell ωδz. Since for each δ the domain Ω is covered by finitely many cells ωδz, using the above computation and standard weak continuity results [20, Theorem 8.20] for determinants of minors of the Jacobian we obtain that I¯δkI¯δ for k. Finally, for given ϵ we first choose δ small enough to ensure that I¯δ-I+I¯δk-I¯kϵ2. Then, we choose k large enough to ensure that Ik-I¯k+I¯δk-I¯δϵ2. This proves that a subsequence of Ik converges to I for k. Since the limit does not depend on the subsequence, we finally obtain weak convergence for the whole sequence.

To prove (4.2), consider the three sequences of matrix functions

P(v2k)(M2k)12P(v2k)+v2kv2k,P(v2k)DϕkP(v1k)+v2kv1k,and P(v1k)(M1k)-12P(v1k)+v1kv1k. 4.3

The determinant of the second expression above converges weakly as k by the first part of the lemma, while the determinants of the first and third can be assumed to converge uniformly. Moreover, the matrices in (4.3) have the block structure shown in (2.3), so multiplying the three together and taking into account that P is a projection (depending on the argument) recovers the matrix

P(v2k)(M2k)12P(v2k)DϕkP(v1k)(M1k)-12P(v1k)+v2kv1k

appearing in the statement. Multiplicativity of the determinant and the fact that a product of strongly converging and one weakly converging sequence converges weakly then finishes the proof.

We are now in a position to prove existence of a minimizing deformation for the hypersurface matching energy E in a suitable set of admissible deformations. Of particular difficulty is that derivatives of d2 are not defined in the whole of Ω and that in the functional these derivatives are evaluated at deformed positions. We handle this by ensuring that the involved deformations are such that terms involving these derivatives are not evaluated near the singularities. We obtain the following theorem:

Theorem 4.2

(Existence of minimizing deformations) Let M1,M2 be C2,1 compact embedded hypersurfaces in Rn such that a C1 diffeomorphism φ:M1M2 exists between them.

Assume further that

0<σ<min(dist(M1,singd1),dist(M2,singd2)), 4.4

where singdi is the set of points where di is not differentiable, and that C:Rn×nSPD(n) is continuous. Then there exists a constant 0<ν0:=ν0(Ω,M1,M2,σ,p,αp) such that for 0<νν0, the functional Eν has at least one minimizer ϕ among deformations in the space W01,p(Ω;Rn)+id. Moreover, ϕ is a homeomorphism of Ω into Ω, and ϕ-1W1,θ(Ω;Rn), where θ is given by θ=q(1+s)/(q+s).

Proof

We proceed in several steps.

Step 1 Coercivity First, we point out the coercivity enjoyed by our functional. Using the Poincaré and Morrey inequalities ([41], Theorem 12.30 and 11.34), and the Dirichlet boundary conditions we have

ϕC0,α(Ω)CϕW1,p(Ω)C(1+DϕLp(Ω))C(1+Eν[ϕ]1p), 4.5

for any ϕW01,p(Ω)+id and α=1-n/p.

Step 2 Lower semicontinuity along sequences of constrained deformations For the remainder of the proof, a deformation ϕW01,p(Ω;Rn)+id, p>n is termed ρ-admissible for ρ>0, if

  • Evol[ϕ]<+,

  • detDϕ(x)>0 for a.e. xΩ, and

  • for all xsupp(ησd1) and every ysing(d2), we have ϕ(x)-yρ.

Notice that since p>n, ϕ has a unique continuous representative, so the third property is well defined.

First, notice that with the assumption (4.4) we have

supp(ησdi)={|di|σ}Ω\sing(di)¯,i=1,2. 4.6

Let ϕk be a sequence of ρ-admissible deformations with Evol[ϕk]C. By (4.5) and using the Banach–Alaoglu and Rellich–Kondrakov theorems, a subsequence (again denoted by (ϕk)) converges to a deformation ϕ, both in the W1,p-weak and uniform topologies.

Now, we have ([20, Theorem 8.20])

(detDϕk,CofDϕk)(detDϕ,CofDϕ)inLpn(Ω)×Lpn-1(Ω)n2. 4.7

Additionally, since (4.7) holds and because Eν[ϕk] is bounded, Ω(detDϕk)-sdx is bounded by the definition of W^ and detDϕk0 a.e. Together with (4.7), we have

detDϕ(x)>0a.e., 4.8

so that ϕ is again ρ-admissible.

Notice also that by a.e. positivity of the determinants, (4.7) and a standard lower semicontinuity result for convex integrands (see, e.g., [20, Theorem 3.23]) implies

Evol[ϕ]lim infkEvol[ϕk],

and uniform convergence of ϕk immediately leads to

Ematch[ϕ]=limkEmatch[ϕk].

We claim that under the assumptions of this theorem, we also have that

Ememϕlim infkEmem[ϕk] 4.9

and

Ebendϕlim infkEbend[ϕk]. 4.10

To see this, notice that ϕk,ϕ being ρ-admissible ensures that the normal vectors satisfy

n1,n2ϕk,n2ϕC0({|d1|σ};Rn).

Consequently, the first part of Lemma 4.1 (with Vi=ni) implies

χ{|d1|σ}(Dtgϕk,det(Dtgϕk+(n2ϕk)n1))χ{|d1|σ}(Dtgϕ,det(Dtgϕ+(n2ϕ)n1))inLp(Ω)n2×Lpn(Ω), 4.11

with χ{|d1|σ} denoting the indicator function. Combining (4.11) with the polyconvexity of W, defining the function Emem, both introduced in (3.1) we find the assertion (4.9).

Furthermore, by our assumptions on Mi (see Sect. 2), we have that

χ{|di|σ}Si=χ{|di|σ}D2diC0(Ω¯;Rn×n).

Since C produces uniformly positive matrices, we have χ{|d1|σ}(C(S1ext))-1C0(Ω¯;Rn×n). We can then use a continuity result for square roots of nonnegative definite matrix-valued functions defined on Ω [15, Theorem 1.1] to see that

χ{|d1|σ}(C(S1ext))-12C0(Ω¯;Rn×n),χ{|d1|σ}(C(S2ext)ϕk)12C0(Ω¯;Rn×n),χ{|d1|σ}(C(S2ext)ϕ)12C0(Ω¯;Rn×n).

The second part of Lemma 4.1 implies the weak convergence

graphic file with name 10208_2017_9357_Equ100_HTML.gif

from which (4.10) follows by using the polyconvexity of W.

Step 3 Existence of minimizers restricted to admissible deformations Since we have already seen that the set of ρ-admissible deformations is weakly closed and weakly compact, and that every term of E is weakly lower semicontinuous on this set, we just need to check that for all fixed ν>0, the set of ρ-admissible deformations, with adequate ρ, is not empty.

For some given σ satisfying dist(M2,singd2)-σ>0 let ρ satisfy

0<ρ<dist(M2,singd2)-σ. 4.12

We construct a deformation φ^, which is ρ-admissible and satisfies Eν[φ^]<. By assumption, there exists a diffeomorphism φ:M1M2. Thus, we construct an extension of this diffeomorphism to {|d1|σ} along the normal directions using

φ^(x+sn1(x)):=φ(x)+sn2(φ(x)),forxM1,-σsσ. 4.13

We can then extend φ^ to the inside and outside components Ωi,Ωo of Ω\{|d1|σ} by solving the minimization problems for Evol with Dirichlet boundary conditions given by (4.13) on Ωi and Ωo\Ω, and by φ^(x)=x on Ω. For the resulting φ^, we have

Ematch[φ^]=0,Evol[φ^]<,Emem[φ^]<,Ebend[φ^]<,

where the first two statements follow by construction, and the last two by virtue of φ being a diffeomorphism and the choice of σ. Moreover, we note that since φ^ has finite energy and the growth conditions assumed for W^ [see (3.7)], the condition detDφ^(x)>0 for a.e. x is also satisfied [4].

Step 4 A priori estimate to remove the constraint Next, we show that for any ρ satisfying (4.12) there exists a parameter ν0>0 such that for all 0<ν<ν0 the constrained minimizers of Eν subject to (4.4) solves the unconstrained optimization problem, consisting in minimizing Eν on W01,p+id.

To this end, we verify that every ϕ that satisfies

Eν[ϕ]Eν[φ^] 4.14

is ρ-admissible. It is immediate from (4.14) that Evol(ϕ)<+, and from the definition of W^ in (3.7) it follows with the same arguments as in (4.8) that detϕ>0 a.e.

We prove now that for all deformations ϕ satisfying (4.14) also satisfy

d2ϕL({|d1|σ})dist(M2,singd2)-ρ. 4.15

This is sufficient because from (4.15) it follows for all x satisfying |d1(x)|σ by the triangle inequality that

ρdist(M2,singd2)-d2ϕL({|d1|σ})=dist(M2,singd2)-dist(ϕ(x),M2)dist(ϕ(x),singd2),

which is the third property of a ρ-admissible deformation ϕ.

To prove (4.15), we use the triangle inequality and estimate

d2ϕL({|d1|σ})σ+d2ϕ-d1L({|d1|σ}). 4.16

By the monotonicity of ησ and the fact that the signed distance functions di are Lipschitz continuous with constant 1 we have, for each σ^(0,σ) that

d2ϕ-d1L({|d1|σ})1+ϕC0,α({σ-σ^|d1|σ})σ^α+ησd1(d2ϕ-d1)L({|d1|<σ-σ^})ησ(σ-σ^). 4.17

Estimates (4.5) and (4.14) imply in turn

ϕC0,α({σ-σ^|d1|σ})CϕW1,p(Ω)C(1+Eν[φ^]1p). 4.18

Finally, combining (4.16), (4.17), and (4.18) we obtain

d2ϕL({|d1|σ})σ+1+C(1+Eν[φ^]1p)σ^α+1ησ(σ-σ^)ησd1(d2ϕ-d1)L({|d1|<σ-σ^}). 4.19

Now we can apply Ehrling’s lemma [54, Theorem 7.30] for the embeddings W1,p(Ω)L(Ω)L2(Ω) to control the last term in (4.19). Taking into account, the Poincaré inequality and Dirichlet boundary conditions, we obtain for any ϵ>0 a constant C(ϵ)>0 such that

ησd1(d2ϕ-d1)L({|d1|<σ-σ^})ησd1(d2ϕ-d1)L(Ω)C(ϵ)ησd1(d2ϕ-d1)L2(Ω)+ϵC(ησd1(d2ϕ-d1))Lp(Ω)+1. 4.20

Now, for the first term in the right-hand side of (4.20) we can estimate

ησd1(d2ϕ-d1)L2(Ω)=ν12Ematch[ϕ]12ν12Eν[φ^]12. 4.21

For the second term, denoting diamΩ=supx,yΩ|x-y|,

(ησd1(d2ϕ-d1))Lp(Ω)(ησd1)(d2ϕ-d1)Lp(Ω)+(ησd1)(d2ϕ-d1)Lp(Ω)+1Cν1pd2ϕ-d1L(Ω)p-2pEmatch[ϕ]1p+C(DϕLp(Ω)+d1Lp(Ω)+1)Cν1p(ϕC0,α(Ω)+2diamΩ)p-2pEν[φ^]1p+CEν[φ^]1p+1Cν1p(1+Eν[φ^]1p)p-2pEν[φ^]1p+CEν[φ^]1p+1, 4.22

where we have applied the product rule, the definition of Ematch, ησC0, ησC, that |di|=1 a.e., i=1,2, the chain rule, and (4.14). The use of the chain rule is justified by [46, Theorem 2.2], since d2 has Lipschitz constant 1.

Together, (4.20), (4.21), and (4.22) imply

ησd1(d2ϕ-d1)L({|d1|<σ-σ^})ν1pC(ϵ)ν12-1pEν[φ^]12+ϵC(1+Eν[φ^]1p)p-2pEν[φ^]1p+ϵCEν[φ^]1p+1. 4.23

In light of (4.19) and (4.23), and since Eν[φ^] is independent of ν, we can now choose first σ^, then ϵ and finally ν small enough to obtain

d2ϕL({|d1|σ})σ+(dist(M2,singd2)-σ-ρ)dist(M2,singd2)-ρ.

Step 5 Injectivity The injectivity and regularity of the inverse follow by the growth conditions satisfied by Evol and classical results of Ball [4, Theorems 2 and 3]. Note that Theorem 3 in [4] is stated in the mechanical application context in dimension n=3, but it holds also in Rn following the same proof and using the condition s>(n-1)q/(q-n).

We have particularized the statement of Theorem 4.2 to the case of Dirichlet boundary conditions to ensure global invertibility. In fact, we also have existence of minimizing deformations for the case of Neumann boundary conditions.

Corollary 4.3

(Natural boundary conditions) Under the assumptions of Theorem 4.2, there exists a constant

0<νN=νN(Ω,M1,M2,σ,p,αp)

such that for 0<ννN, the functional Eν possesses at least one minimizer among deformations in the space W1,p(Ω;Rn).

Proof

The proof follows the same arguments used for Theorem 4.2, so we only point out the necessary modifications. We need a replacement for the coercivity estimate (4.5) and claim

ϕW1,p(Ω)C(1+ν12Ematch[ϕ]12+DϕLp(Ω))C(1+ν12Eν[ϕ]12+Eν[ϕ]1p). 4.24

To verify this let us consider ω:={|d1|σ/2}. An adequate Poincaré inequality (see, e.g., [41, Theorem 12.23]) implies that

ϕW1,p(Ω)CDϕLp(Ω)+ωϕdx,

and we estimate the second term in the right-hand side by

ωϕdxω|ϕ|dxω|d2ϕ|dx+|ω|supxM2|x|ω|d2ϕ-d1|dx+ω|d1|dx+|ω|supxM2|x|ησσ2-1|ω|-12νEmatch[ϕ]12+ω|d1|dx+|ω|supxM2|x|,

where Hölder’s inequality has been used to compare L1 and L2 norms. Therefore, (4.24) follows.

The proof of the estimate for d2ϕL({|d1|σ}) (to ensure that deformations stay away from the singularities of d2) is still valid with minor modifications, since ν appears in (4.24) multiplicatively.

We conclude this section with the following proposition, which explores the penalization limit in which the parameter ν tends to zero.

Proposition 4.4

Let {νk}kN, be a sequence of penalty matching parameters such that νk0 as k, and ϕk be solutions of the Dirichlet minimization problem for Eνk. Then, up to a choice of subsequence, the ϕk converge strongly in W1,p to a minimizer of

Emem+Ebend+Evol

in W01,p(Ω;Rn)+1 under the constraint ϕ(M1c)=M2c for all c(-σ,σ).

Proof

First, notice that the energy E may be written as

Eν[ϕ]=1νΩησd1|d2ϕ-d1|2+αp|Dϕ|p+H(detDϕ,CofDϕ,Dtgϕ,det(Dtgϕ+n2ϕn1),Λ(C(S1ext),C(S2extϕ)),Dϕ),det(Λ(C(S1ext),C(S2extϕ)),Dϕ))dx, 4.25

where H:R+×Rn×n×Rn×n×R×Rn×n×RR+ is smooth and convex.

Denote by φ^ the extension of a diffeomorphism between M1 and M2 used in the proof of Theorem 4.2. Since Ematch[φ^]=0, we have that Eνk[ϕk]E1[φ^]. By the coercivity estimate (4.5), the ϕk are then bounded in W1,p and we may extract a (not relabeled) subsequence converging uniformly and weakly in W1,p to some limit ϕ. Since {Eνk[ϕk]} is bounded and νk0, the uniform convergence of ϕk implies that

Ωησ(d1)|d2ϕk-d1|2dxkΩησ(d1)|d2ϕ-d1|2dx=0. 4.26

In consequence, ϕ(M1c)M2c. Since ϕM1c is the uniform limit of the maps ϕkM1c which are surjective onto M2c and M1c is compact, we conclude that ϕ(M1c)=M2c for all c(-σ,σ). Therefore, ϕ is admissible for all νk and Eνk[ϕk]E1[ϕ]. Combined with lower semicontinuity and (4.25), the above implies

Ωαp|Dϕk|p+H(det(Dϕk),)dxkΩαp|Dϕ|p+H(det(Dϕ),)dx. 4.27

From this identity, the fact that H is convex and differentiable, and DϕkDϕ in Lp it follows that

0=lim supk(Ωαp|Dϕk|p-|Dϕ|p+(H(det(Dϕk),)-H(det(Dϕ),))dx)lim supk(Ωαp|Dϕk|p-|Dϕ|p+DH(det(Dϕ),)·(det(Dϕk)-det(Dϕ),)dx)=lim supkΩαp|Dϕk|pdx-Ωαp|Dϕ|pdx.

Together with the weak lower semicontinuity of the Lp-norm, the above shows that

Ωαp|Dϕ|pdx=limkΩαp|Dϕk|pdx.

Because Lp(Ω) has the Radon-Riesz property ([47, 2.5.26]), weak convergence and convergence of the norm guarantee strong convergence. Since ϕk was assumed to converge uniformly, we have also ϕkϕ in Lp, and this shows that ϕkϕ in W1,p(Ω;Rn).

That ϕ is a minimizer of the constrained problem follows directly ([8], Theorem 1.21) from the fact that the Eνk are an equicoercive family of functionals, Γ-converging in the weak topology of W1,p. Indeed, equicoercivity follows easily from the above, while Γ-convergence is implied by the fact that Eνk is an increasing sequence ([8], Remark 1.40), because νk0 appears as a denominator in Ematch.

Remark 4.5

By the coercivity estimate (4.24) of Corollary 4.3, an entirely analogous result holds for minimizers with Neumann boundary conditions.

Remark 4.6

Contrary to what might be expected, the limit problem we have obtained is not a surface problem, since all the level sets are still coupled through the volume energy Evol. The line of reasoning above depends heavily on the fact that the coefficients of the volume term are held fixed, since the equicoercivity and uniform strict quasiconvexity (in the language of [25]) both require the presence of DϕLp(Ω)p in the functional.

Oscillations and Lack of Rank-One Convexity for the Naive Approach

To model the tangential distortion energy we have considered a frame indifferent energy density with the argument Dtgϕ+(n2ϕ)n1. Let us now consider the case n=2 and a simpler version of the membrane energy (3.6), where we use as an argument of the energy density directly the tangential Cauchy–Green strain tensor [cf (2.2)] (D~tgϕ(x))T(D~tgϕ(x))+n1(x)n1(x), and define the membrane energy

E~mem[ϕ]:=Ωησ(d1(x))W(D~tgϕ(x))TD~tgϕ(x)+n1(x)n1(x)dx, 4.28

with D~tgϕ:=DϕP1 defined as the tangential part of the derivative along TxM1d1(x), and W:R2×2R a frame indifferent energy density that has a strict minimum at SO(2). In fact, this energy is no longer lower semicontinuous and we will present counterexamples.

Example 4.7

(Oscillation patterns) We construct an explicit sequence for which lower semicontinuity of the membrane energy E~mem fails. Fix 0<R<1 and M1=S1 with the parametrization ξeiξ. Consider a sequence of deformations φk:S1R2 defined in polar coordinates of (r,θ) by the condition

ξφk(ξ)=Rsinkξer(r(φk(ξ)),θ(φk(ξ)))+1-R2sin2kξ12eθ(r(φk(ξ)),θ(φk(ξ))), 4.29

where er=(cosθ,sinθ)T,eθ=(-sinθ,cosθ)T for given ϕk(0). Note that for any k and θ that |θφk(θ)|=1, so that the transformations are tangentially isometric. We define φk(0) via two integration constants r0 and θ0 for the initialization of r and θ at ξ=0. We set θ0=0 and choose r0 such that the curve φk is closed and simple, which imposes r0=r(φk(0))=r(φk(2π)) since the first term in (4.29) has zero average. From the second term, taking into account that eθ(r,θ) is independent of r, we get the condition

2πr0=02π1-R2sin2kξ12dξ=1k02πk1-R2sin2ζ12dζ,

where we have applied the change of variables ζ=kξ. By periodicity the right-hand side (an incomplete elliptic integral of the second kind with modulus R) is independent of k and thus determines r0. The resulting φk for several values of k are depicted in Fig. 3.

Fig. 3.

Fig. 3

Explicit oscillations for a simplified model. φk for R=0.95, k=6,20,50

We observe that θφk(θ)r0eθinLp, for any 1p< (and also weak-* in L). Therefore, the weak W1,p-limit φ of the φk is the function defined by φ(θ)=r0er and obviously not an isometry. Assuming 0<σ<1 and extending φk,φ along the radial direction er to the annulus {1-σr1+σ}, we obtain corresponding deformations given by

ϕk(r,θ)=φk(θ)+(r-1)Qπ2θφk(θ)andϕ(r,θ)=φ(θ)+(r-1)r0er=rr0er,

where Qπ2 stands for clockwise rotation by π/2, so that Qπ2θφk(θ) is the unit outward normal to φk(S1). Clearly also ϕkϕ in W1,p on the annulus. We observe that E~mem[ϕk]=0, but E~mem[ϕ]>0. Hence, E~mem is not weakly lower semicontinuous.

The celebrated Nash–Kuiper theorem [37, 51] states that it is possible to uniformly approximate any short C immersion by C1 isometric ones. Our explicit oscillations around r0S1 is just one example of this phenomenon. Notice that a bending term of the type Ebend introduced in our model only compares the curvatures of M1d1(x) and M2d2(ϕ(x)). It therefore does not penalize oscillations, since it does not detect the curvature of ϕ(M1) at all.

Example 4.8

(Lack of rank-one convexity) We present an additional example of a configuration for which the integrand of an energy of the type E~mem is not rank-one convex. Rank-one convexity of the complete energy density, i.e., , convexity in tR when composed with the function A+tB for any matrix A and any rank-one matrix B, is known to be a necessary condition for quasiconvexity ([20], Theorem 5.3). Quasiconvexity, in turn, is necessary for weak lower semicontinuity of integral functionals in Sobolev spaces ([20], Theorem 8.1 and Remark 8.2).

Let Ω=(-2,2)2, and M1 be a closed C2 curve such that M1(-1,1)×(0,2)=(-1,1)×1. At any point x0(-1,1)×1, the tangential derivatives are just partial derivatives along the first coordinate, yielding

D~tgϕ(x0)=Dϕ(x0)P(e2)=1ϕ1(x0)01ϕ2(x0)0,andD~tgϕ(x0)TD~tgϕ(x0)=1ϕ1(x0)2+1ϕ2(x0)2000.

Hence, the tangential area distortion measure reduces to

tr(D~tgϕ(x0)TD~tgϕ(x0))=det(D~tgϕ(x0)TD~tgϕ(x0)+e2e2)=1ϕ1(x0)2+1ϕ2(x0)2, 4.30

where e2=(0,1)T. Defining now the convex function

F(a,d)=12a+12d+d-1-2,

which has a unique minimum with value 0 for a=d=1, we have that the energy density

WF(B)=Ftr(BTB),det(BTB+e2e2)

has a pointwise minimum, with value zero, whenever Dϕ is such that 1ϕ12+1ϕ22=1.

Consider now, for 0λ1, the family of matrices

B(λ)=λ0(1-λ)0=λ1000+(1-λ)0010. 4.31

Clearly B(λ) is rank one. But we have WF(B(λ))=λ2+(1-λ)2+1λ2+(1-λ)2-2 and therefore

WF(B(0))=F(B(1))=0,butWF(B(1/2))=12,

which demonstrates that WF is not rank-one convex.

Finite Element Discretization Based on Adaptive Octrees

We adopt a ‘discretize, then optimize’ approach and consider a finite element approximation and optimize for the coefficients of the solution. Since the energy Eν is highly nonlinear and nonconvex, we use a cascadic multilevel minimization scheme in which the solution for one grid level is used as the initial data for the minimization on the next finer grid. We use adaptive refinement of the underlying meshes around the surfaces M1,M2(0,1)n for n=2,3 (Algorithm 1).

One of the main characteristics of our functional is the pervasive presence of coefficients depending on the deformed position ϕ(x). Indeed, this is how the functional takes into account the geometry of target surface, through the projection P2 and shape operator S2. From an implementation perspective, however, this means that frequently discrete functions have to evaluated at deformed positions. Therefore, the ability to efficiently search the index of an element containing a given position is of paramount importance, so a hierarchical data structure that allows for efficient searching is needed. The model only contains first derivatives of the unknown deformation. Hence, multilinear finite elements already allow a conforming discretization. For these reasons we use multilinear FEM on octree grids. The grids used are such that all of the elements are either squares or cubes of side length h=2-, for an integer to which we refer as grid level of the element. In what follows let us detail the different ingredients of the algorithm.graphic file with name 10208_2017_9357_Figa_HTML.jpg

Multilinear Finite Elements on Octrees We assume n=3 for the presentation here. Using an adaptive octree grid based on cubic cells leads to hanging nodes (see Fig. 4), nodes which are on the facet of a cell without being one of its vertices. Enforcing continuity of the finite element functions leads to constraints for function values on hanging nodes and these hanging nodes are not degrees of freedom. Additionally, to minimize the complexity of the required interpolation rules, the subdivision is propagated in such a way that the grid level of neighboring elements sharing a cell facet differs at most by one.

Fig. 4.

Fig. 4

Hierarchical grids corresponding to the dolphin surfaces (different 2D slices in 3D, grid level 8, 178584 DOFs, 1.1% of the amount of DOFs in the full grid case) and leaf contours (2D, level 10)

Octrees and the access to degrees of freedom via hashtables Even though the tree structure gives a natural hierarchical structure to the elements of the mesh, maintaining consistent linear indices for degrees of freedom, hanging nodes, and elements can be delicate. Consistent rules could be devised to maintain consistency with the element octree for a given mesh, but these would not be easy to update when the grid is refined. In order to keep track of vertex indices in a simple manner without sacrificing efficiency, hash maps ([19], Chapter 11) are maintained to keep track of the indices of degrees of freedom, hanging nodes, and cells. The keys used in the hashmap are a combination of a level value and point coordinates as integer multiples of h=2-. These keys uniquely identify nodes or elements, with the convention that an element is identified with its lower-left-back corner. Whenever a query for a node or cell is made, there are two possible outcomes. If it is already contained in the corresponding hash table, a linear index for it can be retrieved. Otherwise, a new entry of the hash table is created and the node or cell is given the next unused index. Since we do not require coarsening of the mesh, this scheme guarantees a consistent linear set of indices with a computational cost for insertions and queries that is, on average, independent of the mesh size.

Computing distance functions on octrees In our model, we have assumed that the distance functions to our surfaces are given. In practice, especially when using adaptive grids, we need to compute signed distance functions on such grids. This has been accomplished by a straightforward adaptation of the Fast Marching Method on cartesian grids [57] exploiting the fact that our grids still are subgrids of a regular cartesian grid. In the implemented variant hanging nodes are not taken into account for the propagation, their values being linearly interpolated to accommodate the constraints needed for conformality. The initialization for the distance computation has been performed starting from triangular meshes of the surfaces (for n=3; for n=2 two-bit segmentation of interior and exterior of the curves has been used). The signs of the distance functions have to be computed separately, by detecting which points of the grid are inside (resp. outside) the initial surface data. In our case, they have been computed with the provably correct algorithm given in [2].

Computation of the coefficients The discretization for the unknown deformation ϕ, as already mentioned, is done by multilinear finite elements. However, the coefficients of our model include first and second derivatives of the signed distance functions di, for the normal vectors ni and shape operators Si (i=1,2), respectively. The approximations are required to be robust, since they appear in the highest order terms of the model. For the normal vectors ni, we compute the L2 projection of the finite element derivative of di to recover the nodal values of a piecewise multilinear function, followed by a orthogonal projection to the unit sphere to restore the constraint |ni|=1.

In the case of the shape operators, our approach is to approximate the distance functions di by a quadratic polynomial supported on a neighborhood of each point. Given a fixed integer neighborhood size r, for each nonhanging node xk (i.e., the neighborhood Br(xk) contains the r closest other degrees of freedom of the adaptive grid) the local quadratic polynomial pk is defined as the one minimizing the least-squares error

xjBr(xk)pk(xj)-di(xj)2.

which can be easily computed by inverting a small matrix. The Hessian of di at the node xk is then approximated by the Hessian of pk.

For the computation of matrix square roots and their inverses, we have used the method described in [26], taking appropriate care to truncate almost-singular matrices, since the resulting square roots also appear inverted.

Minimization strategy For the minimization at each level, we have opted for a Fletcher-Reeves nonlinear conjugate gradient method ([52], Section 5.2). The L2 gradient of Eν, whose computation is involved but elementary, was implemented directly. The parameter α is progressively reduced when a further feasible descent step is not found, according to an Armijo line search ([52], Section 3.1).

Numerical Results

All of our results have been computed on the unit cube Ω=[0,1]3 for the matching of surfaces in 3D, and the unit square [0,1]2 for the matching of contour curves in 2D. In practice, we have used homogeneous Neumann boundary conditions, since this allows to have relatively large shapes Mi in comparison with the size of the domain Ω without creating excessive volume energies near the boundary (for the justification we refer to Corollary 4.3). However, if the boundary is not fixed, the deformed domain ϕ(Ω) is not necessarily contained in Ω, so evaluation of coefficients on deformed positions has to be appropriately handled numerically. We use a projection of outside position onto the boundary of Ω for sufficient large dist(M2,Ω).

For the membrane and the bending energy we use the material parameters λ=μ=1, corresponding to the density

W(A)=12|A|2+14(detA)2+32e-(detA-1)-134.

In the bending term, the shape operators have been regularized through the truncated absolute value function with τ=1. Since we work on the unit cube, this corresponds to a comparatively large curvature radius. For the volume term, given that enforcing orientation preservation in a finite element framework is a far from straightforward, it is advantageous to work with the simplified version

cvolΩW(Dϕ)dx.

We have run the minimization scheme of Algorithm 1 beginning from a uniform grid of level min=2 or min=3 with 93=729 nodes, and refined up to max=8 for 3D examples. For 2D cases, a reasonable range turned out to be min=4,max=10. The finest grids used for two of the examples below are depicted in Fig. 4. The width of the narrow band was chosen proportional the finest resolution of the mesh (σ=2h) since a small value of σ clearly produces inaccurate results when ησ is evaluated on coarse grids. However, the constraint Ωησ=1 ensures that the overall strength of the surface terms Ematch, Emem and Ebend is not affected. The value of the penalty constraint ν was divided by 10 for each grid refinement, which is justified by Proposition 4.4. Furthermore, the volume weight cvol was also halved per level to allow for simultaneously higher initial regularization and close final matches. Note that this reduction is much slower than that of the matching parameter.

In all examples, we have used the identity as the initial deformation. It should be noted that although the energy is geometric by design, we are using a first-order descent method for its minimization. In consequence, an adequate rigid pre-alignment can be beneficial for intricate shapes. Figure 8 shows results for the matching of two different dolphin shapes. Our variational approach is highly nonlinear and nonconvex. Thus, the numerical approximation of the globally optimal deformation depends on the initialization of the deformation. Figure 9 shows that the identity deformation as the initial deformation is advisable only if the expected optimal deformation is not too large. This is demonstrated by applying different rigid body motions to M1.

Fig. 8.

Fig. 8

From left to right: Textured dolphin M1, M2, resulting deformed shape ϕ(M1) after level 8 in the minimization scheme, comparison of target and obtained shapes after the computation on grid level 4 and 8, respectively. The corresponding final grid is depicted in Fig. 4

Fig. 9.

Fig. 9

From left to right: Initial shape of Fig. 8 after undergoing a rotation of π/6, deformed shape after level 8 in the minimization (correct matching), after a rotation of π, and corresponding result (incorrect matching). Moderate changes in the initial alignment are handled correctly, while drastic ones are not

All figures have been produced by deforming the input data (polygonal curve or triangulated surface) via the resulting deformation ϕ. This is in contrast to deforming the grid and plotting the resulting extracted level sets (which effectively visualizes the inverse deformation), as commonly done in the registration literature, and also in [32].

Test case First, we present a simple test case to underline the qualitative properties of our model. Figure 5 shows a configuration in which a high amount of compression, combined with rotation, is required. Our model finds the intuitively correct deformation, but oscillations typical for the lack of lower semicontinuity of the underlying energy are induced when P2 is not used in the membrane and bending terms. The bending term assists in matching the curvatures even if the deformation is not rigid. Note, however, that for the optimal match the curvature energy Ebend is not expected to vanish, as can easily be seen from (2.6), (3.4) and the related discussion in Sect. 3.

Fig. 5.

Fig. 5

Behavior of the optimal (numerical) deformation in the presence of strong compression. From left to right: Textured M1, M2, resulting deformed shape ϕ(M1) after grid level 7 with our model, and corresponding result after grid level 4 when P2 is not present in Emem

Shape matching applications We now turn our attention to high-resolution examples with real data. Figure 6 demonstrates the effect of the multilevel descent scheme, in which details are added progressively to avoid spurious local minima. In Fig. 11, a high-resolution 2D example is presented. Figures 7, 8, 9 and 10 show 3D examples in which the influence of the curvature matching is indispensable to obtain shape sensitive matching deformations. For these examples, the shell parameter δ was chosen quite high, since the curvature matching term Ebend is a major driving force to obtain correct matching of geometric features. Table 1 lists the parameter values used, and run times for our implementation. We have split the timings between the highest resolution level and the combined previous ones, since in many applications a very high level of detail might not be necessary, thereby significantly reducing the required computational effort.

Fig. 6.

Fig. 6

Detail is added progressively in the cascadic coarse-to-fine scheme. From left to right: Textured M1, M2, resulting deformed shape ϕ(M1) after the computation on grid level 4, 6 and 8, respectively

Fig. 11.

Fig. 11

2D example. From left to right: Colored leaf contours M1, M2, resulting deformed leaf shape ϕ(M1) after the computation on grid level 10 and corresponding deformed grid. The corresponding undeformed grid is depicted in Fig. 4

Fig. 7.

Fig. 7

From left to right: Textured hand shape M1, resulting deformed shape ϕ(M1) after level 8 in the minimization scheme, comparison of target and obtained shapes after the computation on grid level 4 and 8, respectively

Fig. 10.

Fig. 10

From left to right: Textured sugar beet shape M1, resulting deformed shape ϕ(M1) after level 8 in the minimization scheme, comparison of target sugar beet shape and obtained shapes after the computation on grid level 4 and 8, respectively

Table 1.

Parameters and running times on a workstation with a single Intel Xeon E5-1650 CPU (6 cores, 3.2 Ghz)

Figs. min,max δ cvol,ν at min Time, (max-1) Time, =max DOFs at max (K)
6 3, 8 0.5 0.025, 0.002 1 h 04 min 4 h 34 min 695
7 2, 8 0.71 0.05, 0.1 30 min 10 s 1 h 27 min 313
8 3, 8 1 0.025, 0.002 20 min 04 s 50 min 50 s 179
10 3, 8 0.5 0.025, 0.002 28 min 56 s 1 h 25 min 408

Our implementation splits the computation of the different terms of the energy and the corresponding derivatives in different threads (obtaining a speedup factor 2), but no further parallelization is used

Acknowledgements

Open access funding provided by University of Vienna. This research was supported by the Austrian Science Fund (FWF) through the National Research Network ‘Geometry+Simulation’ (NFN S117) and Doctoral Program ‘Dissipation and Dispersion in Nonlinear PDEs’ (W1245). Furthermore, the authors acknowledge support of the Hausdorff Center for Mathematics at the University of Bonn. We would like to thank the anonymous reviewers for comments that have led to substantial improvements in this paper. The shapes for Fig. 8 are originally from the McGill 3D Shape Benchmark [58]. The scanned faces of Fig. 6 are part of the 3D Basel Face Model dataset [53]. The laser-scanned sugar beets of Fig. 10 and the original shapes for Fig. 7 were kindly provided by Behrend Heeren.

Contributor Information

José A. Iglesias, Email: jose.iglesias@univie.ac.at

Martin Rumpf, Email: martin.rumpf@uni-bonn.de.

Otmar Scherzer, Email: otmar.scherzer@univie.ac.at.

References

  • 1.R. A. Adams and J. J. F. Fournier, Sobolev spaces, vol. 140 of Pure and Applied Mathematics (Amsterdam), Elsevier/Academic Press, Amsterdam, second ed., 2003.
  • 2.Baerentzen JA, Aanaes H. Signed distance computation using the angle weighted pseudonormal. IEEE Trans. Vis. Comput. Graphics. 2005;11:243–253. doi: 10.1109/TVCG.2005.49. [DOI] [PubMed] [Google Scholar]
  • 3.Ball JM. Convexity conditions and existence theorems in nonlinear elasticity. Arch. Ration. Mech. Anal. 1977;63:337–403. doi: 10.1007/BF00279992. [DOI] [Google Scholar]
  • 4.Ball JM. Global invertibility of Sobolev functions and the interpenetration of matter. Proc. Roy. Soc. Edinburgh Sect. A. 1981;88:315–328. doi: 10.1017/S030821050002014X. [DOI] [Google Scholar]
  • 5.Bonito A, Nochetto RH, Pauletti MS. Parametric FEM for geometric biomembranes. J. Comput. Phys. 2010;229:3171–3188. doi: 10.1016/j.jcp.2009.12.036. [DOI] [Google Scholar]
  • 6.M. Botsch, M. Pauly, M. Gross, and L. Kobbelt, PriMo: Coupled prisms for intuitive surface modeling, in Proceedings of the Fourth Eurographics Symposium on Geometry Processing, Eurographics Association, 2006, pp. 11–20.
  • 7.Botsch M, Sorkine O. On linear variational surface deformation methods. IEEE Trans. Vis. Comput. Graph. 2008;14:213–230. doi: 10.1109/TVCG.2007.1054. [DOI] [PubMed] [Google Scholar]
  • 8.A. Braides, Γ-convergence for beginners, vol. 22 of Oxford Lecture Series in Mathematics and its Applications, Oxford University Press, Oxford, 2002.
  • 9.Bredies K, Pock T, Wirth B. Convex relaxation of a class of vertex penalizing functionals. J. Math. Imaging Vis. 2013;47:278–302. doi: 10.1007/s10851-012-0347-x. [DOI] [Google Scholar]
  • 10.Bredies K, Pock T, Wirth B. A convex, lower semicontinuous approximation of Euler’s elastica energy. SIAM J. Math. Anal. 2015;47:566–613. doi: 10.1137/130939493. [DOI] [Google Scholar]
  • 11.A. Bronstein, M. Bronstein, and R. Kimmel, Numerical Geometry of Non-Rigid Shapes, Monographs in Computer Science, Springer, 2008.
  • 12.Burger M, Modersitzki J, Ruthotto L. A hyperelastic regularization energy for image registration. SIAM J. Sci. Comput. 2013;35:B132–B148. doi: 10.1137/110835955. [DOI] [Google Scholar]
  • 13.Chao I, Pinkall U, Sanan P, Schröder P. A simple geometric model for elastic deformations. ACM Trans. Graph. 2010;29:38:1–38:6. doi: 10.1145/1778765.1778775. [DOI] [Google Scholar]
  • 14.Charpiat G, Faugeras O, Keriven R. Approximations of shape metrics and application to shape warping and empirical shape statistics. Found. Comp. Math. 2004;5:1–58. doi: 10.1007/s10208-003-0094-x. [DOI] [Google Scholar]
  • 15.Z. Chen and Z. Huan, On the continuity of the m-th root of a continuous nonnegative definite matrix-valued function, J. Math. Anal. Appl., 209 (1997), pp. 60–66.
  • 16.Ciarlet P, Geymonat G. Sur les lois de comportement en lasticit non linaire compressible. CR Acad. Sci. Paris Sr. 1982;II(295):423–426. [Google Scholar]
  • 17.P. G. Ciarlet, Mathematical elasticity, volume I: Three-dimensional elasticity, North-Holland, Amsterdam, 1988.
  • 18.P. G. Ciarlet, Mathematical elasticity, volume III: Theory of shells, North-Holland, Amsterdam, 2000.
  • 19.T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd Edition, The MIT Press, 3rd ed., 2009.
  • 20.B. Dacorogna, Direct methods in the calculus of variations, vol. 78 of Applied Mathematical Sciences, Springer, New York, second ed., 2008.
  • 21.Delfour MC, Zolésio J-P. Shape analysis via oriented distance functions. J. Funct. Anal. 1994;123:129–201. doi: 10.1006/jfan.1994.1086. [DOI] [Google Scholar]
  • 22.Delfour MC, Zolésio J-P. A boundary differential equation for thin shells. J. Differential Equations. 1995;119:426–449. doi: 10.1006/jdeq.1995.1097. [DOI] [Google Scholar]
  • 23.M. C. Delfour and J.-P. Zolésio, Shapes and geometries, vol. 22 of Advances in Design and Control, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, second ed., 2011.
  • 24.Elad A, Kimmel R. On bending invariant signatures for surfaces. IEEE Trans. Pattern Anal. Mach. Intell. 2003;25:1285–1295. doi: 10.1109/TPAMI.2003.1233902. [DOI] [Google Scholar]
  • 25.Evans LC, Gariepy RF. Some remarks concerning quasiconvexity and strong convergence. Proc. Roy. Soc. Edinburgh Sect. A. 1987;106:53–61. doi: 10.1017/S0308210500018199. [DOI] [Google Scholar]
  • 26.Franca LP. An algorithm to compute the square root of a 3×3 positive definite matrix. Comput. Math. Appl. 1989;18:459–466. doi: 10.1016/0898-1221(89)90240-X. [DOI] [Google Scholar]
  • 27.S. Friedland, Variation of tensor powers and spectra, Linear and Multilinear Algebra, 12 (1982/83), pp. 81–98.
  • 28.Friesecke G, James RD, Mora MG, Müller S. Derivation of nonlinear bending theory for shells from three-dimensional nonlinear elasticity by Gamma-convergence. C.R.A.S. Ser. I: Math. 2003;336:697–702. [Google Scholar]
  • 29.Fuchs M, Jüttler B, Scherzer O, Yang H. Shape metrics based on elastic deformations. J. Math. Imaging Vis. 2009;35:86–102. doi: 10.1007/s10851-009-0156-z. [DOI] [Google Scholar]
  • 30.E. Grinspun, A. N. Hirani, M. Desbrun, and P. Schröder, Discrete shells, in Proceedings of the 2003 ACM SIGGRAPH/Eurographics symposium on Computer animation, SCA ’03, Eurographics Association, 2003, pp. 62–67.
  • 31.Guillemin V, Pollack A. Differential topology. Englewood Cliffs, N.J.: Prentice-Hall Inc; 1974. [Google Scholar]
  • 32.J. Iglesias, B. Berkels, M. Rumpf, and O. Scherzer, A thin shell approach to the registration of implicit surfaces, in Proceedings of the Vision, Modeling, and Visualization Workshop 2013, Eurographics Association, 2013, pp. 89–96.
  • 33.S. Kabus, A. Franz, and B. Fischer, Variational image registration with local properties, in Biomedical Image Registration, J. P. W. Pluim, B. Likar, and F. A. Gerritsen, eds., vol. 4057 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2006, pp. 92–100.
  • 34.S. Kabus and C. Lorenz, Fast elastic image registration, in Proceedings of the Medical Image Analysis For The Clinic: A Grand Challenge, MICCAI, Beijing, China, 2010, pp. 81–89.
  • 35.Keeling SL, Ring W. Medical image registration and interpolation by optical flow with maximal rigidity. J. Math. Imaging Vision. 2005;23:47–65. doi: 10.1007/s10851-005-4967-2. [DOI] [Google Scholar]
  • 36.W. T. Koiter, On the nonlinear theory of elastic shells, Proc. Kon. Ned. Akad. Wetesnch., (1966), pp. 1–54.
  • 37.Kuiper NH. On C1- isometric imbeddings I. Nederl. Akad. Wetensch. Proc. Ser. A. 1955;58:545–556. doi: 10.1016/S1385-7258(55)50075-8. [DOI] [Google Scholar]
  • 38.Kybic J, Unser M. Fast parametric elastic image registration. IEEE Trans. Image Process. 2003;12:1427–1442. doi: 10.1109/TIP.2003.813139. [DOI] [PubMed] [Google Scholar]
  • 39.Le Dret H, Raoult A. The quasiconvex envelope of the Saint Venant-Kirchhoff stored energy function. Proc. Roy. Soc. Edinburgh Sect. A. 1995;125:1179–1192. doi: 10.1017/S0308210500030456. [DOI] [Google Scholar]
  • 40.T.-Y. Lee and S.-H. Lai, 3D non-rigid registration for MPU implicit surfaces, in CVPR Workshop on Non-Rigid Shape Analysis and Deformable Image Alignment, 2008.
  • 41.G. Leoni, A first course in Sobolev spaces, vol. 105 of Graduate Studies in Mathematics, American Mathematical Society, Providence, RI, 2009.
  • 42.Li X, Bao Y, Guo X, Jin M, Gu X, Qin H. Globally optimal surface mapping for surfaces with arbitrary topology. IEEE Trans. Vis. Comput. Graph. 2008;14:805–819. doi: 10.1109/TVCG.2008.32. [DOI] [PubMed] [Google Scholar]
  • 43.Li Y, Nirenberg L. The distance function to the boundary, Finsler geometry, and the singular set of viscosity solutions of some Hamilton-Jacobi equations. Comm. Pure Appl. Math. 2005;58:85–146. doi: 10.1002/cpa.20051. [DOI] [Google Scholar]
  • 44.N. Litke, M. Droske, M. Rumpf, and P. Schröder, An image processing approach to surface matching, in Symposium on Geometry Processing, M. Desbrun and H. Pottmann, eds., 2005, pp. 207–216.
  • 45.Mantegazza C, Mennucci AC. Hamilton-Jacobi equations and distance functions on Riemannian manifolds. Appl. Math. Optim. 2003;47:1–25. doi: 10.1007/s00245-002-0736-4. [DOI] [Google Scholar]
  • 46.Marcus M, Mizel VJ. Absolute continuity on tracks and mappings of Sobolev spaces. Arch. Ration. Mech. Anal. 1972;45:294–320. doi: 10.1007/BF00251378. [DOI] [Google Scholar]
  • 47.R. E. Megginson, An introduction to Banach space theory, vol. 183 of Graduate Texts in Mathematics, Springer, 1998.
  • 48.J. Modersitzki, Numerical Methods for Image Registration, OUP Oxford, 2004.
  • 49.Mukherjee DP, Ray N. Contour interpolation using level-set analysis. Int. J. Img. Graph. 2012;12:1250004. doi: 10.1142/S0219467812500040. [DOI] [Google Scholar]
  • 50.F. Murat, A survey on compensated compactness, in Contributions to modern calculus of variations (Bologna, 1985), vol. 148 of Pitman Res. Notes Math. Ser., Longman Sci. Tech., Harlow, 1987, pp. 145–183.
  • 51.Nash J. C1- isometric imbeddings. Ann. Math. 1954;60:383–396. doi: 10.2307/1969840. [DOI] [Google Scholar]
  • 52.J. Nocedal and S. Wright, Numerical Optimization, Springer, second ed., 2006.
  • 53.P. Paysan, R. Knothe, B. Amberg, S. Romdhani, and T. Vetter, A 3D face model for pose and illumination invariant face recognition, in Proc. Advanced Video and Signal based Surveillance, 2009.
  • 54.M. Renardy and R. Rogers, An Introduction to Partial Differential Equations, vol. 13 of Texts in Applied Mathematics, Springer, second ed., 2004.
  • 55.P. Risholm, E. Samset, and W. Wells III, Bayesian estimation of deformation and elastic parameters in non-rigid registration, in Biomedical Image Registration, B. Fischer, B. M. Dawant, and C. Lorenz, eds., vol. 6204 of Lecture Notes in Computer Science, Springer, 2010, pp. 104–115.
  • 56.Rumpf M, Wirth B. A nonlinear elastic shape averaging approach. SIAM J. Imaging Sci. 2009;2:800–833. doi: 10.1137/080738337. [DOI] [Google Scholar]
  • 57.J. A. Sethian, Level set methods and fast marching methods, Cambridge University Press, second ed., 1999.
  • 58.Siddiqi K, Zhang J, Macrini D, Shokoufandeh A, Bouix S, Dickinson S. Retrieving articulated 3-D models using medial surfaces. Machine Vision and Applications. 2008;19:261–275. doi: 10.1007/s00138-007-0097-8. [DOI] [Google Scholar]
  • 59.Srivastava A, Samir C, Joshi SH, Daoudi M. Elastic shape models for face analysis using curvilinear coordinates. J. Math. Imaging. Vis. 2009;33:253–265. doi: 10.1007/s10851-008-0073-6. [DOI] [Google Scholar]
  • 60.S. Wang, Y. Wang, M. Jin, X. Gu, and D. Samaras, 3d surface matching and recognition using conformal geometry, in 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’06), vol. 2, IEEE, 2006, pp. 2453–2460.
  • 61.T. Windheuser, U. Schlickewei, F. R. Schmidt, and D. Cremers, Geometrically consistent elastic matching of 3D shapes: A linear programming solution, in International Conference on Computer Vision, 2011, pp. 2134–2141.
  • 62.D. Zhang and M. Hebert, Harmonic maps and their applications in surface matching, in 1999 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’99), vol. 2, IEEE, 1999, pp. 524–530.

Articles from Foundations of Computational Mathematics (New York, N.y.) are provided here courtesy of Springer

RESOURCES