arXiv Analytics

Sign in

arXiv:2001.05005 [math.OC]AbstractReferencesReviewsResources

Total Deep Variation for Linear Inverse Problems

Erich Kobler, Alexander Effland, Karl Kunisch, Thomas Pock

Published 2020-01-14Version 1

Diverse inverse problems in imaging can be cast as variational problems composed of a task-specific data fidelity term and a regularization term. In this paper, we propose a novel learnable general-purpose regularizer exploiting recent architectural design patterns from deep learning. We cast the learning problem as a discrete sampled optimal control problem, for which we derive the adjoint state equations and an optimality condition. By exploiting the variational structure of our approach, we perform a sensitivity analysis with respect to the learned parameters obtained from different training datasets. Moreover, we carry out a nonlinear eigenmode analysis, which reveals interesting properties of the learned regularizer. We show state-of-the-art performance for classical image restoration and medical image reconstruction problems.

Related articles: Most relevant | Search more
arXiv:2101.02776 [math.OC] (Published 2021-01-07)
The Nonconvex Geometry of Linear Inverse Problems
arXiv:1407.1598 [math.OC] (Published 2014-07-07, updated 2014-12-08)
Low Complexity Regularization of Linear Inverse Problems
arXiv:1012.0621 [math.OC] (Published 2010-12-03, updated 2012-03-29)
The Convex Geometry of Linear Inverse Problems