Deformation field correction to preserve topology for image registration
In this paper, the author addresses the issue of designing a theoretically well-motivated and computationally efficient method ensuring topology preservation on image-registration-related deformation fields. The model is motivated by a mathematical characterization of t...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2014-09-01
|
Series: | ESAIM: Proceedings and Surveys |
Online Access: | http://dx.doi.org/10.1051/proc/201445053 |
id |
doaj-7b5859f4f8b946348c579ed7180aed8e |
---|---|
record_format |
Article |
spelling |
doaj-7b5859f4f8b946348c579ed7180aed8e2021-07-15T14:07:21ZengEDP SciencesESAIM: Proceedings and Surveys2267-30592014-09-014551252210.1051/proc/201445053proc144553Deformation field correction to preserve topology for image registrationOzeré Solène0Laboratoire de Mathématiques de l’INSA de RouenIn this paper, the author addresses the issue of designing a theoretically well-motivated and computationally efficient method ensuring topology preservation on image-registration-related deformation fields. The model is motivated by a mathematical characterization of topology preservation for a deformation field mapping two subsets of Z2, namely, positivity of the four approximations to the Jacobian determinant of the deformation on a square patch. The first step of the proposed algorithm thus consists in correcting the gradient vector field of the deformation at the discrete level in order to fulfill this positivity condition. Once this step is achieved, it thus remains to reconstruct the deformation field, given its full set of discrete gradient vectors. The author propose to decompose the reconstruction problem into independent problems of smaller dimensions, yielding a natural parallelization of the computations and enabling us to reduce drastically the computational time (up to 80 in some applications). For each subdomain, a functional minimization problem under Lagrange interpolation constraints is introduced and its well-posedness is studied: existence/uniqueness of the solution, characterization of the solution, convergence of the method when the number of data increases to infinity, discretization with the Finite Element Method and discussion on the properties of the matrix involved in the linear system. Numerical simulations based on OpenMP parallelization and MKL multi-threading demonstrating the ability of the model to handle large deformations (contrary to classical methods) and the interest of having decomposed the problem into smaller ones are provided.http://dx.doi.org/10.1051/proc/201445053 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Ozeré Solène |
spellingShingle |
Ozeré Solène Deformation field correction to preserve topology for image registration ESAIM: Proceedings and Surveys |
author_facet |
Ozeré Solène |
author_sort |
Ozeré Solène |
title |
Deformation field correction to preserve topology for image
registration |
title_short |
Deformation field correction to preserve topology for image
registration |
title_full |
Deformation field correction to preserve topology for image
registration |
title_fullStr |
Deformation field correction to preserve topology for image
registration |
title_full_unstemmed |
Deformation field correction to preserve topology for image
registration |
title_sort |
deformation field correction to preserve topology for image
registration |
publisher |
EDP Sciences |
series |
ESAIM: Proceedings and Surveys |
issn |
2267-3059 |
publishDate |
2014-09-01 |
description |
In this paper, the author addresses the issue of designing a theoretically well-motivated
and computationally efficient method ensuring topology preservation on
image-registration-related deformation fields. The model is motivated by a mathematical
characterization of topology preservation for a deformation field mapping two subsets of
Z2, namely, positivity of the four
approximations to the Jacobian determinant of the deformation on a square patch. The first
step of the proposed algorithm thus consists in correcting the gradient vector field of
the deformation at the discrete level in order to fulfill this positivity condition. Once
this step is achieved, it thus remains to reconstruct the deformation field, given its
full set of discrete gradient vectors. The author propose to decompose the reconstruction
problem into independent problems of smaller dimensions, yielding a natural
parallelization of the computations and enabling us to reduce drastically the
computational time (up to 80 in some applications). For each subdomain, a functional
minimization problem under Lagrange interpolation constraints is introduced and its
well-posedness is studied: existence/uniqueness of the solution, characterization of the
solution, convergence of the method when the number of data increases to infinity,
discretization with the Finite Element Method and discussion on the properties of the
matrix involved in the linear system. Numerical simulations based on OpenMP
parallelization and MKL multi-threading demonstrating the ability of the model to handle
large deformations (contrary to classical methods) and the interest of having decomposed
the problem into smaller ones are provided. |
url |
http://dx.doi.org/10.1051/proc/201445053 |
work_keys_str_mv |
AT ozeresolene deformationfieldcorrectiontopreservetopologyforimageregistration |
_version_ |
1721300258335490048 |