Primal-dual convex optimization in large deformation diffeomorphic metric mapping: LDDMM meets robust regularizers.

5 years ago

Primal-dual convex optimization in large deformation diffeomorphic metric mapping: LDDMM meets robust regularizers.

Hernandez

This paper proposes a method for primal-dual convex optimization in variational Large Deformation Diffeomorphic Metric Mapping problems formulated with robust regularizers and robust 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 consider three robust regularizers liable to provide acceptable results in diffeomorphic registration: Huber, V-Huber and Total Generalized Variation. The Huber norm is used in the image similarity term. The primal-dual equations are derived for the stationary and the non-stationary parameterizations of diffeomorphisms. The resulting algorithms have been implemented for running in the GPU using Cuda. For the most memory consuming methods, we have developed a multi-GPU implementation. The GPU implementations allowed us to perform an exhaustive evaluation study in NIREP and LPBA40 databases. The experiments showed that, for all the considered regularizers, the proposed method converges to diffeomorphic solutions while better preserving discontinuities at the boundaries of the objects compared to baseline diffeomorphic registration methods. In most cases, the evaluation showed a competitive performance for the robust regularizers, close to the performance of the baseline diffeomorphic registration methods.

Publisher URL: http://doi.org/10.1088/1361-6560/aa925a

DOI: 10.1088/1361-6560/aa925a