How to Register a Live onto a Liver ? Partial Matching in the Space of Varifolds

Pierre-Louis Antonsanti1,2Orcid, Thomas Benseghir2Orcid, Vincent Jugnon2Orcid, Mario Ghosn3Orcid, Perrine Chassat4Orcid, Joan Glaunès1Orcid, Irène Kaltenmark1Orcid
1: Universite de Paris, 2: GE Healthcare, 3: Memorial Sloan Kettering Cancer Center, 4: Laboratoire de Mathématiques et Modélisation d’Évry
Publication date: 2022/04/14
https://doi.org/10.59275/j.melba.2022-f8ba
PDF · Code · HAL · Video · arXiv

Abstract

Partial shapes correspondences is a problem that often occurs in computer vision (occlusion, evolution in time...). In medical imaging, data may come from different modalities and be acquired under different conditions which leads to variations in shapes and topologies. In this paper we use an asymmetric data dissimilarity term applicable to various geometric shapes like sets of curves or surfaces, assessing the embedding of a shape into another one without relying on correspondences. It is designed as a data attachment for the Large Deformation Diffeomorphic Metric Mapping (LDDMM) framework, allowing to compute a meaningful deformation of one shape onto a subset of the other. We refine it in order to control the resulting non-rigid deformations and provide consistent deformations of the shapes along with their ambient space. We show that partial matching can be used for robust multi-modal liver registration between a Computed Tomography (CT) volume and a Cone Beam Computed Tomography (CBCT) volume. The 3D imaging of the patient CBCT at point of care that we call __live__ is truncated while the CT pre-intervention provides a full visualization of the __liver__. The proposed method allows the truncated surfaces from CBCT to be aligned non-rigidly, yet realistically, with surfaces from CT with an average distance of $2.6mm(+/- 2.2)$. The generated deformations extend consistently to the liver volume, and are evaluated on points of interest for the physicians, with an average distance of $5.8mm (+/- 2.7)$ for vessels bifurcations and $5.13mm (+/- 2.5)$ for tumors landmarks. Such multi-modality volumes registrations would help the physicians in the perspective of navigating their tools in the patient's anatomy to locate structures that are hardly visible in the CBCT used during their procedures.
Our code is available at https://github.com/plantonsanti/PartialMatchingVarifolds.

Keywords

partial matching · varifolds · large deformation diffeomorphic metric mapping · image registration · multi-modality image registration · computed tomograhy · cone beam computed tomography

Bibtex @article{melba:2022:006:antonsanti, title = "How to Register a Live onto a Liver ? Partial Matching in the Space of Varifolds", author = "Antonsanti, Pierre-Louis and Benseghir, Thomas and Jugnon, Vincent and Ghosn, Mario and Chassat, Perrine and Glaunès, Joan and Kaltenmark, Irène", journal = "Machine Learning for Biomedical Imaging", volume = "1", issue = "IPMI 2021 special issue", year = "2022", pages = "1--30", issn = "2766-905X", doi = "https://doi.org/10.59275/j.melba.2022-f8ba", url = "https://melba-journal.org/2022:006" }
RISTY - JOUR AU - Antonsanti, Pierre-Louis AU - Benseghir, Thomas AU - Jugnon, Vincent AU - Ghosn, Mario AU - Chassat, Perrine AU - Glaunès, Joan AU - Kaltenmark, Irène PY - 2022 TI - How to Register a Live onto a Liver ? Partial Matching in the Space of Varifolds T2 - Machine Learning for Biomedical Imaging VL - 1 IS - IPMI 2021 special issue SP - 1 EP - 30 SN - 2766-905X DO - https://doi.org/10.59275/j.melba.2022-f8ba UR - https://melba-journal.org/2022:006 ER -

2022:006 cover


Disclaimer: the following html version has been automatically generated and the PDF remains the reference version. Feedback can be sent directly to publishing-editor@melba-journal.org

1 Introduction

In medical imaging, the problem of registering images has been tackled by numerous authors (Sotiras et al., 2013) by registering directly the images, most of the time assuming that both images contain the entire object of interest. When dealing with similar images (e.g. same acquisition modality of a given patient), techniques driven by a distance between voxel intensities (called similarity) usually perform well (Bauer et al., 2021). When more variability in terms of intensity arises, other studies propose feature based methods that match structures of interest such as surfaces, curves or even patches (Jiang et al., 2021), showing better robustness than their intensity based counterparts.

The problem of finding correspondences between these structures has numerous applications such as pattern recognition (Bronstein et al., 2006, 2009; van Kaick et al., 2013), annotation (Mori et al. (2013), Feragen et al. (2015)), and reconstruction (Halimi et al., 2020). In particular, in the field of medical imaging, matching an atlas and a patient’s anatomy (Feragen et al., 2015), or comparing exams of the same patient acquired with different imaging techniques (Bashiri et al., 2018), provide critical information to physicians for both planning and decision making. In practice, it often happens that only part of an object is visible in one of the two modalities (e.g. disease, surgery, multi-modality imaging, noise). When only partial correspondence between the images are present, handling missing structures is often done manually or heuristically.

Cone Beam Computed Tomography (CBCT), for instance, is used during image guided procedures -live- to improve navigation and guidance. Yet, the imaged organs are generally larger than the field of view, while the whole organ such as the liver can be acquired in Computed Tomography (CT) scanners during the disease diagnostic phase.

Refer to caption
(a)
Refer to caption
(b)
Figure 1: Examples of slices from a CBCT volume (a) and CT volume (b) from a same patient visualized with a 3mm Maximum Intensity Projection (MIP). The liver is only partially visible in CBCT.

In order to make the best of the different images both in terms of field of view and image characteristics (see Fig. 1), one can find a partial matching between them and the feature-based approaches seem suited to such matching problems. This work is focused on the registration of shapes where only part of these structures can be matched and its application to the registration of liver surfaces extracted from CT and CBCT to guide multi-modal volumes registration. In particular we apply the registration to the whole volumes, and must control the deformations to generate anatomically relevant ones. We study the clinical application of the proposed partial matching term for The present paper is an extension of Antonsanti et al. (2021) from the 2021 Information Processing in Medical Imaging conference in which we introduced the partial matching in the space of varifolds.

1.1 Previous works

The problem of matching shapes has been widely addressed in the literature in the past decades (van Kaick et al., 2011). In the specific case of partial matching, one can find two main approaches to such problem: either by finding correspondences, sparse or dense, between structures from descriptors that are invariant to different transformations (Aiger et al., 2008; Rodolà et al., 2017; Halimi et al., 2019), or by looking for a deformation aligning the shapes with respect to a given metric (Aiger et al., 2008; Mori et al., 2013; Zhao et al., 2015; Feragen et al., 2015; Halimi et al., 2020).

The early works on partial shape correspondence as reviewed in van Kaick et al. (2011) rely on correspondences between points computed from geometric descriptors extracted from an isotropic local region around the selected points. The method is refined in van Kaick et al. (2013) by selecting pairs of points to better fit the local geometry using bilateral map. The features extracted can also be invariant to different transformation, as in Rodolà et al. (2013) where the descriptors extracted are scale invariant. Such sparse correspondences are naturally adapted to partial matching, yet they cannot take the whole shapes into account in the matching process.

Using a different approach, functional maps were introduced in Ovsjanikov et al. (2012) allowing dense correspondences between shapes by transferring the problem to linear functions between spaces of functions defined over the shapes. In Rodolà et al. (2017) the non-rigid partial shape correspondence is based on the Laplace-Beltrami eigenfunctions used as prior in the spectral representation of the shapes. Recently in Halimi et al. (2019), such functional map models were adapted in a deep unsupervised framework by finding correspondences minimizing the distortion between shapes. Such methods are yet limited to surface correspondences.

The second kind of methods relies on the deformations that can be generated to align the shapes with each other. It usually involves minimizing a function called data attachment that quantifies the alignment error between the shapes. A deformation cost is sometimes added to regularize these deformations. The sparse correspondences being naturally suited to partial matching, they are notably used in Iterative Closest Point (ICP) methods and their derivatives to guide a registration of one shape onto the other. In Aiger et al. (2008) a regularized version of the ICP selects the sets of four co-planar points in the points cloud. In Mori et al. (2013) the ICP is adapted to the specific case of vascular trees and compute curves’ correspondences through an Iterative Closest Curve method. Working on trees of 3D curves as well, Feragen et al. (2015) hierarchically selects the overall curves correspondences minimizing the tree space geodesic distance between the trees. This latter method, although specific to tree-structures, allows topological changes in the deformation.

On the other hand some authors compute the deformation guided by a dense data attachment term. In Bronstein et al. (2006) isometry-invariant minimum distortion deformations are applied to 2D Riemannian manifolds thanks to a multiscale framework using partial matching derived from Gromov’s theory. This work is extended in Bronstein et al. (2009) by finding the optimal trade-off between partial shape matching and similarity between these shapes embedded in the same metric space. Recently in Halimi et al. (2020) a partial correspondence is performed through a non-rigid alignment of one shape and its partial scan seen as points clouds embedded in the same representation space. The non-rigid alignment is done with a Siamese architecture network. This approach seems promising and is part of a completion framework, however it requires a huge amount of data to train the network.

Interestingly, the regularization cost can be seen as a distance between shapes itself (Feragen et al., 2015) by quantifying the deformation amount necessary to register one shape onto the other. This provides a complementary tool to the metrics used to quantify the shapes dissimilarities.

A well established and versatile framework to compute meaningful deformations is the Large Deformation Diffeomorphic Metric Mapping (LDDMM) (Trouvé, 1995; Christensen et al., 1996; Beg et al., 2005). It allows to see the difference between shapes through the optimal deformation to register a source shape S𝑆S onto a target shape T𝑇T. However, the data attachment metrics proposed so far aim to compare the source and target shapes in their entirety (Charon et al., 2020), or look for explicit correspondences between subparts of these shapes (Feydy et al., 2017). In Kaltenmark and Trouvé (2018) the proposed growth model introduces a first notion of partial matching incorporated to the LDDMM framework. More recently, the bijectivity constraint is circumvented by the introduction of weighted shapes: in Hsieh and Charon (2021); Sukurdeep et al. (2021), authors optimize a mask defined on the shapes to exclude some subparts of these shapes (source or target). In Antonsanti et al. (2021) a partial matching data fidelity term was introduced in the space of varifolds. We use it in this paper and extend its formulation to better control the non-rigid deformations. We then apply the overall method to guide multi-modal volumes registration.

1.2 Organization of the Paper

In the first part we will shortly review the main elements of the representation of shapes in the space of varifolds (Charon and Trouvé, 2013) and the expression of the partial matching we use in this space, introduced in Antonsanti et al. (2021). In particular, we recall how it can be used with LDDMMs to compute diffeomorphic registration of a source shape to a subset of a target one. We will also discuss the use of the partial matching with a rigid registration. We then provide more details on the regularization term used for the application to the registration of truncated liver surfaces to limit the shrinkage effect that can occur when using partial matching with LDDMM.

The second section of this paper is dedicated to its clinical application to multi-modality volume registration based on the partial matching of liver surfaces. In this application we register liver surfaces obtained from segmentations of pre-interventional CT volumes intended for diagnostic purposes, and per-interventional CBCT volumes in which the livers are wider than the field of view, leading to truncation of the surfaces in the latter modality.

2 Partial Matching in the space of varifolds

In this section we quickly review the methodology introduced in Antonsanti et al. (2021). We refer to this article for all details.

We are interested in the problem of finding an optimal deformation to register a source shape S𝑆S onto an unknown subset of a target shape T𝑇T, where S,T𝑆𝑇S,T are assumed to be compact m𝑚m-rectifiable subsets of dsuperscript𝑑\mathbb{R}^{d} with either m=1𝑚1m=1 (curves) or m=d1𝑚𝑑1m=d-1 (hypersurfaces).

2.1 Shape registration via oriented varifolds

The varifold method for shape matching was first introduced in Charon and Trouvé (2013). In this section we use the notations and concepts of the more general oriented varifold framework, developed in Kaltenmark et al. (2017). This framework associates with any shape S𝑆S a representer function, defined on d×𝕊d1superscript𝑑superscript𝕊𝑑1\mathbb{R}^{d}\times\mathbb{S}^{d-1}, as follows:

ωS(y,τ)=Ske(y,x)kt(τ,τxS)𝑑x,subscript𝜔𝑆𝑦𝜏subscript𝑆subscript𝑘𝑒𝑦𝑥subscript𝑘𝑡𝜏subscript𝜏𝑥𝑆differential-d𝑥\omega_{S}(y,\tau)=\int_{S}k_{e}(y,x)k_{t}(\tau,\tau_{x}S)dx\,,

where τxsubscript𝜏𝑥\tau_{x} denotes the unit tangent vector –for curves– or unit normal vector –for hypersurfaces– at point x𝑥x on the shape S𝑆S, and ke,ktsubscript𝑘𝑒subscript𝑘𝑡k_{e},k_{t} are predefined fixed kernels functions over dsuperscript𝑑\mathbb{R}^{d} and 𝕊d1superscript𝕊𝑑1\mathbb{S}^{d-1}. In practice, we use ke:(d)2:subscript𝑘𝑒superscriptsuperscript𝑑2k_{e}:{(\mathbb{R}^{d})}^{2}\rightarrow\mathbb{R} a gaussian kernel ke(x,y)=exy2/σW2subscript𝑘𝑒𝑥𝑦superscript𝑒superscriptnorm𝑥𝑦2superscriptsubscript𝜎𝑊2k_{e}(x,y)=e^{-\|x-y\|^{2}/\sigma_{W}^{2}}, where σWsubscript𝜎𝑊\sigma_{W} is a scale parameter, and for kt:(𝕊d1)2:subscript𝑘𝑡superscriptsuperscript𝕊𝑑12k_{t}:{(\mathbb{S}^{d-1})}^{2}\rightarrow\mathbb{R} the kernel kt(u,v)=eu,vdsubscript𝑘𝑡𝑢𝑣superscript𝑒subscript𝑢𝑣superscript𝑑k_{t}(u,v)=e^{\langle\,u,v\rangle_{\mathbb{R}^{d}}}. Mathematically, the product kernel kekttensor-productsubscript𝑘𝑒subscript𝑘𝑡k_{e}\otimes k_{t} defines a Reproducing Kernel Hilbert Space (RKHS) structure W𝑊W, and ωSsubscript𝜔𝑆\omega_{S} corresponds to the Riesz representer of the oriented varifold μSWsubscript𝜇𝑆superscript𝑊\mu_{S}\in W^{\prime}, associated with S𝑆S, and Wsuperscript𝑊W^{\prime} the space of continuous linear forms on W𝑊W.

The shape matching dissimilarity between S𝑆S and T𝑇T is then the squared W𝑊W-norm between their representers, which is also the squared Wsuperscript𝑊W^{\prime} (dual) norm between their varifolds:

dW(S,T)2subscript𝑑superscript𝑊superscript𝑆𝑇2\displaystyle d_{W^{\prime}}(S,T)^{2}=\displaystyle=ωSωTW2=μSμTW2superscriptsubscriptnormsubscript𝜔𝑆subscript𝜔𝑇𝑊2superscriptsubscriptnormsubscript𝜇𝑆subscript𝜇𝑇superscript𝑊2\displaystyle\|\omega_{S}-\omega_{T}\|_{W}^{2}=\|\mu_{S}-\mu_{T}\|_{W^{\prime}}^{2}
=\displaystyle=μS,μSW2μS,μTW+μT,μTW,subscriptsubscript𝜇𝑆subscript𝜇𝑆superscript𝑊2subscriptsubscript𝜇𝑆subscript𝜇𝑇superscript𝑊subscriptsubscript𝜇𝑇subscript𝜇𝑇superscript𝑊\displaystyle\langle\,\mu_{S},\mu_{S}\rangle_{W^{\prime}}-2\langle\,\mu_{S},\mu_{T}\rangle_{W^{\prime}}+\langle\,\mu_{T},\mu_{T}\rangle_{W^{\prime}}\,,

where the scalar product has an explicit form using the kernels:

μS,μTW=ωS,ωTW=STke(x,y)kt(τxS,τyT)𝑑x𝑑y.subscriptsubscript𝜇𝑆subscript𝜇𝑇superscript𝑊subscriptsubscript𝜔𝑆subscript𝜔𝑇𝑊subscript𝑆subscript𝑇subscript𝑘𝑒𝑥𝑦subscript𝑘𝑡subscript𝜏𝑥𝑆subscript𝜏𝑦𝑇differential-d𝑥differential-d𝑦\displaystyle\langle\,\mu_{S},\mu_{T}\rangle_{W^{\prime}}=\langle\,\omega_{S},\omega_{T}\rangle_{W}=\int_{S}\int_{T}k_{e}(x,y)k_{t}(\tau_{x}S,\tau_{y}T)dx\,dy\,.

2.2 Definition of the Partial Matching Dissimilarity

The proposed partial dissimilarity term is designed to look locally at the inclusion of the deformed source shape into the target one, and to compensate (with the max(.,.)max(.,.) function) for the imbalance of weights between the simple shape and the more complex one with a normalization. The following term tends to 0 when the deformed shape is included in the target one (for more details and discussion, see Antonsanti et al. (2021)).

Definition 1.

Let g::𝑔maps-tog:\mathbb{R}\mapsto\mathbb{R} defined as g(s)=(max(0,s))2𝑔𝑠superscript0𝑠2g(s)=(\max(0,s))^{2}, and denote for x,xS𝑥superscript𝑥𝑆x,x^{\prime}\in S, 𝐱=(x,τxS)𝐱𝑥subscript𝜏𝑥𝑆\vec{\mathbf{x}}=(x,\tau_{x}S), ωS(𝐱)=ωS(x,τxS)subscript𝜔𝑆𝐱subscript𝜔𝑆𝑥subscript𝜏𝑥𝑆\omega_{S}(\vec{\mathbf{x}})=\omega_{S}(x,\tau_{x}S) and k(𝐱,𝐱)=ke(x,x)kt(τxS,τxS)𝑘𝐱superscript𝐱subscript𝑘𝑒𝑥superscript𝑥subscript𝑘𝑡subscript𝜏𝑥𝑆subscript𝜏superscript𝑥𝑆k(\vec{\mathbf{x}},\vec{\mathbf{x}}^{\prime})=k_{e}(x,x^{\prime})k_{t}(\tau_{x}S,\tau_{x^{\prime}}S). We define the normalized partial matching dissimilarity as follows:

Δ¯(S,T)¯Δ𝑆𝑇\displaystyle\underline{\Delta}(S,T)=\displaystyle=Sg(ωS(𝐱)Tminϵ(1,ωS(𝐱)ωT(𝐲))k(𝐱,𝐲)𝑑y)𝑑xsubscript𝑆𝑔subscript𝜔𝑆𝐱subscript𝑇subscriptitalic-ϵ1subscript𝜔𝑆𝐱subscript𝜔𝑇𝐲𝑘𝐱𝐲differential-d𝑦differential-d𝑥\displaystyle\int_{S}g\left(\omega_{S}(\vec{\mathbf{x}})-\int_{T}{\min}_{\epsilon}\left(1,\dfrac{\omega_{S}(\vec{\mathbf{x}})}{\omega_{T}(\vec{\mathbf{y}})}\right)k(\vec{\mathbf{x}},\vec{\mathbf{y}})dy\right)dx(1)

where minϵ(1,s)=s+1ϵ+(s1)22subscriptitalic-ϵ1𝑠𝑠1italic-ϵsuperscript𝑠122\min_{\epsilon}(1,s)=\frac{s+1-\sqrt{\epsilon+(s-1)^{2}}}{2} with ϵ>0italic-ϵ0\epsilon>0 small, is used as a smooth approximation of the min(1,)1\min(1,\cdot) function.

Discrete formulation

The discrete version of the partial matching dissimilarity can be derived very straightforwardly, following the same discrete setting described in Charon et al. (2020) for varifold matching. We are working with surfaces, seen as triangular meshes with vertices q1,,qKsubscript𝑞1subscript𝑞𝐾q_{1},...,q_{K}. Each triangle fi,i[1,..,NS]f_{i},\>i\in[1,..,N_{S}] with the vertices (qi1,qi2,qi3)superscriptsubscript𝑞𝑖1superscriptsubscript𝑞𝑖2superscriptsubscript𝑞𝑖3(q_{i}^{1},q_{i}^{2},q_{i}^{3}) of the shape S𝑆S is associated to the center ci=xi1+xi2+xi33subscript𝑐𝑖superscriptsubscript𝑥𝑖1superscriptsubscript𝑥𝑖2superscriptsubscript𝑥𝑖33c_{i}=\frac{x_{i}^{1}+x_{i}^{2}+x_{i}^{3}}{3} and to the normal vector ηxiS=(1/2)(qi2qi1)×(qi3qi1)subscript𝜂subscript𝑥𝑖𝑆12superscriptsubscript𝑞𝑖2superscriptsubscript𝑞𝑖1superscriptsubscript𝑞𝑖3superscriptsubscript𝑞𝑖1\eta_{x_{i}}S=(1/2)*(q_{i}^{2}-q_{i}^{1})\times(q_{i}^{3}-q_{i}^{1}). The unit normal vector is then τxiS=ηxiSηxiSsubscript𝜏subscript𝑥𝑖𝑆subscript𝜂subscript𝑥𝑖𝑆delimited-∥∥subscript𝜂subscript𝑥𝑖𝑆\tau_{x_{i}}S=\frac{\eta_{x_{i}}S}{\left\lVert\eta_{x_{i}}S\right\rVert}. We define similarly the centers ylsubscript𝑦𝑙y_{l} of the target shape T𝑇T and their associated normal vectors ηylTsubscript𝜂subscript𝑦𝑙𝑇\eta_{y_{l}}T and unit normal vectors τylTsubscript𝜏subscript𝑦𝑙𝑇\tau_{y_{l}}T.

The discrete normalized partial matching term is then written as follows:

Δ¯(S,T)¯Δ𝑆𝑇\displaystyle\underline{\Delta}(S,T)=i=1NSg(ωS(𝐱i)l=1NTminϵ(1,ωS(𝐱i)ωT(𝐲l))k(𝐱i,𝐲l))absentsuperscriptsubscript𝑖1subscript𝑁𝑆𝑔subscript𝜔𝑆subscript𝐱𝑖superscriptsubscript𝑙1subscript𝑁𝑇subscriptitalic-ϵ1subscript𝜔𝑆subscript𝐱𝑖subscript𝜔𝑇subscript𝐲𝑙𝑘subscript𝐱𝑖subscript𝐲𝑙\displaystyle=\sum\limits_{i=1}^{N_{S}}g\left(\omega_{S}(\vec{\mathbf{x}}_{i})-\sum\limits_{l=1}^{N_{T}}{\min}_{\epsilon}\left(1,\dfrac{\omega_{S}(\vec{\mathbf{x}}_{i})}{\omega_{T}(\vec{\mathbf{y}}_{l})}\right)k(\vec{\mathbf{x}}_{i},\vec{\mathbf{y}}_{l})\right)(2)

with ωS(𝐱i)=j=1NSke(xi,xj)kt(τxiS,τxjS)ηxiSηxjSsubscript𝜔𝑆subscript𝐱𝑖superscriptsubscript𝑗1subscript𝑁𝑆subscript𝑘𝑒subscript𝑥𝑖subscript𝑥𝑗subscript𝑘𝑡subscript𝜏subscript𝑥𝑖𝑆subscript𝜏subscript𝑥𝑗𝑆delimited-∥∥subscript𝜂subscript𝑥𝑖𝑆delimited-∥∥subscript𝜂subscript𝑥𝑗𝑆\omega_{S}(\vec{\mathbf{x}}_{i})=\sum\limits_{j=1}^{N_{S}}k_{e}(x_{i},x_{j})k_{t}(\tau_{x_{i}}S,\tau_{x_{j}}S)\left\lVert\eta_{x_{i}}S\right\rVert\left\lVert\eta_{x_{j}}S\right\rVert.

2.3 Use in the LDDMM setting

In the LDDMM framework Beg et al. (2005), the partial matching problem consists in minimizing

J(v)=λ01vtV2𝑑t+Δ¯(ϕ1v(S),T),𝐽𝑣𝜆superscriptsubscript01superscriptsubscriptnormsubscript𝑣𝑡𝑉2differential-d𝑡¯Δsuperscriptsubscriptitalic-ϕ1𝑣𝑆𝑇J(v)=\lambda\int_{0}^{1}\|v_{t}\|_{V}^{2}dt+\underline{\Delta}({\phi_{1}^{v}(S)},T)\,,

where ϕ1vsuperscriptsubscriptitalic-ϕ1𝑣\phi_{1}^{v} is the flow of the time-dependent square integrable velocity fields t[0,1]vt𝑡01maps-tosubscript𝑣𝑡t\in[0,1]\mapsto v_{t}, and V\|\cdot\|_{V} is the regularization Hilbert norm over vector fields.

The LDDMM registration procedure is numerically solved via a geodesic shooting algorithm introduced by Miller et al. (2006), optimizing on a set of initial momentum vectors located at the discretization points of the source shape. Implementations of the dissimilarity terms are available on our github repository 111https://github.com/plantonsanti/PartialMatchingVarifolds.

2.4 Use with Rigid Deformations

We can define a second minimization problem for a rigid registration, by minimizing the function:

Jrig(r)=Δ¯(r(S),T),subscript𝐽𝑟𝑖𝑔𝑟¯Δ𝑟𝑆𝑇J_{rig}(r)=\underline{\Delta}({r(S)},T)\,,

with r𝑟r a rigid deformation composed of a translation and a rotation.

For any rigid deformation ωr(S)(r(𝐱))=ωS(𝐱)subscript𝜔𝑟𝑆𝑟𝐱subscript𝜔𝑆𝐱\omega_{r(S)}(r(\vec{\mathbf{x}}))=\omega_{S}(\vec{\mathbf{x}}), xSfor-all𝑥𝑆\forall x\in S, and we can thus write in the discrete setting:

Δ¯(r(S),T)¯Δ𝑟𝑆𝑇\displaystyle\underline{\Delta}(r(S),T)=i=1NSg(ωS(𝐱i)l=1NTminϵ(1,ωS(𝐱i)ωT(𝐲l))k(r(𝐱i),𝐲l))absentsuperscriptsubscript𝑖1subscript𝑁𝑆𝑔subscript𝜔𝑆subscript𝐱𝑖superscriptsubscript𝑙1subscript𝑁𝑇subscriptitalic-ϵ1subscript𝜔𝑆subscript𝐱𝑖subscript𝜔𝑇subscript𝐲𝑙𝑘𝑟subscript𝐱𝑖subscript𝐲𝑙\displaystyle=\sum\limits_{i=1}^{N_{S}}g\left(\omega_{S}(\vec{\mathbf{x}}_{i})-\sum\limits_{l=1}^{N_{T}}{\min}_{\epsilon}\left(1,\dfrac{\omega_{S}(\vec{\mathbf{x}}_{i})}{\omega_{T}(\vec{\mathbf{y}}_{l})}\right)k(r(\vec{\mathbf{x}}_{i}),\vec{\mathbf{y}}_{l})\right)

We have that Jrigsubscript𝐽𝑟𝑖𝑔J_{rig} is a composition of continuous functions and that : k(r(𝐱i),𝐲l)0𝑘𝑟subscript𝐱𝑖subscript𝐲𝑙0k(r(\vec{\mathbf{x}}_{i}),\vec{\mathbf{y}}_{l})\longrightarrow 0 when the translation goes to infinity from the construction of the kernel k𝑘k. We can deduce that for all rigid deformation we have minϵ(1,ωS(𝐱i)ωT(𝐲l))k(r(𝐱i),𝐲l)>0subscriptitalic-ϵ1subscript𝜔𝑆subscript𝐱𝑖subscript𝜔𝑇subscript𝐲𝑙𝑘𝑟subscript𝐱𝑖subscript𝐲𝑙0{\min}_{\epsilon}\left(1,\dfrac{\omega_{S}(\vec{\mathbf{x}}_{i})}{\omega_{T}(\vec{\mathbf{y}}_{l})}\right)k(r(\vec{\mathbf{x}}_{i}),\vec{\mathbf{y}}_{l})>0 and Jrig(r)<i=1NSg(ωS(𝐱i))subscript𝐽𝑟𝑖𝑔𝑟superscriptsubscript𝑖1subscript𝑁𝑆𝑔subscript𝜔𝑆subscript𝐱𝑖J_{rig}(r)<\sum\limits_{i=1}^{N_{S}}g\left(\omega_{S}(\vec{\mathbf{x}}_{i})\right).

Jrigsubscript𝐽𝑟𝑖𝑔J_{rig} is continuous and bounded over the space of finite dimension of rotations and translations, the minimization problem has a solution.

2.5 Additional a priori

It is known from experiments that the deformations can lead to abnormal shrinkage or stretching of the deformed shapes. This phenomenon comes from two things combined: first, we introduce an attachment term to the data favoring the inclusion of a deformed object in a target, thus an asymmetric term. In the case of non-rigid deformations, there is a multitude of local minima, and this must be controlled with a regularization of the deformations. Second, in the regularization of the LDDMM model (2.3), the deformations tend to shrink the objects along the geodesics, so it is possible that the diffeomorphisms create a shrinkage of the non-realistic source shape. In order to limit this we can add a regularization term in the function J𝐽J to minimize.

2.5.1 Definition

The purpose of this regularization term is to prevent the deformations from shrinking or stretching the source shape. We chose to address it in the shape space of Varifolds as well, by controlling the norm of the deformed shape:

Rglobal(S,Φ(S))=(ωSW2ωΦ(S)W2)2(Global)subscript𝑅𝑔𝑙𝑜𝑏𝑎𝑙𝑆Φ𝑆superscriptsubscriptsuperscriptnormsubscript𝜔𝑆2𝑊subscriptsuperscriptnormsubscript𝜔Φ𝑆2𝑊2(Global)\displaystyle R_{global}(S,\Phi(S))=\left(\|\omega_{S}\|^{2}_{W}-\|\omega_{\Phi(S)}\|^{2}_{W}\right)^{2}\quad\mbox{({Global})}(3)

Interestingly this term can be written with the area formula:

Rglobal(S,Φ(S))=(SωS(𝐱)𝑑xΦ(S)ωΦ(S)(𝐲)𝑑y)2=(SωS(𝐱)ωΦ(S)(Φ(𝐱))|dxϕ|τxS|dx)2\displaystyle\begin{split}R_{global}(S,\Phi(S))&=\left(\int_{S}\omega_{S}(\vec{\mathbf{x}})dx-\int_{\Phi(S)}\omega_{\Phi(S)}(\vec{\mathbf{y}})dy\right)^{2}\\ &=\left(\int_{S}\omega_{S}(\vec{\mathbf{x}})-\omega_{\Phi(S)}(\Phi(\vec{\mathbf{x}}))\left|{d_{x}\phi}_{|\tau_{x}S}\right|dx\right)^{2}\end{split}

This enforces the conservation of the norm of the deformed shape. Yet in practice it can lead to local deformations of one part of the shape compensated with another part (Fig. 2). We therefore introduce a local regularization allowing to locally preserve the mass by enforcing the terms inside the integral to be close to 00 everywhere:

Rlocal(S,Φ(S))=S(ωS(𝐱)ωΦ(S)(Φ(𝐱))|dxϕ|τxS|)2𝑑x (Local)\displaystyle R_{local}(S,\Phi(S))=\int_{S}\left(\omega_{S}(\vec{\mathbf{x}})-\omega_{\Phi(S)}\left(\Phi(\vec{\mathbf{x}})\right)\left|{d_{x}\phi}_{|\tau_{x}S}\right|\right)^{2}dx\quad\mbox{ ({Local})}(4)
Discrete formulation

Similarly to the partial matching term, we can write the regularization terms (both global and local) in the discrete setting:

Rglobal(S,Φ(S))=(i=1NSωS(𝐱i)i=1NSωΦ(S)(Φ(𝐱i)))2 (Discrete Global)subscript𝑅𝑔𝑙𝑜𝑏𝑎𝑙𝑆Φ𝑆superscriptsuperscriptsubscript𝑖1subscript𝑁𝑆subscript𝜔𝑆subscript𝐱𝑖superscriptsubscript𝑖1subscript𝑁𝑆subscript𝜔Φ𝑆Φsubscript𝐱𝑖2 (Discrete Global)\displaystyle R_{global}(S,\Phi(S))=\left(\sum\limits_{i=1}^{N_{S}}\omega_{S}(\vec{\mathbf{x}}_{i})-\sum\limits_{i=1}^{N_{S}}\omega_{\Phi(S)}(\Phi(\vec{\mathbf{x}}_{i}))\right)^{2}\quad\mbox{ ({Discrete Global})}(5)
Rlocal(S,Φ(S))=i=1NS(ωS(𝐱i)ωΦ(S)(Φ(𝐱i))ηΦ(𝐱i)Φ(S)η𝐱iS)2 (Discrete Local)subscript𝑅𝑙𝑜𝑐𝑎𝑙𝑆Φ𝑆superscriptsubscript𝑖1subscript𝑁𝑆superscriptsubscript𝜔𝑆subscript𝐱𝑖subscript𝜔Φ𝑆Φsubscript𝐱𝑖delimited-∥∥subscript𝜂Φsubscript𝐱𝑖Φ𝑆delimited-∥∥subscript𝜂subscript𝐱𝑖𝑆2 (Discrete Local)\displaystyle R_{local}(S,\Phi(S))=\sum\limits_{i=1}^{N_{S}}\left(\omega_{S}(\vec{\mathbf{x}}_{i})-\omega_{\Phi(S)}\left(\Phi(\vec{\mathbf{x}}_{i})\right)\frac{\left\lVert\eta_{\Phi(\vec{\mathbf{x}}_{i})}\Phi(S)\right\rVert}{\left\lVert\eta_{\vec{\mathbf{x}}_{i}}S\right\rVert}\right)^{2}\quad\mbox{ ({Discrete Local})}(6)

The overall function to minimize in this LDDMM setting is given by the formula:

Jreg(v)=λ101vtV2𝑑t+Δ¯(ϕ1v(S),T)+λ2.R(S,ϕ1v(S))formulae-sequencesubscript𝐽𝑟𝑒𝑔𝑣subscript𝜆1superscriptsubscript01superscriptsubscriptnormsubscript𝑣𝑡𝑉2differential-d𝑡¯Δsuperscriptsubscriptitalic-ϕ1𝑣𝑆𝑇subscript𝜆2𝑅𝑆superscriptsubscriptitalic-ϕ1𝑣𝑆\displaystyle J_{reg}(v)=\lambda_{1}\int_{0}^{1}\|v_{t}\|_{V}^{2}dt+\underline{\Delta}({\phi_{1}^{v}(S)},T)+\lambda_{2}.R(S,\phi_{1}^{v}(S))\,(7)

with R=Rglobal𝑅subscript𝑅𝑔𝑙𝑜𝑏𝑎𝑙R=R_{global} or Rlocalsubscript𝑅𝑙𝑜𝑐𝑎𝑙R_{local}.

Proposition 1.

Let λ1>0subscript𝜆10\lambda_{1}>0 and λ2>0subscript𝜆20\lambda_{2}>0 be two fixed parameters. The regularized partial matching problem, which consists in minimizing over LV2superscriptsubscript𝐿𝑉2L_{V}^{2} the function Jregsubscript𝐽𝑟𝑒𝑔J_{reg} (defined in Eq.2.5.1) has a solution.

Similarly to Antonsanti et al. (2021), the proof boils down to showing that the mapping vA(v)=Δ¯(ϕ1v(S),T)+Rlocal(S,ϕ1v(S))maps-to𝑣𝐴𝑣¯Δsuperscriptsubscriptitalic-ϕ1𝑣𝑆𝑇subscript𝑅𝑙𝑜𝑐𝑎𝑙𝑆superscriptsubscriptitalic-ϕ1𝑣𝑆v\mapsto A(v)=\underline{\Delta}({\phi_{1}^{v}(S)},T)+R_{local}(S,{\phi_{1}^{v}(S)}) is weakly continuous on LV2superscriptsubscript𝐿𝑉2L_{V}^{2}. We use the same notations, and define (vn)subscript𝑣𝑛(v_{n}) a sequence in LV2subscriptsuperscript𝐿2𝑉L^{2}_{V}, weakly converging to some vLV2𝑣subscriptsuperscript𝐿2𝑉v\in L^{2}_{V}. We only need to show that Rlocal(S,ϕ1vn(S))Rlocal(S,ϕ1v(S))subscript𝑅𝑙𝑜𝑐𝑎𝑙𝑆superscriptsubscriptitalic-ϕ1subscript𝑣𝑛𝑆subscript𝑅𝑙𝑜𝑐𝑎𝑙𝑆superscriptsubscriptitalic-ϕ1𝑣𝑆R_{local}(S,{\phi_{1}^{v_{n}}(S)})\longrightarrow R_{local}(S,{\phi_{1}^{v}(S)}).
To simplify we denote Sn=ϕ1vn(S)subscript𝑆𝑛superscriptsubscriptitalic-ϕ1subscript𝑣𝑛𝑆S_{n}=\phi_{1}^{v_{n}}(S), S=ϕ1v(S)subscript𝑆superscriptsubscriptitalic-ϕ1𝑣𝑆S_{*}=\phi_{1}^{v}(S) and for any 𝐱d×𝕊d1𝐱superscript𝑑superscript𝕊𝑑1\vec{\mathbf{x}}\in\mathbb{R}^{d}\times\mathbb{S}^{d-1}, fn(𝐱)=ωSn(𝐱)Tminϵ(1,ωSn(𝐱)ωT(𝐲))k(𝐱,𝐲)𝑑ysubscript𝑓𝑛𝐱subscript𝜔subscript𝑆𝑛𝐱subscript𝑇subscriptitalic-ϵ1subscript𝜔subscript𝑆𝑛𝐱subscript𝜔𝑇𝐲𝑘𝐱𝐲differential-d𝑦\displaystyle f_{n}(\vec{\mathbf{x}})=\omega_{S_{n}}(\vec{\mathbf{x}})-\int_{T}{\min}_{\epsilon}\left(1,\dfrac{\omega_{{S_{n}}}(\vec{\mathbf{x}})}{\omega_{T}(\vec{\mathbf{y}})}\right)k(\vec{\mathbf{x}},\vec{\mathbf{y}})dy and f(𝐱)subscript𝑓𝐱f_{*}(\vec{\mathbf{x}}) likewise for Ssubscript𝑆S_{*}.

Using Antonsanti et al. (2021), we have that dxϕnsubscript𝑑𝑥superscriptitalic-ϕ𝑛d_{x}\phi^{n} converge to dxϕsubscript𝑑𝑥italic-ϕd_{x}\phi, uniformly on xS𝑥𝑆x\in S (Glaunès (2005)). In addition ωSnsubscript𝜔subscript𝑆𝑛\omega_{S_{n}} converges uniformly to ωSsubscript𝜔subscript𝑆\omega_{S_{*}}. We can deduce that Rlocal(S,ϕ1vn(S))Rlocal(S,ϕ1v(S))0subscript𝑅𝑙𝑜𝑐𝑎𝑙𝑆superscriptsubscriptitalic-ϕ1subscript𝑣𝑛𝑆subscript𝑅𝑙𝑜𝑐𝑎𝑙𝑆superscriptsubscriptitalic-ϕ1𝑣𝑆0R_{local}(S,{\phi_{1}^{v_{n}}(S)})-R_{local}(S,{\phi_{1}^{v}(S)})\longrightarrow 0.absent\quad\qed

2.5.2 Influence of the Regularization Term

We illustrate the influence of the regularization terms with the example of the registration of a truncated surface onto a complete one. To do so we perform a LDDMM registration using a small regularization parameter λ1=1000subscript𝜆11000\lambda_{1}=1000 in the functional Jregsubscript𝐽𝑟𝑒𝑔J_{reg} and we set λ2=1subscript𝜆21\lambda_{2}=1. The data attachment term we use is the one proposed for the partial matching in Section. 2.2.

Refer to caption
(a) Source and Target
Refer to caption
(b) Partial Varifold
No Regularization
Refer to caption
(c)
Refer to caption
(d) Partial Varifold
Global Regularization
Refer to caption
(e) Partial Varifold
Local Regularization
Figure 2: Influence of the regularization term on the non rigid deformation of a truncated sphere onto a complete one. (a): Source (blue, opaque) and target (red, transparent) surfaces. (b-c-d): registration results. The colormap for (b-c-d) indicates the euclidean distance (in mm) of the points to their initial position before diffeomorphic deformations.

We observe that without any regularization, the non-rigid deformations lead to global shrinkage of the source shape. On the contrary the proposed regularizations both global and local prevent from such shrinkage. The global one though preserves the norm of the shape at the end of the diffeomorphic deformation and does not prevent from inconsistent local deformations. The most regular deformation is thus induced by the local regularization, which allows to locally control the value of the varifold associated to the deformed source. It should be noted that we work at a small scale of attachment to the data, and that this influences the regularization. In the rest of the paper, we will use this local mass preserving term for the clinical application (section 3).

2.5.3 Implementation Details

In all the following experiments, we initialize the registration by aligning objects barycenters since no prior positioning is known in our applications. To model non-rigid deformations, we define the reproducing kernel KVsubscript𝐾𝑉K_{V} of V𝑉V to be a sum of Gaussian kernels:

KV(x,y)=sexp(xy2/(σ0/s)2)subscript𝐾𝑉𝑥𝑦subscript𝑠superscriptnorm𝑥𝑦2superscriptsubscript𝜎0𝑠2K_{V}(x,y)=\sum_{s}\exp\left(-\|x-y\|^{2}\;/\;(\sigma_{0}/s)^{2}\right)

where s[1,4,8,16]𝑠14816s\in[1,4,8,16] and σ0subscript𝜎0\sigma_{0} is about half the size of the shapes bounding boxes. For each set of experiments we use the same hyperparameters (σ0,σW,λ1,λ2subscript𝜎0subscript𝜎𝑊subscript𝜆1subscript𝜆2\sigma_{0},\sigma_{W},\lambda_{1},\lambda_{2}) to compare the influence of the regularization and for the clinical application. The parameter σ0subscript𝜎0\sigma_{0} controls the range of the non-rigid deformations produced by LDDMM, while σWsubscript𝜎𝑊\sigma_{W} is associated to the spatial kernel used for the data attachment term in the space of varifolds, and denotes the reach of each varifold. Our Python implementation makes use of the libraries PyTorch (Paszke et al., 2017) and KeOps (Charlier et al., 2021), to benefit from automatic differentiation and GPU acceleration of kernel convolutions.

2.5.4 Computational Cost

To compute the registrations, we use a TITAN RTX Graphic Processing Unit. One rigid deformation of a 444×512×512444512512444\times 512\times 512 voxel grid is computed in 9.10×101s9.10superscript101𝑠9.10\times 10^{-1}s when the diffeomorphic deformation takes 57.057.057.0 seconds. In terms of optimization, the ICP (on CPU) takes 4.64×102s4.64superscript102𝑠4.64\times 10^{-2}s for a source and a target of approximately 104superscript10410^{4} points. On the same data the rigid registration guided with our partial matching dissimilarity function takes 9.63×101s9.63superscript101𝑠9.63\times 10^{-1}s and the LDDMM optimization takes 274s274𝑠274s. This huge difference between LDDMM and the others methods comes from the number of parameters to optimize in its framework : the dimension of the space times the number of points in the source shape.

There are many possible ways to accelerate the LDDMM, from reducing the number of points in the source to the approximation of the diffeomorphisms with other deformations models. No matter the deformation, the computational cost of the partial matching dissimilarity function for the same data is 7.24×103s7.24superscript103𝑠7.24\times 10^{-3}s.

3 Clinical application : Feature-based Multi-modality Liver Volume Registration

Medical images are often acquired through different modalities, including ultrasound, computed tomography, and magnetic resonance imaging, each providing different and complementary information. In this context, image registration allows physicians to obtain combined inputs from different imaging modalities using for instance image comparison or fusion. The latter has been shown to be valuable in image-guided procedures, yielding less complications and decreasing radiation dose (Rajagopal and Venkatesan, 2016). This section is the clinical application of the work introducing the partial matching in the space of varifolds (Antonsanti et al., 2021) and the extensions proposed in 2.

3.1 CT/CBCT Volume Registration

Transcatheter directed liver therapies are part of the therapeutic arsenal of primary and secondary liver malignancies. The objective of these procedures is to locally treat the tumor and be as selective as possible (meaning placing the microcatheter used to inject the treatment as close as possible to the tumor) to preserve surrounding healthy tissues all while ensuring the destruction of the malignant cells.

These minimally invasive procedures are performed by navigating through the patient’s arteries under real time 2D angiography, acquired through an imaging device called C-arm. Additionally, the latter can perform a 200 degrees rotation to allow 3D reconstruction of the patient’s anatomy, called Cone Beam Computed Tomography (CBCT) (Tacher et al., 2015), to obtain a “live” 3D imaging of the patient at point of care. Performing CBCT during such procedure improves tumor detection and navigation guidance (Fig. 1a).

Classically, preprocedural diagnostic CT scan or MRI are reviewed by the interventional radiologist to plan the procedure accordingly. The preprocedural acquisitions provide information on the entire liver anatomy, tumor burden and tumor feeding arteries that are decisive for procedural planning, such as number of tumors to be treated in one session and the dose of therapeutic agent to inject. Contrary to CT or MRI, CBCT is performed during the procedure, and the operator can compare procedural CBCT to preprocedural CT (Fig. 1b) to ensure adequate treatment delivery.

While CBCT offers a superior spatial resolution compared to conventional CT scan, with intra-arterial injection of contrast agent providing a detailed visualization of the arteries, low contrast visibility is better in CT (Fig. 1a). CBCT can also be subject to several artifacts such as beam hardening and motion artifacts that might decrease the CBCT performance to visualize the tumor, which is key to selective and successful treatment. A major difficulty in the fusion of a CT volume with a CBCT one comes from the fact that, unlike CT, liver is only partially visible in CBCT (due to the limited size of the field of view in the latter modality). In addition the acquisitions are taken at different times, potentially several weeks apart, and with different patient stances introducing deformations of the liver. For all these reasons, the two types of volumes are very different one from another as illustrated in Fig. 1.

We propose a registration method based on liver surfaces (one of the feature that is visible in both the CT and CBCT whatever the clinical acquisition protocol) providing a deformation of the entire volume. To that extent we apply our partial matching dissimilarity term allowing to tackle the issue of partial correspondence between the truncated surface extracted from the CBCT (Live) and the one extracted from the CT (Liver). The registrations are evaluated on landmarks inside the liver, which were annotated by a physician.

3.2 Database Description

The database is composed of CBCT/CT pairs where CBCT have been acquired during hepatic arteriography and CT scans obtained at early or late arterial phase. We do not provide the acquisition parameters here, yet the spatial resolution (in mm𝑚𝑚mm) of the volumes are (0.45,0.45,0.45)0.450.450.45(0.45,0.45,0.45) for the CBCT and in average (0.75,0.75,1.25)0.750.751.25(0.75,0.75,1.25) for the CT. Both were selected to show good visualization of the vessels and tumors. In total, 19 pairs of CT/CBCT liver volumes were evaluated, as the one illustrated in Fig. 1.

Refer to caption
(a)
Refer to caption
(b)
Refer to caption
(c)
Refer to caption
(d)
Figure 3: Examples of annotated Points of Interest on CBCT (a) and on CT (b). Examples of annotated longest axis diameter lesion visualized on CBCT (c) and on CT (d). All images come from the same patient.

3.2.1 Liver Segmentation

The livers were segmented in each modality using a deep neural network (Milletari et al., 2016) providing a binary volume in both modalities. In this application, the segmentations were evaluated by a clinical specialist and manually corrected if a major error was detected such as missing part of the liver. The idea is to be close to the clinical set up. By doing so, we ensure that the registrations are based on features as reliable as possible. The mesh of the surfaces were then extracted and decimated, leading to meshes of approximately 104superscript10410^{4} points per surface. In the case of CBCT volumes, the meshes are then cut by the cylinder corresponding to the field of view using Musy et al. (2021). The CBCT livers surfaces obtained are then truncated.

3.2.2 Points of Interest

For each patient, the branches of the proper hepatic artery visible on CT volume were annotated with Points of Interest (POIs) for evaluation purpose. Each POI was similarly annotated in the same location on the corresponding CBCT volume. Selected POIs often corresponded to arterial bifurcations that are easily identifiable on both CT and CBCT. For each pair of volumes, a physician annotated 10 POIs (Fig. 3a,3b). Because of the limited visibility of distal hepatic arteries on arterial phase CT compared to CBCT acquired during hepatic arteriography, most of POIs were located close to the bifurcation of the proper hepatic artery, thus mainly located at central parts of the livers, of importance to physicians.

3.2.3 Tumors Annotation

To evaluate the registrations, in addition to POIs, we annotated the longest axis diameter of a tumor according to Ghosn et al. (2021) to ensure better reproducibility of the annotations across volumes (Fig. 3c, Fig 3d). It was done in the axial view of the volumes for tumors that were visible in both modalities. The axis can be decomposed into 3 Tumor Points : the extremities and the center. In the database, one invasive tumor could not be annotated, reducing the number of pairs of tumors to 18. The annotated tumors were located in all the liver segments and their size varied from 9mm to 109mm. This variability in terms of position and size provides a complementary information to that of the POIs.

3.3 Liver Surface Registration with Partial Matching

As a first registration step, the truncated liver surfaces from CBCT were registered onto complete liver surfaces from CT scans with a LDDMM deformation model using the discrete framework described in Sec. 2.2. The LDDMM deformations of the truncated livers surfaces with partial dissimilarity function may lead to small shrinkage of the borders. To compensate this phenomenon in the application we added the a priori regularization of Eq. 4 to the partial data attachment term that prevents from strong local deformations. For illustration purpose, one subject was registered twice with this model: once with the distance in the space of Varifolds, once with the normalized partial dissimilarity term (Def. 1) with the local regularization (Eq. 4). This particular experiment is illustrated in Fig. 4. Both results are generated with the same deformations and regularization parameters. As expected the Varifold distance leads to unrealistic deformations that tend to fill the holes in the source shape to cover the entire target. From the anatomical and medical point of view this is misleading and can not be used in a clinical application of multi-modality volumes registration. On the contrary the partial matching produces a more realistic deformation of the source onto a subset of the complete surface. We will only use and discuss this model in the following.

Refer to caption
(a)
Refer to caption
(b)
Refer to caption
(c)
Refer to caption
(d)
Refer to caption
(e)
Figure 4: Registration of a truncated liver’s surface (Live) from a CBCT (a) onto a complete liver’s surface (Liver) from a CT (b) for Patient 2. Varifold registration (c); Partial normalized registration (Def. 1) with a local regularization (Eq. 4) (d). The color scale indicates the euclidean distance (in mm) of the points to their initial position before diffeomorphic deformation.

To initialize the LDDMM deformations, one classically performs a rigid registration. We find in the literature that the livers are principally deformed in translation, so we tested a set of combinations between rigid deformations and LDDMM. We selected the methods providing the best results: a translation followed by LDDMM (denoted translation+LDDMM) and a rigid deformation of limited angulation followed by LDDMM (denoted rigid+LDDMM). The rigid registration is limited to rotations between 15superscript15-15^{\circ} and 15superscript1515^{\circ} around each axis that is the range of realistic rotations for the liver deformations.

In addition to these registration methods, we tested the standard rigid Iterative Closest Point (ICP) applied to the surfaces, using as data attachment term the function:

ΔICP(S,T)=1Card(S)xSminyT(xyd).subscriptΔ𝐼𝐶𝑃𝑆𝑇1𝐶𝑎𝑟𝑑𝑆subscript𝑥𝑆subscript𝑦𝑇subscriptdelimited-∥∥𝑥𝑦superscript𝑑\displaystyle\Delta_{ICP}(S,T)=\dfrac{1}{Card(S)}\sum_{x\in S}\min_{y\in T}\left(\left\lVert x-y\right\rVert_{\mathbb{R}^{d}}\right).

By minimizing this term one minimizes the average distance of the source points to the target. This asymmetric function can be seen as a partial matching dissimilarity term, being equal to 00 if S𝑆S is included in T𝑇T.

3.3.1 Implementation details

LDDMM is computed with the partial matching dissimilarity term and the localized mass preservation term Eq. 4. In the rest of the paper J𝐽J is written as follows:

J(v)=λ101vtV2𝑑t+Δ¯(ϕ1v(S),T)+λ2Rlocal(S,ϕ1v(S))𝐽𝑣subscript𝜆1superscriptsubscript01superscriptsubscriptnormsubscript𝑣𝑡𝑉2differential-d𝑡¯Δsuperscriptsubscriptitalic-ϕ1𝑣𝑆𝑇subscript𝜆2subscript𝑅𝑙𝑜𝑐𝑎𝑙𝑆superscriptsubscriptitalic-ϕ1𝑣𝑆\displaystyle J(v)=\lambda_{1}\int_{0}^{1}\|v_{t}\|_{V}^{2}dt+\underline{\Delta}({\phi_{1}^{v}(S)},T)+\lambda_{2}R_{local}(S,\phi_{1}^{v}(S))\,(8)

The optimization of this functional J𝐽J is performed using Limited-memory Broyden–Fletcher–Goldfarb–Shanno (L-BFGS) algorithm. In the LDDMM framework the cost of the deformations is controlled by the parameters λ1subscript𝜆1\lambda_{1} and λ2subscript𝜆2\lambda_{2}. To enforce smooth deformations of the surface as well as its ambient space, we set λ1subscript𝜆1\lambda_{1} to 107superscript10710^{7}, and we control the risk of shrinkage of the partial matching non-rigid registration by setting λ2=1subscript𝜆21\lambda_{2}=1. The Reproducing Kernel of the deformations is the same as in 2.5.3 allowing large deformations of the shapes along with more detailed ones. To better register the shapes, we also use a multi-scale registration scheme for the data attachment terms by iterative applications with σW=10mmsubscript𝜎𝑊10𝑚𝑚\sigma_{W}=10mm and σW=5mmsubscript𝜎𝑊5𝑚𝑚\sigma_{W}=5mm the output of the optimization at scale 101010 is used as input at the scale 555.

3.4 From Surface to Volume Registration

Both rigid deformation and LDDMM can be extended to the whole volume.

Rigid

Rigid+LDDMM

Translation+LDDMM

with ICP

with Partial Varifold

with Partial Varifold

Refer to caption
(a) POIs metric: 2.77mm,
Tumor metric : 9.12mm
Refer to caption
(b) POIs metric: 3.61mm,
Tumor metric : 9.32mm
Refer to caption
(c) POIs metric: 4.22mm,
Tumor metric : 2.86mm
Figure 5: Tiled visualization of the registrations for Patient 11 for which the approaches using rigid deformations (a,b) register correctly the vessels but fail to align the tumor. The tiles of the CBCT target volume are the dark ones, those of the deformed CT volumes are the light ones.

To do so, the voxel grid of the source volume is deformed and interpolated on the target volume. In the case of LDDMM deformations, the voxel grid is deformed with the diffeomorphism of 3superscript3\mathbb{R}^{3} as described in 2.3. The values of the interpolated grid are then reported in the initial volume, providing a registration of the CT volume onto the CBCT one as illustrated in Fig. 5.

The registrations of the volumes can be visualized to qualitatively assess the registration in the livers. To provide a 2D visualization of the results, we use in Fig. 5 and Fig. 6 a tiled representation that alternatively shows two volumes. Such visualization allows to see the continuities between the volumes. Each tile contains a 2D view of the CT volume (light tiles) or the CBCT one (dark tiles). As the dynamics of the images are very different, and the tissues that emerge differ from one modality to another, we are interested in the continuity of the emerging structures such as vessels, liver parenchyma or tumors.

Rigid

Rigid

Translation+LDDMM

with ICP

with Partial Varifold

with Partial Varifold

Refer to caption
(a) POIs metric: 9.75mm
Refer to caption
(b) POIs metric : 8.53mm
Refer to caption
(c) POIs metric : 4.94mm
Refer to caption
(d) Tumor metric : 19.8mm
Refer to caption
(e) Tumor metric : 17.4mm
Refer to caption
(f) Tumor metric : 3.62mm
Figure 6: Tiled visualization of the registrations for Patient 2. The tiles of the CBCT target volume are the dark ones, those of the deformed CT volumes are the light ones. First row : sagittal view, second row : axial view.

3.5 Evaluation and Results

We recall that the key to clinical success is to register precisely the local area around the tumor despite the fact that this tumor is not segmented in CBCT (live) clinical routine (and thus not usable in the registration procedure). Therefore the liver registration is evaluated through the euclidean distance between the deformed points of interest of the CBCT and those of the CT. It is done similarly with the tumors landmarks. Since the POIs are more centered than the tumor landmarks (see Fig.3), this second evaluation is significant as we will further explain in the discussion. The detailed results per case are provided in Table 1 and Table 2. In addition, we evaluate the registration at the surface level, which provides an indication of the overall registration quality, and gives the physician an additional benchmark for the comparison of CT and CBCT volumes. We first compute the barycenters registrations between the surfaces and apply the resulting translations to the volumes.We obtain an average distance of 18.3mm18.3𝑚𝑚18.3mm between the POIs, and of 21.5mm21.5𝑚𝑚21.5mm between the tumors landmarks. We show these values as red lines in the corresponding figures. They illustrate what the physicians can quickly obtain during the procedures, registering the volumes in translation by clicking one corresponding point in both modalities. As a reference method for the rigid registration, we also computed the ICP registration directly based on the distance between the points of interest. This registration setting is the only one to exploit the annotated landmarks as input and it will only be used for quantitative comparison.

Therefore the liver registration is evaluated through the euclidean distance between the deformed points of interest of the CBCT and those of the CT. It is done similarly with the tumors landmarks. Since the POIs are more centered than the tumor landmarks (see Fig.3), this second evaluation is significant as we will further explain in the discussion. The detailed results per case are provided in Table 1 and Table 2. In addition, we evaluate the registration at the surface level, which provides an indication of the overall registration quality, and gives the physician an additional benchmark for the comparison of CT and CBCT volumes. We first compute the barycenters registrations between the surfaces and apply the resulting translations to the volumes.We obtain an average distance of 18.3mm18.3𝑚𝑚18.3mm between the POIs, and of 21.5mm21.5𝑚𝑚21.5mm between the tumors landmarks. We show these values as red lines in the corresponding figures. They illustrate what the physicians can quickly obtain during the procedures, registering the volumes in translation by clicking one corresponding point in both modalities.

3.5.1 Evaluation on the POIs

We computed the euclidean distance between the POIs in the target volumes and the deformed ones. The results are presented in two figures: the first one (Fig. 7) provides a detail of the distances between the POIs as a function of the average distances from the points of the deformed surface to those of the target surface. This gives an idea of the distance between the edges of the liver after registration and the influence on the distance between the POIs. The associated box plots in Fig. 8 provide a summary of the interest point registration results according to the method used.

Refer to caption
Figure 7: Registration’s evaluation on the Points of Interest. The non-rigid LDDMM deformations based on partial matching allow robust surface registration while ensuring consistent deformation of the POIs. The red line corresponds to the average metric on POIs using barycenters registration.

The right box in Fig. 8 corresponds to the ICP rigid registration based on the POIs for the data attachment term and is used as reference. Note that this box shows that the variations cannot be explained by rigid deformations only. We observe in Fig. 7 that the LDDMM deformations allow a consistent and robust registration of the surfaces with an average distance of the deformed source points to the target of about 2mm2𝑚𝑚2mm in average. This cannot be achieved by only rigid deformations guided by ICP (4mm4𝑚𝑚4mm in average), but must be validated with other metric to assess the quality of the deformation applied to the whole livers volumes. In terms of POIs distances, none of the three methods illustrated in this scatter plot shows significant difference with the others, as validated in Fig. 8.

Each of them performs differently depending on which patient they are evaluated as one can see in the detailed table in Appendix A, but none of them stands out for the POIs metric. The best average performance 5.78mm±5.32plus-or-minus5.78𝑚𝑚5.325.78mm\pm 5.32 is achieved with the translation+LDDMM deformation guided by our partial dissimilarity term yet it is not significantly better that the rigid ICP (6.49mm±5.18plus-or-minus6.49𝑚𝑚5.186.49mm\pm 5.18) or the rigid+LDDMM method (6.54mm±5.09plus-or-minus6.54𝑚𝑚5.096.54mm\pm 5.09). When referring to the details in Appendix A, we see that the LDDMM deformations significantly improve the translations (reducing by 44%percent4444\% the distance between the POIs). However, rigid registrations provide a poor initialization for the LDDMM deformations.

Refer to caption
Figure 8: Registration’s evaluation on the Points of Interest. The rightmost box corresponds to the reference rigid registration of the POIs, hence the best possible results for rigid deformations. The red line corresponds to the average metric on POIs using barycenters registration.

By looking at the rotations angles obtained with the ICP based on the surfaces in Table 3 (Appendix C), we observe a difference with those obtained with the reference rigid registration based on the POIs. The wrong rotations of the rigid ICP based on the surfaces come from the truncation of the source which can be interpreted as less constraints for the registration problem. Similar results are observed for the rigid registration guided by the partial varifold term. In such cases, the LDDMM fails to compensate for the error that causes the non-rigid deformation to start in a local minimum. It is illustrated in Fig. 6, where the vessel and the tumor are clearly mismatched for the volumes deformed by approaches using a rigid transformation.

Inherently, we will not be able to do better than the reference method based on POIs, but we observe that the surface-based registration provides satisfactory results on the whole. When viewing the results, the points of interest are quickly found from one volume to another, even for Patient 14 which is the outlier. Even in this case (first row of Appendix D) we can see that the structures are not so far apart visually, which illustrates a certain robustness of the registrations. In particular, the partial varifold term allows both rigid and non-rigid consistent registrations with respect to the metric on the POIs.

Fig. 5 displays the results for Patient 11. This case corresponds to the best result in terms of POIs distance (2.77mm2.77𝑚𝑚2.77mm), which is achieved by the rigid method guided by the ICP. Yet this case illustrates that a good alignment of the POIs does not guarantee a good alignment of the tumors: tumors boundaries have been highlighted for better visibility.

3.5.2 Evaluation on the Tumors

In the Figure 9 we show the metric results for the lesions landmarks that we resume per approach in Figure 10 and a detailed table is provided in Appendix B.

Refer to caption
Figure 9: Registration’s evaluation on the Tumors Landmarks. Only the Translation + LDDMM deformation method using Partial Matching preserves the same level of performance on the Tumors Landmarks as for the metric on POIs. The red line corresponds to the average metric on tumors using barycenters registration. The outlier (Patient 14) is excluded from this evaluation.

The first remarkable result is that the methods using rigid deformations fail to register the tumors closer than about 1cm1𝑐𝑚1cm in average while the translation+LDDMM guided by the partial varifold term maintains the same performance level as for the POIs metric with an average distance of 5.13mm5.13𝑚𝑚5.13mm. In the scatter plot of Fig. 9 we observe that the rigid ICP and the rigid+LDDMM are more spread than in the scatter plot with the metric on the POIs. In particular, the reference deformation optimized with the POIs does not perform well on the tumor registration. The main reason is that none of the POIs is located on the tumor. In fact the results of rigid ICP and rigid+LDDMM Partial Varifolds are similar to those of the reference rigid registration. These observations suggest that the rigid deformation, based on surfaces or POIs, is not always the global solution to the volume registration and may lead to local minimum. In addition, the non-rigid deformations driven by LDDMM do not improve rigid registration, despite the limitation of the rotation angles.

Refer to caption
Figure 10: Registration’s evaluation on the tumors landmarks. The rightmost box corresponds to the application of the rigid registration computed with the POIs. The red line corresponds to the average metric on tumors using barycenters registration.

There is a clear difference between these methods and the registration with translation+LDDMM.

Fig. 6 (Patient 2), second row, shows a case for which the translation+LDDMM was better overall. In such case, the rotations based on the surfaces could not explain the registration between the volumes with a poor result on the lesion metric (about 17.5mm17.5𝑚𝑚17.5mm). On the contrary, the translation only guided by partial matching shows performance of 10.8mm10.8𝑚𝑚10.8mm that is further improved by 7mm7𝑚𝑚7mm with LDDMM for a distance between the lesion landmarks of 3.62mm3.62𝑚𝑚3.62mm.

In Appendix D, first row, is illustrated the worst case (Patient 14) for which the infiltrated tumor was not annotated, and the liver is hardly visible in CBCT. Comparing the results of rigid+LDDMM in Appendix B and Appendix A, we see that the LDDMM deformations fail to improve significantly the rigid registration guided by the partial matching in the space of varifolds both regarding the POIs metric and the tumors one. The best initialization for the non-rigid deformations of LDDMM is the translation, providing consistent results for both metrics.

3.6 Discussion

We applied the proposed partial matching dissimilarity term to the registration of pre-op CT volumes on CBCT volumes acquired during the interventions based on segmented liver surfaces. These surfaces, truncated in CBCT, present non-rigid deformations between them due to differences in time point and patient stances in each modality. Partial matching can be used in a rigid registration process, providing results equivalent to a standard method like ICP. It is important to note that the registered surfaces in this application are relatively smooth, which favors the ICP for the rigid registration part. However, this approach in the non-rigid case can lead to projecting several points on one point of the target, and does not take into account the local orientations of the objects or their resolution. On less regular anatomies, one could expect less good performances. Moreover, this approach tends to minimize the average distance from the deformed source to the target. In some cases, as for patient 2 or patient 9, the truncation allows a freedom of deformation which makes the method unsuitable and leads to errors, whereas the reference method generating rigid deformations allowed to obtain good results on both POIs and tumor landmarks. In some cases (Patients 1, 2, 9 for instance), the reference rigid method is providing better results than the rigid ICP based on the livers surfaces, which ensures that despite an acceptable global rigid deformation, the rigid ICP fails at retrieving the correct one using the surfaces to drive the registrations.

The proposed Partial Matching can also be used in LDDMM, providing the tools of computational anatomy and allowing non-rigid, yet regular, deformations. The diffeomorphic deformations that this generates lead to accurate registration of the surfaces of the livers (about 2mm2𝑚𝑚2mm on average), which gives the physician a first tool to easily compare CT and CBCT volumes during the procedure. However, the areas of interest for the procedures are also within the liver, and care must be taken to ensure that the non-rigid deformations generated from the surfaces generalize well within the liver volume.

The distance between the Points of Interest, close to the bifurcation of the proper hepatic artery, provide a first evaluation metric to the registration methods. However, since they do not cover the volume of the livers correctly, it does not allow to discriminate between the deformation models. Regarding their location, a rigid registration is sufficient to align them when it fails to extend to the tumors landmarks as illustrated in Fig. 5. In particular, the extremities of the livers seem to be deformed by non-rigid deformations which can be explained by the better performance of the translation+LDDMM regarding the distance on the tumor landmarks. In this case, the rigid deformations with rotation lead to a local minimum that the LDDMM are unable to compensate. On the contrary, translation+LDDMM provide a consistent registration of both POIs and tumors. This last finding indicates that the correct deformations to generate to register a liver from a CBCT acquisition to the liver from the CT acquisition are translations and local non-rigid deformations without large (or even no) rotations.

Although the methods based on surface registrations are sensitive to surface extraction, we have seen through one case illustrated in Appendix D that the proposed registrations remain suitable, despite the outlier (Patient 14) with respect to the metric on the POIs. In particular natural the regularization of the LDDMM associated to the one proposed in this paper provide a smooth and consistent non rigid registration of the surface and its ambient space, ensuring realistic registrations of the volumes.

Regarding the computation time, we are studying a non-rigid multi-modality volume registration solution with partial matching. The current computation time does not allow to use this registration as is in a real time procedure, however there are many levers to accelerate the diffeomorphic deformations, main source of computation cost. These solutions, such as limiting the number of control points (and therefore variables), could allow the use of this solution in an application used during the procedures.

The purpose of this study is to provide a visualization tool for the transcatheter directed liver therapies in minimally invasive procedures. The results obtained with the translation+LDDMM method thus provide robust metrics around 5mm5𝑚𝑚5mm on average, which is useful for physicians in the perspective of navigating their tools in the patient’s anatomy to locate structures that are hardly visible in the CBCT used during the procedure. Such registrations could facilitate the physician’s intervention by providing, for example through image fusion, an improved visualization of the pre-procedure CT volume tumor placed in the CBCT volume. This would allow the physician to avoid redoing a traditional CBCT to see the tumor correctly, thus limiting the X-ray dose sent to the patient and the time of the procedure.

4 Conclusion

In this paper we adapted dissimilarity metrics in the space of varifolds to guide partial shape matching and registration. This data attachment term is suited to different shapes comparison such as unions of curves or surfaces. As a clinical application, we showed that this new partial matching term is suitable for the registration of a truncated surface onto a complete one, providing realistic feature-based CT-CBCT volumes registration. Regarding the simplicity of the shapes, the rigid ICP shows equivalent results to rigid deformations associated with the proposed partial matching. Yet this term can also be associated with a LDDMM registration and allow diffeomorphic deformations. Provided a correct feature extraction, such registrations could facilitate the physicians procedures during transcatheter directed liver therapies to treat primary and secondary liver malignancies.

In this application we only used one feature extracted from the volumes. In order to better align the CT and CBCT volumes, we could extend the feature extraction to different structures that can be observed in both modalities, such as the hepatic vascular tree, which is partially visible in the CT and in detail in the CBCT. The dissimilarity term introduced can also be modified to fit the problem of registering a complete shape onto a truncated one. The main bottleneck of our approach is the risk of shrinkage when no easy registration is possible. Apart from regularization proposed in this paper, a promising lead to tackle this issue would be to also find a subset of the target to include in the source, such as done in Bronstein et al. (2009).


Acknowledgments

This work was supported by GE Healthcare. We also would like to thank Raphael Doustaly for his technical support and discussions on the subject of multi-modality volumes registration.


Ethical Standards

The work follows appropriate ethical standards in conducting research and writing the manuscript, following all applicable laws and regulations regarding treatment of animals or human subjects.


Conflicts of Interest

We declare we don’t have conflicts of interest.

References

  • Aiger et al. (2008) Dror Aiger, Niloy Mitra, and Daniel Cohen-Or. 4-points congruent sets for robust pairwise surface registration. 35th International Conference on Computer Graphics and Interactive Techniques (SIGGRAPH’08), 27, 08 2008. doi: 10.1145/1399504.1360684.
  • Antonsanti et al. (2021) Pierre-Louis Antonsanti, Joan Glaunès, Thomas Benseghir, Vincent Jugnon, and Irène Kaltenmark. Partial matching in the space of varifolds. Information Processing in Medical Imaging, 2021.
  • Bashiri et al. (2018) Fereshteh S. Bashiri, Ahmadreza Baghaie, Reihaneh Rostami, Zeyun Yu, and Roshan D’Souza. Multi-modal medical image registration with full or partial data: A manifold learning approach. Journal of Imaging, 5:5, 12 2018. doi: 10.3390/jimaging5010005.
  • Bauer et al. (2021) Dominik Bauer, Tom Russ, Barbara Waldkirch, Christian Tönnes, William Segars, Lothar Schad, Frank Zöllner, and Alena-Kathrin Golla. Generation of annotated multimodal ground truth datasets for abdominal medical image registration. International Journal of Computer Assisted Radiology and Surgery, 16, 05 2021. doi: 10.1007/s11548-021-02372-7.
  • Beg et al. (2005) Mirza Faisal Beg, Michael Miller, Alain Trouvé, and Laurent Younes. Computing large deformation metric mappings via geodesic flows of diffeomorphisms. International Journal of Computer Vision, 61:139–157, 02 2005. doi: 10.1023/B:VISI.0000043755.93987.aa.
  • Bronstein et al. (2009) Alexander Bronstein, Michael Bronstein, Alfred Bruckstein, and Ron Kimmel. Partial similarity of objects, or how to compare a centaur to a horse. International Journal of Computer Vision, 84:163–183, 08 2009. doi: 10.1007/s11263-008-0147-3.
  • Bronstein et al. (2006) Alexander M. Bronstein, Michael M. Bronstein, and Ron Kimmel. Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching. Proceedings of the National Academy of Sciences, 103(5):1168–1172, 2006. ISSN 0027-8424. doi: 10.1073/pnas.0508601103. URL https://www.pnas.org/content/103/5/1168.
  • Charlier et al. (2021) Benjamin Charlier, Jean Feydy, Joan Alexis Glaunès, François-David Collin, and Ghislain Durif. Kernel operations on the gpu, with autodiff, without memory overflows. Journal of Machine Learning Research, 22(74):1–6, 2021. URL http://jmlr.org/papers/v22/20-275.html.
  • Charon and Trouvé (2013) Nicolas Charon and Alain Trouvé. The varifold representation of nonoriented shapes for diffeomorphic registration. SIAM Journal on Imaging Sciences, 6(4):2547–2580, 2013. doi: 10.1137/130918885.
  • Charon et al. (2020) Nicolas Charon, Benjamin Charlier, Joan Glaunès, Pietro Gori, and Pierre Roussillon. 12 - fidelity metrics between curves and surfaces: currents, varifolds, and normal cycles. In Xavier Pennec, Stefan Sommer, and Tom Fletcher, editors, Riemannian Geometric Statistics in Medical Image Analysis, pages 441 – 477. Academic Press, 2020. ISBN 978-0-12-814725-2. doi: https://doi.org/10.1016/B978-0-12-814725-2.00021-2. URL http://www.sciencedirect.com/science/article/pii/B9780128147252000212.
  • Christensen et al. (1996) G.E. Christensen, R.D. Rabbitt, and M.I. Miller. Deformable templates using large deformation kinematics. IEEE Transactions on Image Processing, 5(10):1435–1447, 1996. doi: 10.1109/83.536892.
  • Feragen et al. (2015) Aasa Feragen, Jens Petersen, Marleen de Bruijne, and et al. Geodesic atlas-based labeling of anatomical trees: Application and evaluation on airways extracted from ct. IEEE Transactions on Medical Imaging, 34:1212–1226, 2015.
  • Feydy et al. (2017) Jean Feydy, Benjamin Charlier, François-Xavier Vialard, and Gabriel Peyré. Optimal transport for diffeomorphic registration. Lecture Notes in Computer Science, page 291–299, 2017. ISSN 1611-3349. URL http://dx.doi.org/10.1007/978-3-319-66182-7˙34.
  • Ghosn et al. (2021) Mario Ghosn, H. Derbel, R. Kharrat andN. Oubaya, S. Mulé, J. Chalaye, H. Regnault, G. Amaddeo, E. Itti, A. Luciani, H. Kobeiter, and V. Tacher. Prediction of overall survival in patients with hepatocellular carcinoma treated with y-90 radioembolization by imaging response criteria. Diagnostic and Interventional Imaging, 102:35–44, 08 2021.
  • Glaunès (2005) Joan Glaunès. Transport par difféomorphismes de points, demesures et de courants pour la comparaison de formes et l’anatomie numérique.PhD thesis, Université Paris 13, 2005.
  • Halimi et al. (2019) O. Halimi, O. Litany, E. R. Rodolà, A. M. Bronstein, and R. Kimmel. Unsupervised learning of dense shape correspondence. 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pages 4365–4374, 2019. doi: 10.1109/CVPR.2019.00450.
  • Halimi et al. (2020) Oshri Halimi, Ido Imanuel, Or Litany, Giovanni Trappolini, Emanuele Rodolà, Leonidas J. Guibas, and Ron Kimmel. The whole is greater than the sum of its nonrigid parts. CoRR, abs/2001.09650, 2020. URL https://arxiv.org/abs/2001.09650.
  • Hsieh and Charon (2021) Hsi-Wei Hsieh and Nicolas Charon. Diffeomorphic registration with density changes for the analysis of imbalanced shapes. Information Processing in Medical Imaging, pages 31–42, 2021.
  • Jiang et al. (2021) Xingyu Jiang, Jiayi Ma, Guobao Xiao, Zhenfeng Shao, and Xiaojie Guo. A review of multimodal image matching: Methods and applications. Information Fusion, 73:22–71, 2021. ISSN 1566-2535. doi: https://doi.org/10.1016/j.inffus.2021.02.012. URL https://www.sciencedirect.com/science/article/pii/S156625352100035X.
  • Kaltenmark and Trouvé (2018) Irène Kaltenmark and Alain Trouvé. Estimation of a Growth Development with Partial Diffeomorphic Mappings. Quaterly of Applied MAthematics, 77:227–267, November 2018.
  • Kaltenmark et al. (2017) Irene Kaltenmark, Benjamin Charlier, and Nicolas Charon. A general framework for curve and surface comparison and registration with oriented varifolds. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), July 2017.
  • Miller et al. (2006) Michael I. Miller, Alain Trouvé, and Laurent Younes. Geodesic shooting for computational anatomy. Journal of Mathematical Imaging and Vision, 24(2):209–228, Mar 2006. ISSN 1573-7683.
  • Milletari et al. (2016) Fausto Milletari, Nassir Navab, and Seyed-Ahmad Ahmadi. V-net: Fully convolutional neural networks for volumetric medical image segmentation. 2016 fourth international conference on 3D vision (3DV), pages 565–571, 10 2016. doi: 10.1109/3DV.2016.79.
  • Mori et al. (2013) Kensaku Mori, Ichiro Sakuma, Yoshinobu Sato, Christian Barillot, and Nassir Navab, editors. Iterative Closest Curve: A Framework for Curvilinear Structure Registration Application to 2D/3D Coronary Arteries Registration, Berlin, Heidelberg, 2013. Springer Berlin Heidelberg.
  • Musy et al. (2021) Marco Musy, Guillaume Jacquenot, Giovanni Dalmasso, neoglez, Ruben de Bruin, Ahinoam Pollack, Federico Claudi, Codacy Badger, icemtel, Bane Sullivan, Brian Lerner, Daniel Hrisca, Diego Volpatto, Nico Schlömer, RichardScottOZ, Zhi-Qiang Zhou, and ilorevilo. marcomusy/vedo: 2021.0.7, November 2021. URL https://doi.org/10.5281/zenodo.5655358.
  • Ovsjanikov et al. (2012) Maks Ovsjanikov, Mirela Ben-Chen, Justin Solomon, Adrian Butscher, and Leonidas Guibas. Functional maps: A flexible representation of maps between shapes. ACM Trans. Graph., 31(4), July 2012. ISSN 0730-0301. doi: 10.1145/2185520.2185526.
  • Paszke et al. (2017) Adam Paszke, Sam Gross, Soumith Chintala, Gregory Chanan, Edward Yang, Zachary DeVito, Zeming Lin, Alban Desmaison, Luca Antiga, and Adam Lerer. Automatic differentiation in PyTorch. In NIPS Autodiff Workshop, 2017.
  • Rajagopal and Venkatesan (2016) M. Rajagopal and AM. Venkatesan. Image fusion and navigation platforms for percutaneous image-guided interventions. Abdom Radiol (NY), 41:620–628, 04 2016. doi: 10.1007/s00261-016-0645-7.
  • Rodolà et al. (2017) E. Rodolà, L. Cosmo, M. M. Bronstein, A. Torsello, and D. Cremers. Partial functional correspondence. Computer Graphics Forum, 36(1):222–236, 2017. doi: https://doi.org/10.1111/cgf.12797.
  • Rodolà et al. (2013) Emanuele Rodolà, Andrea Albarelli, Filippo Bergamasco, and Andrea Torsello. A scale independent selection process for 3d object recognition in cluttered scenes. International Journal of Computer Vision, 102, 03 2013. doi: 10.1007/s11263-012-0568-x.
  • Sotiras et al. (2013) A. Sotiras, C. Davatzikos, and N. Paragios. Deformable medical image registration: A survey. IEEE Transactions on Medical Imaging, 32(7):1153–1190, July 2013. ISSN 1558-254X. doi: 10.1109/TMI.2013.2265603.
  • Sukurdeep et al. (2021) Yashil Sukurdeep, Martin Bauer, and Nicolas Charon. A new variational model for the analysis of shape graphs with partial matching constraints. arXiv preprint arXiv:2105.00678, 2021.
  • Tacher et al. (2015) V. Tacher, A. Radaelli, M. Lin, and JF. Geschwind. How i do it: Cone-beam ct during transarterial chemoembolization for liver cancer. Radiology, 274:320–334, 02 2015. doi: 10.1148/radiol.14131925.
  • Trouvé (1995) Alain Trouvé. Infinite-dimensional group action and pattern-recognition. COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 321(8):1031–1034, 1995.
  • van Kaick et al. (2011) Oliver van Kaick, Hao Zhang, Ghassan Hamarneh, and Daniel Cohen-Or. A survey on shape correspondence. Computer Graphics Forum, 30(6):1681–1707, 2011. URL https://onlinelibrary.wiley.com/doi/abs/10.1111/j.1467-8659.2011.01884.x.
  • van Kaick et al. (2013) Oliver van Kaick, Hao Zhang, and Ghassan Hamarneh. Bilateral maps for partial matching. Computer Graphics Forum (CGF), 09 2013. doi: 10.1111/cgf.12084.
  • Zhao et al. (2015) Qingyu Zhao, James Price, S. Pizer, M. Niethammer, R. Alterovitz, and J. Rosenman. Surface registration in the presence of missing patches and topology change. In MIUA, 2015.

A POIs Detailed Results per Patients

PatientsICP RigidRigid
Rigid
+ LDDMM
Translation
Translation
+ LDDMM
ICP Rigid
Based PoIs
Patient 05.184.294.1518.64.712.47
Patient 17.3322.515.814.17.864.32
Patient 29.759.888.5312.84.944.92
Patient 35.95.975.099.096.142.87
Patient 45.045.956.058.316.895.66
Patient 55.16.144.895.063.372.26
Patient 64.264.426.086.9110.81.28
Patient 74.062.933.756.363.61.74
Patient 84.723.554.765.873.672.36
Patient 913.77.49.1414.06.261.66
Patient 103.72.932.885.252.931.65
Patient 112.773.483.618.874.221.48
Patient 125.975.316.029.036.33.02
Patient 136.535.715.5613.45.62.47
Patient 1418.922.322.828.113.61.69
Patient 152.972.32.556.463.592.64
Patient 164.123.343.754.074.42.28
Patient 176.1711.03.15.725.322.34
Patient 187.177.055.7413.95.761.89
Average6.497.186.5410.35.792.58
Stdev3.935.834.955.92.661.18
Median5.185.715.098.875.322.34
Table 1: Average distance between the Points of Interest per case.

B Lesions Detailed Results per Patients

PatientsICP RigidRigid
Rigid
+ LDDMM
Translation
Translation
+ LDDMM
ICP Rigid
Based PoIs
Patient 05.193.945.1117.63.3113.6
Patient 111.218.26.051.412.935.2
Patient 219.818.817.410.83.622.21
Patient 316.616.816.016.711.214.0
Patient 47.149.347.929.786.9113.7
Patient 55.686.776.037.253.188.0
Patient 64.674.324.154.375.712.0
Patient 73.244.022.142.80.596.39
Patient 86.766.177.486.774.935.76
Patient 923.318.416.66.863.948.68
Patient 1013.914.415.113.08.819.15
Patient 119.127.499.323.662.8618.7
Patient 127.568.228.06.734.484.04
Patient 1321.421.217.722.78.5513.4
Patient 14NoneNoneNoneNoneNoneNone
Patient 156.697.368.289.496.3619.3
Patient 165.314.75.036.963.36.97
Patient 175.5612.58.227.297.372.87
Patient 187.837.757.2112.04.327.44
Average10.110.69.319.235.139.52
StDev6.065.714.85.372.565.08
Median7.357.987.967.274.48.34
Table 2: Average distance between the tumors landmarks per case. The invasive tumor could not be annotated for Patient 12.

C Rotations Deformations Comparison

Rigid ICP Based POIsRigid ICP Based Surfaces
PatientsXYZXYZ
Patient 0-1.15-11.5214.2-1.53-12.1810.7
Patient 1-5.58-11.680.8-9.69-6.513.89
Patient 2-8.66-6.28-0.03-17.39-2.590.64
Patient 3-13.49-0.112.58-13.030.511.33
Patient 4-9.023.17-10.8-8.370.93-9.45
Patient 5-2.37-4.13-2.43-4.96-1.931.89
Patient 6-5.09-1.27-3.64-6.420.65-4.96
Patient 7-6.132.37-5.04-4.850.85-3.43
Patient 8-6.364.986.14-6.813.452.47
Patient 9-0.77-5.458.57-3.49-12.566.15
Patient 102.496.943.18-0.726.713.68
Patient 11-10.15-5.211.52-9.34-3.620.27
Patient 125.14.96-6.65.34.18-4.14
Patient 13-5.25-2.7911.2-2.5-6.9310.2
Patient 143.3-12.94-4.14-9.25-16.266.0
Patient 15-2.386.39-5.4-3.886.68-5.35
Patient 161.71-1.561.45-2.71-2.010.31
Patient 17-0.93-1.014.24-4.11-2.337.57
Patient 18-3.2810.3-4.614.769.80.54
Table 3: Rigid ICP Rotation Values in degree along each axis, based on the Points of Interest and based on the Surfaces. In bold are highlighted the most important differences in terms of rotation angles.

D Worst Case Scenario : Bad Feature Extraction

Rigid

Rigid+LDDMM

Translation+LDDMM

with ICP

with Partial Varifold

with Partial Varifold

Refer to caption
(a) POIs metric: 18.9mm,
Surface metric : 10.1mm
Refer to caption
(b) POIs metric: 22.8mm,
Surface metric : 6.06mm
Refer to caption
(c) POIs metric: 13.5mm,
Surface metric : 4.22mm
Figure 11: Tiled visualization of the registrations for Patient 14. The infiltrated tumor could not be annotated. The tiles of the CBCT target volume are the dark ones, those of the deformed CT volumes are the light ones.