Towards Off-the-grid Algorithms for Total Variation Regularized Inverse Problems

Abstract

We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed mesh, our approach exploits the structure of the solutions and consists in iteratively constructing a linear combination of indicator functions of simple polygons.

For the short conference version see arXiv:2104.06706v2. For the long journal version see arXiv:2104.06706v5

Cited by in corpus (2)

• Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach
• On extremal points for some vectorial total variation seminorms