2020
DOI: 10.1007/978-3-030-59716-0_17
|View full text |Cite
|
Sign up to set email alerts
|

Pair-Wise and Group-Wise Deformation Consistency in Deep Registration Network

Abstract: This report is submitted as part of the requirement for the M.Eng. Computer Science program at UCL. It is substantially the result of my work except where explicitly indicated in the text. The report will be distributed to the internal and external examiners, but thereafter may not be copied or distributed except with permission from the author.2 The external supervisor has guided and cooperated with the author on Chapter 4 Interpolation of Noise Data in the Feature Space as detailed in .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
10
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
2
1
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(10 citation statements)
references
References 38 publications
0
10
0
Order By: Relevance
“…It can not ensure that the pair of DDFs satisfies a correspondence [35], i.e., the point-to-point mappings defined by U and V are consistent with each other. Notably, transformation-cycle, which could improve the consistency of a pair of DDFs [35], has been introduced in recent registration networks [36]- [38]. Unlike previous approaches, BiRegNet aims to jointly predict and regularize the forward and backward DDFs, and the transformation consistency is achieved by introducing a constraint loss as follows,…”
Section: Methodsmentioning
confidence: 99%
“…It can not ensure that the pair of DDFs satisfies a correspondence [35], i.e., the point-to-point mappings defined by U and V are consistent with each other. Notably, transformation-cycle, which could improve the consistency of a pair of DDFs [35], has been introduced in recent registration networks [36]- [38]. Unlike previous approaches, BiRegNet aims to jointly predict and regularize the forward and backward DDFs, and the transformation consistency is achieved by introducing a constraint loss as follows,…”
Section: Methodsmentioning
confidence: 99%
“…Since inverse consistency can reduce systematic bias caused by the order of input images and increase robustness, learningbased registration approaches have sought to incorporate this features. A number of works have attempted to promote symmetry by adding inverse-consistency losses [33][34][35][36][37][38][39][40] . These losses are generally based on computing two deformation fields (one with the order of the images switched), composing them, and penalizing the deviation from identity.…”
Section: Further Related Workmentioning
confidence: 99%
“…Basically, we used the iterative registration and group mean method (Joshi et al, 2004) to update the average warped image to obtain the final template. A DL-based group-wise image registration network (Gu et al, 2020) was employed to perform intersubject registration, wherein the conventional losses like the smoothness and the mean squared image intensity similarity losses, as well as the inverseconsistency loss were used for training the network. In the first iteration (Figure 2a), the initial template (blue) was set as the average of the inputs (green), and DL-registration was performed to register the input images onto the template, resulting in respective warped images (yellow).…”
Section: Astc Algorithm Detailsmentioning
confidence: 99%
“…For intersubject deformable registration, we trained a group-wise consistent CNN to preserve cycle consistency in the deformations among the images (Gu et al, 2020). The training strategy of this network is shown in Figure 3.…”
Section: Consistent Registration Networkmentioning
confidence: 99%
See 1 more Smart Citation