Regularization graphs—a unified framework for variational regularization of inverse problems

From MaRDI portal
Publication:5043655

DOI10.1088/1361-6420/AC668DzbMATH Open1500.65020arXiv2111.03509OpenAlexW3212016137MaRDI QIDQ5043655FDOQ5043655

Marcello Carioni, M. Holler, K. Bredies

Publication date: 6 October 2022

Published in: Inverse Problems (Search for Journal in Brave)

Abstract: We introduce and study a mathematical framework for a broad class of regularization functionals for ill-posed inverse problems: Regularization Graphs. Regularization graphs allow to construct functionals using as building blocks linear operators and convex functionals, assembled by means of operators that can be seen as generalizations of classical infimal convolution operators. This class of functionals exhaustively covers existing regularization approaches and it is flexible enough to craft new ones in a simple and constructive way. We provide well-posedness and convergence results with the proposed class of functionals in a general setting. Further, we consider a bilevel optimization approach to learn optimal weights for such regularization graphs from training data. We demonstrate that this approach is capable of optimizing the structure and the complexity of a regularization graph, allowing, for example, to automatically select a combination of regularizers that is optimal for given training data.


Full work available at URL: https://arxiv.org/abs/2111.03509





Cites Work


Cited In (1)






This page was built for publication: Regularization graphs—a unified framework for variational regularization of inverse problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5043655)