# Symmetric Deformable Registration via Learning a Pseudomean for MR Brain Images

Authors: Xiaodan Sui; Yuanjie Zheng; Yunlong He; Weikuan Jia
Journal: Journal of Healthcare Engineering
 (2021)

---

## Abstract

Image registration is a fundamental task in medical imaging analysis, which is commonly used during image-guided interventions and data fusion. In this paper, we present a deep learning architecture to symmetrically learn and predict the deformation field between a pair of images in an unsupervised fashion. To achieve this, we design a deep regression network to predict a deformation field that can be used to align the template-subject image pair. Specifically, instead of estimating the single deformation pathway to align the images, herein, we predict two halfway deformations, which can move the original template and subject into a pseudomean space simultaneously. Therefore, we train a symmetric registration network (S-Net) in this paper. By using a symmetric strategy, the registration can be more accurate and robust particularly on the images with large anatomical variations. Moreover, the smoothness of the deformation is also significantly improved. Experimental results have demonstrated that the trained model can directly predict the symmetric deformations on new image pairs from different databases, consistently producing accurate and robust registration results.


---

## Body

## 1. Introduction

Computer models have become a usable method for solving biomedical engineering and are applied to the analysis and measurement of data in the biomedical field (e.g., material mechanical behavior measurement [1–4], medical image segmentation [5, 6], and registration [7–9]). Deformable image registration aims to align subject images onto a template space by gradually optimizing the spatial transformation fields consisting of voxel-to-voxel correspondences between template and subject images [10]. Deformable registration is a key procedure in clinical applications such as population analysis, longitudinal data analysis, and image-guided intervention. Many image registration algorithms have been proposed and applied to various imaging analysis tasks [7–9, 11–16]. Conventional registration algorithms achieve the task via typical optimization, which can be classified into either intensity-based registration [11–13] or feature-based registration [14–16]. In these methods, the deformation field is obtained by iteratively optimizing the image similarity metric with a smoothness regularization constraint.In recent years, deep learning has been widely applied in medical image analysis [17, 18]. And deep-learning-based registration methods have shown promising performance especially for efficiency, as the computational time can be significantly reduced from minutes to seconds. Since the ground-truth deformations are difficult to obtain in practice, some semisupervised [19] and unsupervised learning strategies [20–22] are more popular currently. Specifically, the spatial transformation network (STN) [23] is leveraged in the deep-learning-based registration framework so that the loss can be defined directly on the image similarity, instead of using ground-truth deformations as supervised information. When the model is well trained, in the application stage, the transformation field can be estimated for unseen image pairs, without the need for iterative optimization. Therefore, deep-learning-based registration is more flexible in real clinical use. Additionally, to further improve the registration accuracy, multiscale strategy [24, 25], diffeomorphic strategy [26], and inverse-consistent properties [27] are also incorporated in the deep-learning-based registration framework.However, for the aforementioned registration algorithms, it is difficult to accurately register the images with large anatomical variation, and the smoothness is even difficult to preserve and constrain for large deformation. Thus, it is essential to develop an algorithm, which can effectively register the images with large anatomical variations and, meanwhile, keep the transformation field smooth, so that the topology can be well preserved. In addition, symmetric diffeomorphic registration has achieved better performance overall, which estimates symmetrical deformation pathway from two objects (template and subject) to the intermediate point instead of a single pathway from template to subject [13, 28]. Inspired by these methods, we hope to add a symmetric image registration strategy to the unsupervised model.In this paper, we further investigate the deep-learning-based registration by considering the symmetric property. We propose a symmetric registration network (S-Net) by simultaneously aligning the subject and template images to an intermediate space, i.e., the pseudomean space. Specifically, instead of establishing the voxel-to-voxel correspondences in one pathway, i.e., from template space to subject space, we move the template and subject images symmetrically, until they meet in the pseudomean space. In this space, the image similarity is maximized. The main contribution of this work can be summarized as follows:(1)
We propose a symmetric registration network that can register images in the dual direction simultaneously. In this framework, the pseudomean space can be automatically learned by using the symmetric constraint without any supervised guidance.(2)
The symmetric property allows for estimating two short deformation pathways instead of directly estimating a long deformation pathway. It is more effective to register images with large anatomical variations. The final registration result can be more accurate and smoother.(3)
Under the symmetric framework, we can directly obtain the forward (register subject to template) and backward (register subject to template) transformation fields by using the trained S-Net. Therefore, the inverse consistency can be achieved without introducing any additional model or strategy.


## 2. Materials and Methods

The S-Net is trained in an unsupervised manner based on the proposed symmetric way. As shown in Figure1, the input of the network is a pair of template image IT and subject image IS, together with their difference map. Instead of directly estimating the deformation field ϕ to register the subject to template, we make the training of the registration network symmetric, i.e., the template and subject image both deform until reaching their pseudomean space. Two deformation pathways will be estimated under this framework: (1) ϕT is the deformation pathway between template and pseudomean space and (2) ϕS is the deformation pathway between subject and pseudomean space.Figure 1
Overview of our method. Learning the parameters of S-Net by unsupervised training. The input consists of subject imageIS, the template image IT , and their difference map; the outputs are the 3D displacement maps.Mathematically, the optimization of symmetric registration can be formulated by minimizing the image dissimilarity in the pseudomean space:(1)FIS,IT,ϕS,ϕT=MTIS,ϕS,TIT,ϕT+λRϕS,ϕT,where T∗,∗ is a deformation operation that can warp I by ϕ and M is the dissimilarity between the deformed subject image ISϕS and deformed template image ITϕT. R is a regularization term to constrain the smoothness of two symmetric deformations ϕT and ϕS. λ is a weight to balance the registration accuracy and deformation smoothness. In the training of the deformable registration network S-Net, M and R are used to define the loss function and T is the spatial transformation network [23] used to spatially transform the image based on the estimated transformation field. The details of training the symmetric registration network S-Net will be described in Section 2.1.In the testing stage, giving an unseen image pair and their difference maps, we can get their symmetric deformationsϕSandϕT. As shown in Figure 2, the final symmetric registration results can be obtained by composing the two predicted deformation pathways: the forward deformation can be formulated as F=ϕT∘ϕS−1, which can register the subject to template. The backward deformation can be formulated as F−1=ϕS∘ϕT−1 which can register the template to the subject. ϕT∘ϕS−1 is the inverse field of ϕS∘ϕT−1, and “∘” denotes the composition operator [28].Figure 2
The symmetric image registration scheme. (a) Illustration of the hypothesis of the symmetric image registration; (b) the whole deformation field from template to subject can be calculated byF=ϕT∘ϕS−1, and the inverse deformation field from subject to template can also be obtained by F−1=ϕS∘ϕT−1.
(a)(b)


### 2.1. Symmetric Network Design

For symmetric registration, the pseudomean is an intermediate space on the image manifold, and the distance between the pseudomean and the template should equal that between the pseudomean and the subject. Therefore, for each location/voxel, the deformation magnitudes ofϕT and ϕS should be equal to each other, while the direction should be opposite. Thus, during the training, the output of the network is only ϕT, and we can set ϕS=−ϕT. There are two advantages to using this symmetric setting. (1) The large local deformation can be more effectively estimated since we shorten the deformation pathway during registration. (2) We can easily keep the inverse consistency without introducing any additional constraint.The S-Net was designed based on the network architecture designed in VoxelMorph [20], which is lighter than the original U-Net [6] by reducing the redundant connections to adapt to the analysis of 3D images. The network output is the halfway deformation ϕT. Since we do not have the ground-truth deformations, herein, we apply the unsupervised training strategy [20–22]. Specifically, a spatial transformer network [23] provides a fully differentiable spatial transformation layer T that can transform the input image I by the output deformation ϕ, which is the output of the S-Net. Specifically, we use the trilinear interpolation in STN, and the operation T can be formulated as(2)TI,ϕ=∑v∈Nu+ϕuIv∏d∈x,y,z1−ud+ϕud−vd,where u=x,y,z is the voxel coordinate, Nu+ϕu is the eight neighbor voxels of u+ϕu in I, and d indicates three directions in 3D space. With STN, the loss defined by the image similarity can backpropagate to the S-Net, and the registration network can be trained in an unsupervised manner.


### 2.2. Loss Definition

#### 2.2.1. Symmetric Similarity Loss

The similarity loss of the registration task is used to evaluate the registration accuracy, and here, we define the similarity loss by SSD. Conventionally, the subject image should be warped to the template space by the output deformation field, and the loss is calculated in the template space. For the symmetric registration network, we define the similarity loss in the pseudomean space to penalize the symmetric property. Mathematically, it can be formulated as(3)ℒSimsym=TIS,ϕS−TIT,ϕT22,ϕS=−ϕT.By minimizing the symmetric similarity lossℒSimsym, the template and subject image will gradually register with each other, until they reach their pseudomean space. To further enhance the symmetric constraints and registration accuracy, we also define the similarity loss in both template and subject image space:(4)ℒSimIS⟶IT=TIS,ϕS∘ϕT−1−I2T2,ℒSimIT⟶IS=TIT,ϕT∘ϕS−1−I2S2,whereϕS∘ϕT−1 indicates the forward deformation pathway, which can transform the subject image to the template space, while ϕT∘ϕS−1 indicates the backward deformation pathway, which can transform the template image to the subject space. It worth noting that the output of the S-Net is the halfway deformation ϕT, and the symmetric loss ℒSimsym defined in the pseudomean space can well preserve the symmetric property, while ℒSimIS⟶IT and ℒSimIT⟶IS defined in the end image space can make the registration accurate. Therefore, the whole symmetric similarity loss can be summarized as ℒSim=ℒSimsym+ℒSimIS⟶IT+ℒSimIT⟶IS.


#### 2.2.2. Field Regularization Loss

The regularization loss is used to constrain the smoothness of the estimated deformation fieldϕT, which is important to preserve the topology. In S-Net, this regularization loss is only defined on ϕT (output of the network). The smoothness of ϕS can be automatically constrained since ϕS=−ϕT. In our work, three kinds of regularization loss, i.e., Laplace smoothness, zero constraint, and antifolds constraint, are used to penalize the smoothness.(1) Laplace smoothnessLLaplace: constraining the smoothness of the field ϕT, which is defined as(5)ℒLaplace=∑u∇2ϕTu22,where∇2ϕu is the second derivative of the field ϕTu at the voxel u.(2) Zero constraint: modifying the displacement value for avoiding unreasonable large deformations:(6)ℒZero=∑uϕTu22.(3) Antifolds constraint: adding an antifolds constraint [27] in the loss function to further enhance the smoothness constraint, avoiding folds, or crossing in the final deformation:(7)ℒAnti=∑uR∇ϕTu+1,where ∇ϕu is the gradient of the displacement map and the term R∇ϕu+1 is an index function to penalize the gradient of the deformation field with folds. If Q≤0, RQ=Q, and RQ=0, for otherwise.The final loss function for training the S-Net is(8)ℒLoss=ℒSim+ℒReg=ℒSimsym+ℒSimIS⟶IT+ℒSimIT⟶IS+αℒLap+βℒZero+γℒAnti,whereα, β, and γ are used to balance the weight for each term. In this work, we set α=1 and γ=100 in our experiment. For zero constraint term LZero, we set the weight β a small value as β=0.01, since the large value may influence the accuracy when estimating the large deformations.


### 2.3. Implementation and Training

The S-Net is implemented in Keras and trained on an NVIDIA Tesla V100 GPUs with 32 GB of video memory. The network is trained by using the Adam strategy [29]. We use four public databases, i.e., LONI LPBA40 [30], IBSR18 (https://www.nitrc.org/projects/ibsr), CUMC12 [31], and MGH10 [32] in our experiments. All images were preprocessed by using a standard pipeline, including skull stripping, resampling, and affine registration to the MNI152 template [33] by using FLIRT [34]. After preprocessing, the data are with the same size 192×224×192 (voxel size 1mm×1mm×1mm).We used 30 subjects from LONI LPBA40 dataset as the training data, and30×30=900 image pairs can be derived. The remaining 10 images were used as the testing data, where 10×9=90 image pairs can be derived. The other three datasets are also used as the testing data to further evaluate the effectiveness of the proposed method, and we have 18×17=306 image pairs from IBSR18, 12×11=132 image pairs from CUMC12, and 10×9=90 image pairs from MGH10. For more effective training, we trained S-Net in two stages. First, the network was pretrained with a small dataset, where we chose one image as template and all the remaining images as subject. In this scenario, we totally have 1×30=30 image pairs for training. The network was trained for 200 iterations per image pair at a learning rate of 1e−4. Then, we draw each two images as a template and subject pair, and we totally have 30×30=900 image pairs for further training the S-Net. 20 epochs were trained in this scenario, the learning rate is set to 1e−5, with a decay weight of 0.5 for every 2 epochs.


## 2.1. Symmetric Network Design

For symmetric registration, the pseudomean is an intermediate space on the image manifold, and the distance between the pseudomean and the template should equal that between the pseudomean and the subject. Therefore, for each location/voxel, the deformation magnitudes ofϕT and ϕS should be equal to each other, while the direction should be opposite. Thus, during the training, the output of the network is only ϕT, and we can set ϕS=−ϕT. There are two advantages to using this symmetric setting. (1) The large local deformation can be more effectively estimated since we shorten the deformation pathway during registration. (2) We can easily keep the inverse consistency without introducing any additional constraint.The S-Net was designed based on the network architecture designed in VoxelMorph [20], which is lighter than the original U-Net [6] by reducing the redundant connections to adapt to the analysis of 3D images. The network output is the halfway deformation ϕT. Since we do not have the ground-truth deformations, herein, we apply the unsupervised training strategy [20–22]. Specifically, a spatial transformer network [23] provides a fully differentiable spatial transformation layer T that can transform the input image I by the output deformation ϕ, which is the output of the S-Net. Specifically, we use the trilinear interpolation in STN, and the operation T can be formulated as(2)TI,ϕ=∑v∈Nu+ϕuIv∏d∈x,y,z1−ud+ϕud−vd,where u=x,y,z is the voxel coordinate, Nu+ϕu is the eight neighbor voxels of u+ϕu in I, and d indicates three directions in 3D space. With STN, the loss defined by the image similarity can backpropagate to the S-Net, and the registration network can be trained in an unsupervised manner.


## 2.2. Loss Definition

### 2.2.1. Symmetric Similarity Loss

The similarity loss of the registration task is used to evaluate the registration accuracy, and here, we define the similarity loss by SSD. Conventionally, the subject image should be warped to the template space by the output deformation field, and the loss is calculated in the template space. For the symmetric registration network, we define the similarity loss in the pseudomean space to penalize the symmetric property. Mathematically, it can be formulated as(3)ℒSimsym=TIS,ϕS−TIT,ϕT22,ϕS=−ϕT.By minimizing the symmetric similarity lossℒSimsym, the template and subject image will gradually register with each other, until they reach their pseudomean space. To further enhance the symmetric constraints and registration accuracy, we also define the similarity loss in both template and subject image space:(4)ℒSimIS⟶IT=TIS,ϕS∘ϕT−1−I2T2,ℒSimIT⟶IS=TIT,ϕT∘ϕS−1−I2S2,whereϕS∘ϕT−1 indicates the forward deformation pathway, which can transform the subject image to the template space, while ϕT∘ϕS−1 indicates the backward deformation pathway, which can transform the template image to the subject space. It worth noting that the output of the S-Net is the halfway deformation ϕT, and the symmetric loss ℒSimsym defined in the pseudomean space can well preserve the symmetric property, while ℒSimIS⟶IT and ℒSimIT⟶IS defined in the end image space can make the registration accurate. Therefore, the whole symmetric similarity loss can be summarized as ℒSim=ℒSimsym+ℒSimIS⟶IT+ℒSimIT⟶IS.


### 2.2.2. Field Regularization Loss

The regularization loss is used to constrain the smoothness of the estimated deformation fieldϕT, which is important to preserve the topology. In S-Net, this regularization loss is only defined on ϕT (output of the network). The smoothness of ϕS can be automatically constrained since ϕS=−ϕT. In our work, three kinds of regularization loss, i.e., Laplace smoothness, zero constraint, and antifolds constraint, are used to penalize the smoothness.(1) Laplace smoothnessLLaplace: constraining the smoothness of the field ϕT, which is defined as(5)ℒLaplace=∑u∇2ϕTu22,where∇2ϕu is the second derivative of the field ϕTu at the voxel u.(2) Zero constraint: modifying the displacement value for avoiding unreasonable large deformations:(6)ℒZero=∑uϕTu22.(3) Antifolds constraint: adding an antifolds constraint [27] in the loss function to further enhance the smoothness constraint, avoiding folds, or crossing in the final deformation:(7)ℒAnti=∑uR∇ϕTu+1,where ∇ϕu is the gradient of the displacement map and the term R∇ϕu+1 is an index function to penalize the gradient of the deformation field with folds. If Q≤0, RQ=Q, and RQ=0, for otherwise.The final loss function for training the S-Net is(8)ℒLoss=ℒSim+ℒReg=ℒSimsym+ℒSimIS⟶IT+ℒSimIT⟶IS+αℒLap+βℒZero+γℒAnti,whereα, β, and γ are used to balance the weight for each term. In this work, we set α=1 and γ=100 in our experiment. For zero constraint term LZero, we set the weight β a small value as β=0.01, since the large value may influence the accuracy when estimating the large deformations.


## 2.2.1. Symmetric Similarity Loss

The similarity loss of the registration task is used to evaluate the registration accuracy, and here, we define the similarity loss by SSD. Conventionally, the subject image should be warped to the template space by the output deformation field, and the loss is calculated in the template space. For the symmetric registration network, we define the similarity loss in the pseudomean space to penalize the symmetric property. Mathematically, it can be formulated as(3)ℒSimsym=TIS,ϕS−TIT,ϕT22,ϕS=−ϕT.By minimizing the symmetric similarity lossℒSimsym, the template and subject image will gradually register with each other, until they reach their pseudomean space. To further enhance the symmetric constraints and registration accuracy, we also define the similarity loss in both template and subject image space:(4)ℒSimIS⟶IT=TIS,ϕS∘ϕT−1−I2T2,ℒSimIT⟶IS=TIT,ϕT∘ϕS−1−I2S2,whereϕS∘ϕT−1 indicates the forward deformation pathway, which can transform the subject image to the template space, while ϕT∘ϕS−1 indicates the backward deformation pathway, which can transform the template image to the subject space. It worth noting that the output of the S-Net is the halfway deformation ϕT, and the symmetric loss ℒSimsym defined in the pseudomean space can well preserve the symmetric property, while ℒSimIS⟶IT and ℒSimIT⟶IS defined in the end image space can make the registration accurate. Therefore, the whole symmetric similarity loss can be summarized as ℒSim=ℒSimsym+ℒSimIS⟶IT+ℒSimIT⟶IS.


## 2.2.2. Field Regularization Loss

The regularization loss is used to constrain the smoothness of the estimated deformation fieldϕT, which is important to preserve the topology. In S-Net, this regularization loss is only defined on ϕT (output of the network). The smoothness of ϕS can be automatically constrained since ϕS=−ϕT. In our work, three kinds of regularization loss, i.e., Laplace smoothness, zero constraint, and antifolds constraint, are used to penalize the smoothness.(1) Laplace smoothnessLLaplace: constraining the smoothness of the field ϕT, which is defined as(5)ℒLaplace=∑u∇2ϕTu22,where∇2ϕu is the second derivative of the field ϕTu at the voxel u.(2) Zero constraint: modifying the displacement value for avoiding unreasonable large deformations:(6)ℒZero=∑uϕTu22.(3) Antifolds constraint: adding an antifolds constraint [27] in the loss function to further enhance the smoothness constraint, avoiding folds, or crossing in the final deformation:(7)ℒAnti=∑uR∇ϕTu+1,where ∇ϕu is the gradient of the displacement map and the term R∇ϕu+1 is an index function to penalize the gradient of the deformation field with folds. If Q≤0, RQ=Q, and RQ=0, for otherwise.The final loss function for training the S-Net is(8)ℒLoss=ℒSim+ℒReg=ℒSimsym+ℒSimIS⟶IT+ℒSimIT⟶IS+αℒLap+βℒZero+γℒAnti,whereα, β, and γ are used to balance the weight for each term. In this work, we set α=1 and γ=100 in our experiment. For zero constraint term LZero, we set the weight β a small value as β=0.01, since the large value may influence the accuracy when estimating the large deformations.


## 2.3. Implementation and Training

The S-Net is implemented in Keras and trained on an NVIDIA Tesla V100 GPUs with 32 GB of video memory. The network is trained by using the Adam strategy [29]. We use four public databases, i.e., LONI LPBA40 [30], IBSR18 (https://www.nitrc.org/projects/ibsr), CUMC12 [31], and MGH10 [32] in our experiments. All images were preprocessed by using a standard pipeline, including skull stripping, resampling, and affine registration to the MNI152 template [33] by using FLIRT [34]. After preprocessing, the data are with the same size 192×224×192 (voxel size 1mm×1mm×1mm).We used 30 subjects from LONI LPBA40 dataset as the training data, and30×30=900 image pairs can be derived. The remaining 10 images were used as the testing data, where 10×9=90 image pairs can be derived. The other three datasets are also used as the testing data to further evaluate the effectiveness of the proposed method, and we have 18×17=306 image pairs from IBSR18, 12×11=132 image pairs from CUMC12, and 10×9=90 image pairs from MGH10. For more effective training, we trained S-Net in two stages. First, the network was pretrained with a small dataset, where we chose one image as template and all the remaining images as subject. In this scenario, we totally have 1×30=30 image pairs for training. The network was trained for 200 iterations per image pair at a learning rate of 1e−4. Then, we draw each two images as a template and subject pair, and we totally have 30×30=900 image pairs for further training the S-Net. 20 epochs were trained in this scenario, the learning rate is set to 1e−5, with a decay weight of 0.5 for every 2 epochs.


## 3. Results

We have compared our results with three state-of-the-art registration methods, namely, D. Demons [12], SyN [13], and VoxelMorph [20]. Demons and SyN are typical deformable registration methods enforced successfully for the medical image registration task, and VoxelMorph is a learning-based framework that defines registration as a learnable parametric function. We conducted the experiment and measured the registration accuracy based on the volumetric overlap of brain ROIs. The overall registration accuracy was computed in the form of a Dice Similarity Coefficient (DSC) score DiceRiS,RiT=2RiS∩RiT/RiS+RiT, for each ROI, with RiS and RiT being the corresponding anatomical regions i in the subject and template image. Additionally, we also evaluate the smoothness of the transformation map by using the Jacobian determinant Jϕu. Transformation map is considered smoothness when Jϕu>0, where Jϕu=Dϕ−1u [35]. And, the overall folds of the estimated displacement map are defined in u:Jϕu<0.The results of DSC scores and runtimes are shown in Table1 compared with those state-of-the-art registration methods (Demons, SyN, and VoxelMorph). The results show that the proposed method performs significantly better than VoxelMorph (learning-based method without using a symmetric training manner). For some datasets, our approach even outperforms SyN, which was among the state-of-the-art brain image registration algorithms and only took about 3.6 seconds to register two brain volume data efficiently. Those learning-based methods, compared with the regular scenario, have shorter runtime, and also performance hardly deteriorates. In Table 2, we present the folds in the estimated displacement maps of the proposed method and the baseline method. The results show that the displacement maps are estimated by the proposed symmetric registration network smoothness more than by the model without asymmetric strategy in most cases by a large margin.Table 1
Dice score (%) for subject-to-subject alignment using Demons, SyN, VoxelMorph, and the proposed S-Net.
DatasetD. DemonsSyN (CC)VoxelMorph (CC)VoxelMorph (MSE)Proposed methodLPBA4068.7± 2.471.3 ± 1.871.2± 2.871.6± 2.471.8 ± 2.1IBSR1854.6± 2.257.4 ± 2.454.2± 3.455.2± 2.956.8 ± 2.5CUMC1253.1± 3.454.1 ± 2.851.8± 4.153.1± 3.554.4 ± 3.2MGH1060.4± 2.562.1 ± 2.459.6± 2.960.2± 2.662.4 ± 2.4Time (s)11413300.310.313.6Table 2
Folds (Jϕp<0) results for subject-to-subject alignment using Demons, SyN, VoxelMorph, and the proposed S-NET. Folds refer to the average number of folds.
DatasetD. DemonsSyN (CC)VoxelMorph (CC)VoxelMorph (MSE)Proposed methodLPBA4013.71± 2.91028.52± 14.9244.04± 13.833.28 ± 0.78IBSR1815.59± 8.14044.26± 15.3167.57± 19.597.56 ± 1.86CUMC1221.02± 9.38039.37± 11.6548.92± 15.287.29 ± 1.47MGH1018.92± 6.54042.17± 13.2656.72± 16.766.63 ± 1.53The respective results and intermediate results are also shown in Figures3(b)–3(e) (final warped template image, middle warped subject image, middle warped template image, and final warped subject image, respectively). The S-Net works better than directly registering images in a single pathway: not only the registration accuracy but also the smoothness is also largely improved. This indicates that the proposed symmetric training strategy can effectively estimate large local deformations and the estimated field is smoother.Figure 3
The results of the S-Net. From left to right, the column shows subject, final warped template image, middle warped subject image, middle warped template image, final warped subject image, and template image. (a) Subject image. (b) Final warped template image. (c) Middle warped subject image. (d) Middle warped template image. (e) Final warped subject image. (f) Template image.
(a)(b)(c)(d)(e)(f)It is worth noting that S-Net achieves image registration tasks in an unsupervised end-to-end fashion by using an image similarity metric for optimization so that the training of this S-Net does not require the known deformation field, which is difficult to obtain for medical image registration. Furthermore, we have also evaluated our framework for the number of folds with the traditional registration method and single-direction deep-learning-based registration method. The deformation maps estimated by the proposed S-Net tend to be smoother, since the symmetric displacement map only needs half pathway, instead of a long pathway, which is easier to penalize the smoothness. Experimental results showed that our method successfully reduces the folds of estimated maps while providing more accurate registration results.


## 4. Discussion

S-Net learns for image registration tasks in an unsupervised end-to-end fashion using an image similarity metric for optimization so that the training for this S-Net does not require the known deformation field, which is difficult to obtain for medical image registration. Furthermore, we have also evaluated our framework for the number of folds with the traditional registration methods and single-direction deep-learning-based registration methods. The deformation maps estimated by the proposed S-NET tend to be smoother, since the symmetric displacement map only needs a half pathway, instead of a long pathway, which is easier to penalize the smoothness. Experimental results showed that our method successfully reduces the folds of estimated maps while providing more accurate registration results.The total loss function in S-NET consists of two types of six losses. However, the multiple losses weight (hyperparameters) of our S-NET training is hard to balance. Therefore, we did some experiments to determine the weight of multiple losses in Figure4. We set α=1 and β=0.01 that can achieve good performance, and after γ>100, it has little effect on the results. In our experiment, we set α=1, β=0.01, and γ=100. It is difficult to balance multiple losses is a common problem in deep-learning-based registration methods. In future work, we hope that we can learn hyperparameters through learning.Figure 4
Effect of varying the regularization parametersα,β, and γ on Dice score. (a) The best results occur when α=1 and β and γ are fixed at 0.01 and 100. (b) The best results occur when β=0.01 and α and γ are fixed at 1 and 100. (c) The best results occur when γ=100 and α and β are fixed at 1 and 0.01. As the weight increases, the results rarely change.
(a)(b)(c)


## 5. Conclusion

We presented a new symmetric training strategy for an unsupervised deep-learning-based registration framework, which can better estimate the large local deformation during registration. In particular, we utilize a pseudomean as an intermediate target registration space, and a long deformation pathway can be divided into two short deformation pathways. Experimental results have shown promising registration performance for both accuracy and field smoothness.



---

*Source: 5520196-2021-04-23.xml*