Towards Off-the-grid Algorithms for Total Variation Regularized Inverse Problems
arXiv:2104.06706 · doi:10.1007/s10851-022-01115-w
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.
arXiv commentFor the short conference version see arXiv:2104.06706v2. For the long journal version see arXiv:2104.06706v5
References in corpus (5)
- The Sliding Frank-Wolfe Algorithm and its Application to Super-Resolution Microscopy
- Geometric properties of solutions to the total variation denoising problem
- Forward - Backward Greedy Algorithms for Atomic Norm Regularization
- Sparsity of solutions for variational inverse problems with finite-dimensional data
- A note on convergence of solutions of total variation regularized linear inverse problems