Some First-Order Algorithms for Total Variation Based Image Restoration
Journal of Mathematical Imaging and Vision
Projected Gradient Based Color Image Decomposition
SSVM '09 Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision
On Nonmonotone Chambolle Gradient Projection Algorithms for Total Variation Image Restoration
Journal of Mathematical Imaging and Vision
Compressive Algorithms--Adaptive Solutions of PDEs and Variational Problems
Proceedings of the 13th IMA International Conference on Mathematics of Surfaces XIII
Removing Multiplicative Noise by Douglas-Rachford Splitting Methods
Journal of Mathematical Imaging and Vision
Multiplicative Noise Removal Using L1 Fidelity on Frame Coefficients
Journal of Mathematical Imaging and Vision
Deblurring Poissonian images by split Bregman techniques
Journal of Visual Communication and Image Representation
Total variation projection with first order schemes
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Journal of Mathematical Imaging and Vision
An Augmented Lagrangian Method for TVg+L1-norm Minimization
Journal of Mathematical Imaging and Vision
Multidimensional Systems and Signal Processing
SIAM Journal on Scientific Computing
Operator Splittings, Bregman Methods and Frame Shrinkage in Image Processing
International Journal of Computer Vision
Proximal Algorithms for Multicomponent Image Recovery Problems
Journal of Mathematical Imaging and Vision
SIAM Journal on Imaging Sciences
NESTA: A Fast and Accurate First-Order Method for Sparse Recovery
SIAM Journal on Imaging Sciences
A Fast Algorithm for Euler's Elastica Model Using Augmented Lagrangian Method
SIAM Journal on Imaging Sciences
SIAM Journal on Imaging Sciences
A Regularization Parameter for Nonsmooth Tikhonov Regularization
SIAM Journal on Scientific Computing
Total Variation as a Local Filter
SIAM Journal on Imaging Sciences
Journal of Scientific Computing
Efficient minimization of the non-local potts model
SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Sparse Occlusion Detection with Optical Flow
International Journal of Computer Vision
Dual Norm Based Iterative Methods for Image Restoration
Journal of Mathematical Imaging and Vision
Continuous Multiclass Labeling Approaches and Algorithms
SIAM Journal on Imaging Sciences
Multiscale Texture Extraction with Hierarchical (BV,Gp,L2) Decomposition
Journal of Mathematical Imaging and Vision
A full second order variational model for multiscale texture analysis
Computational Optimization and Applications
Hi-index | 0.00 |
This paper presents new fast algorithms to minimize total variation and more generally $l^1$-norms under a general convex constraint. Such problems are standards of image processing. The algorithms are based on a recent advance in convex optimization proposed by Yurii Nesterov. Depending on the regularity of the data fidelity term, we solve either a primal problem or a dual problem. First we show that standard first-order schemes allow one to get solutions of precision $\epsilon$ in $O(\frac{1}{\epsilon^2})$ iterations at worst. We propose a scheme that allows one to obtain a solution of precision $\epsilon$ in $O(\frac{1}{\epsilon})$ iterations for a general convex constraint. For a strongly convex constraint, we solve a dual problem with a scheme that requires $O(\frac{1}{\sqrt{\epsilon}})$ iterations to get a solution of precision $\epsilon$. Finally we perform some numerical experiments which confirm the theoretical results on various problems of image processing.