Primal-Dual convex optimization in large deformation diffeomorphic registration with robust regularizers

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a method for primal-dual convex optimization in variational Large Deformation Diffeomorphic Metric Mapping (LDDMM) problems formulated with robust regularizers and image similarity metrics. The method is based on Chambolle and Pock primal-dual algorithm for solving general convex optimization problems. Diagonal preconditioning is used to ensure the convergence of the algorithm to the global minimum. We study three robust regularizers liable to provide acceptable results in diffeomorphic registration: Huber, V -Huber and Total Generalized Variation. Experiments in a 2D MRI data set with complex geometry show that, for all the considered regularizers, the proposed method is able to converge to diffeomorphic solutions. The method performs similarly to state of the art stationary LDDMM and log-domain diffeomorphic Demons in terms of the image similarity achieved after registration. In addition, evaluation in the 3D Non-Rigid Image Registration Project (NIREP) database shows an acceptable performance for second-order robust regularizers, close to the performance of the state of the art diffeomorphic registration methods.

Cite

CITATION STYLE

APA

Hernandez, M. (2015). Primal-Dual convex optimization in large deformation diffeomorphic registration with robust regularizers. In 26th British Machine Vision Conference, BMVC 2015 (pp. 851–8513). British Machine Vision Conference, BMVC. https://doi.org/10.5244/C.29.85

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free