Total variation projection with first order schemes
- 1 November 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1325-1328
- https://doi.org/10.1109/icip.2009.5413571
Abstract
This paper proposes a new class of algorithms to compute the projection onto the set of images with a total variation bounded by a constant. The projection is computed on a dual formulation of the problem that is minimized using either a one-step gradient descent method or a multi-step Nesterov scheme. This yields iterative algorithms that compute soft thresholding of the dual vector fields. We show the convergence of the method with a convergence rate of O(1/k) for the one step method and O(1/k2) for the multi-step one, where k is the iteration number. The projection algorithm can be used as a building block in several applications, and we illusrtate it by solving linear inverse problems under total variation constraint. Numerical results show that our algorithm competes favorably with state-of-the-art TV projection methods to solve denoising, inpainting and deblurring problems.Keywords
This publication has 7 references indexed in Scilit:
- Total variation projection with first order schemesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Efficient Schemes for Total Variation Minimization Under Constraints in Image ProcessingSIAM Journal on Scientific Computing, 2009
- Signal Recovery by Proximal Forward-Backward SplittingMultiscale Modeling & Simulation, 2005
- Smooth minimization of non-smooth functionsMathematical Programming, 2004
- Image Restoration Subject to a Total Variation ConstraintIEEE Transactions on Image Processing, 2004
- An Algorithm for Total Variation Minimization and ApplicationsJournal of Mathematical Imaging and Vision, 2004
- Nonlinear total variation based noise removal algorithmsPhysica D: Nonlinear Phenomena, 1992