Towards off-the-grid algorithms for total variation regularized inverse problems
From MaRDI portal
Publication:826229
DOI10.1007/978-3-030-75549-2_44zbMATH Open1497.65044arXiv2104.06706MaRDI QIDQ826229FDOQ826229
Authors: Vincent Duval, Romain Petit, Yohann De Castro 
Publication date: 20 December 2021
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.
Full work available at URL: https://arxiv.org/abs/2104.06706
Recommendations
- Towards off-the-grid algorithms for total variation regularized inverse problems
- A new iteratively total variational regularization for nonlinear inverse problems
- Randomized algorithms for large-scale inverse problems with general Tikhonov regularizations
- Regularization of linear inverse problems with total generalized variation
- On approximation in total variation penalization for image reconstruction and inverse problems
- scientific article; zbMATH DE number 1341939
- Iterative total variation schemes for nonlinear inverse problems
- On the acceleration of optimal regularization algorithms for linear ill-posed inverse problems
- Regularized total least squares approach for nonconvolutional linear inverse problems
- On the total-variation convergence of regularizing algorithms for ill-posed problems
Numerical optimization and variational techniques (65K10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Nonlinear total variation based noise removal algorithms
- Sets of finite perimeter and geometric variational problems. An introduction to geometric measure theory
- An introduction to the Cheeger problem,
- Isoperimetric Inequalities in Mathematical Physics. (AM-27)
- Approximation of maximal Cheeger sets by projection
- Towards a Mathematical Theory of Super‐resolution
- Connected components of sets of finite perimeter and applications to image processing
- Inverse problems in spaces of measures
- On representer theorems and convex regularization
- The alternating descent conditional gradient method for sparse inverse problems
- Functions with generalized gradient and generalized surfaces
- Evolution of characteristic functions of convex sets in the plane by the minimizing total variation flow
- Sparsity of solutions for variational inverse problems with finite-dimensional data
- The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy
Cited In (4)
- Off-the-Grid Curve Reconstruction through Divergence Regularization: An Extreme Point Result
- An algorithm for total variation regularization in high-dimensional linear problems
- Structured iterative hard thresholding with on- and off-grid applications
- Dynamical programming for off-the-grid dynamic inverse problems
This page was built for publication: Towards off-the-grid algorithms for total variation regularized inverse problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826229)
