King's College London

Research portal

Forward-backward splitting in deformable image registration: A demons approach

Research output: Chapter in Book/Report/Conference proceedingConference paper

Original languageEnglish
Title of host publication2018 IEEE 15th International Symposium on Biomedical Imaging, ISBI 2018
PublisherIEEE Computer Society
Pages1065-1069
Number of pages5
Volume2018-April
ISBN (Electronic)9781538636367
DOIs
E-pub ahead of print24 May 2018
Event15th IEEE International Symposium on Biomedical Imaging, ISBI 2018 - Washington, United States
Duration: 4 Apr 20187 Apr 2018

Conference

Conference15th IEEE International Symposium on Biomedical Imaging, ISBI 2018
CountryUnited States
CityWashington
Period4/04/20187/04/2018

Documents

  • Forward-backward splitting in_EBNER_Publishedonline24May2018_GREEN AAM

    Forward_backward_splitting_in_EBNER_Publishedonline24May2018_GREEN_AAM.pdf, 415 KB, application/pdf

    Uploaded date:21 Jun 2018

    Version:Accepted author manuscript

    © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

King's Authors

Abstract

Efficient non-linear image registration implementations are key for many biomedical imaging applications. By using the classical demons approach, the associated optimization problem is solved by an alternate optimization scheme consisting of a gradient descent step followed by Gaussian smoothing. Despite being simple and powerful, the solution of the underlying relaxed formulation is not guaranteed to minimize the original global energy. Implicitly, however, this second step can be recast as the proximal map of the regularizer. This interpretation introduces a parallel to the more general Forward-Backward Splitting (FBS) scheme consisting of a forward gradient descent and proximal step. By shifting entirely to FBS, we can take advantage of the recent advances in FBS methods and solve the original, non-relaxed deformable registration problem for any type of differentiable similarity measure and convex regularization associated with a tractable proximal operator. Additionally, global convergence to a critical point is guaranteed under weak restrictions. For the first time in the context of image registration, we show that Tikhonov regularization breaks down to the simple use of B-Spline filtering in the proximal step. We demonstrate the versatility of FBS by encoding spatial transformation as displacement fields or free-form B-Spline deformations. We use state-of-the-art FBS solvers and compare their performance against the classical demons, the recently proposed inertial demons and the conjugate gradient optimizer. Numerical experiments performed on both synthetic and clinical data show the advantage of FBS in image registration in terms of both convergence and accuracy.

Download statistics

No data available

View graph of relations

© 2018 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454