The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
Abstract
This paper studies gradient-based schemes for image denoising and deblurring problems based on the discretized total variation (TV) minimization model with constraints. We derive a fast algorithm for the constrained TV-based image deburring problem. To achieve this task, we combine an acceleration of the well known dual approach to the denoising problem with a novel monotone version of a fast iterative shrinkage/thresholding algorithm (FISTA) we have recently introduced. The resulting gradient-based algorithm shares a remarkable simplicity together with a proven global rate of convergence which is significantly better than currently known gradient projections-based methods. Our results are applicable to both the anisotropic and isotropic discretized TV functionals. Initial numerical results demonstrate the viability and efficiency of the proposed algorithms on image deblurring problems with box constraints.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nonlinear total variation based noise removal algorithms
Rudin, L. I., Osher, S., & Fatemi, E. (1992) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(92)90242-f · Cited by 15,704
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Self-citationBertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Sturm, J. F. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805766 · Cited by 7,377
Regularization of Inverse Problems
Engl, H. W., Hanke, M., & Neubauer, A. (1996) · Springer eBooks · doi:10.1007/978-94-009-1740-8 · Cited by 5,275
An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.
Daubechies, I., Defrise, M., & De Mol, C. (2004) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.20042 · Cited by 4,958
Finite-Dimensional Variational Inequalities and Complementarity Problems
(2004) · Springer Series in Operations Research and Financial Engineering · doi:10.1007/b97544 · Cited by 3,521
Numerical Methods for Least Squares Problems
Björck, Å. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971484 · Cited by 3,257
chambolle (2004) · doi:10.1023/b:jmiv.0000011321.19549.88 · Cited by 3,227
Numerical methods for least squares problems
(1996) · Choice Reviews Online · doi:10.5860/choice.34-1602 · Cited by 3,007
Signal Recovery by Proximal Forward-Backward Splitting
Combettes, P. L., & Wajs, V. R. (2005) · Multiscale Modeling & Simulation · doi:10.1137/050626090 · Cited by 2,678
A method for solving the convex programming problem with convergence rate O(1/k^2)
Nesterov, Y. E. (1983) · Доклады Академии наук · Cited by 2,662
Weik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
A New TwIST: Two-Step Iterative Shrinkage/Thresholding Algorithms for Image Restoration
Bioucas-Dias, J. M., & Figueiredo, M. A. T. (2007) · IEEE Transactions on Image Processing · doi:10.1109/tip.2007.909319 · Cited by 2,064
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5109 · Cited by 1,755
REGULARIZATION TOOLS: A Matlab package for analysis and solution of discrete ill-posed problems
Hansen, P. C. (1994) · Numerical Algorithms · doi:10.1007/bf02149761 · Cited by 1,710
Image recovery via total variation minimization and related problems
Chambolle, A., & Lions, P.-L. (1997) · Numerische Mathematik · doi:10.1007/s002110050258 · Cited by 1,569
Proximité et dualité dans un espace hilbertien
Moreau, J. J. (1965) · Bulletin de la Société mathématique de France · doi:10.24033/bsmf.1625 · Cited by 1,462
Iterative Methods for Total Variation Denoising
Vogel, C. R., & Oman, M. E. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917016 · Cited by 1,076
Gradient methods for minimizing composite objective function
Nesterov, Y. E. (2007) · Cited by 867
A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
Chan, T. F., Golub, G. H., & Mulet, P. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827596299767 · Cited by 840
An Algorithm for Total Variation Minimization and Applications
Chambolle, A. (2004) · Journal of Mathematical Imaging and Vision · doi:10.1023/b:jmiv.0000011325.36760.1e · Cited by 832
Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
Passty, G. B. (1979) · Journal of Mathematical Analysis and Applications · doi:10.1016/0022-247x(79)90234-8 · Cited by 609
Total Variation Minimization and a Class of Binary MRF Models
Chambolle, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11585978_10 · Cited by 324
Second-order Cone Programming Methods for Total Variation-Based Image Restoration
Goldfarb, D., & Yin, W. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/040608982 · Cited by 196
An efficient algorithm for image segmentation, Markov random fields and related problems
Hochbaum, D. S. (2001) · Journal of the ACM · doi:10.1145/502090.502093 · Cited by 156
Hintermüller, M., & Stadler, G. (2006) · SIAM Journal on Scientific Computing · doi:10.1137/040613263 · Cited by 150
Cited by
Proximal Splitting Methods in Signal Processing
Combettes, P. L., & Pesquet, J.-C. (2011) · Springer Optimization and Its Applications · doi:10.1007/978-1-4419-9569-8_10 · Cited by 2,183
Nonlocally Centralized Sparse Representation for Image Restoration
Dong, W., Zhang, L., Shi, G., & Li, X. (2013) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2235847 · Cited by 1,505
Extreme Learning Machine for Multilayer Perceptron
Tang, J., Deng, C., & Huang, G.-B. (2016) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2424995 · Cited by 1,451
Ma, J., Xu, H., Jiang, J., Mei, X., & Zhang, X.-P. (2020) · IEEE Transactions on Image Processing · doi:10.1109/tip.2020.2977573 · Cited by 1,343
Dong, W., Zhang, L., Shi, G., & Wu, X. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2108306 · Cited by 1,124
Metadata
- Authors
- Beck, A., & Teboulle, M.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2009-11
- Volume
- 18
- Issue
- 11
- Pages
- 2419-2434
- ISSN
- 1057-7149 (ISSN-L)
- 1941-0042
- OpenAlex
- W2142224912
- Cited by
- 2,004
- References
- 28
- FWCI
- 71.46
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.