Plug-and-Play ADMM for Image Restoration: Fixed-Point Convergence and Applications
Open accessThe DOI matches its Crossref record; 58 of the 58 references it cites were found in a registry or an index.
Abstract
Alternating direction method of multiplier (ADMM) is a widely used algorithm for solving constrained optimization problems in image restoration. Among many useful features, one critical feature of the ADMM algorithm is its modular structure, which allows one to plug in any off-the-shelf image denoising algorithm for a subproblem in the ADMM algorithm. Because of the plug-in nature, this type of ADMM algorithms is coined the name “Plug-and-Play ADMM.” Plug-and-Play ADMM has demonstrated promising empirical results in a number of recent papers. However, it is unclear under what conditions and by using what denoising algorithms would it guarantee convergence. Also, since Plug-and-Play ADMM uses a specific way to split the variables, it is unclear if fast implementation can be made for common Gaussian and Poissonian image restoration problems. In this paper, we propose a Plug-and-Play ADMM algorithm with provable fixed-point convergence. We show that for any denoising algorithm satisfying an asymptotic criteria, called bounded denoisers, Plug-and-Play ADMM converges to a fixed point under a continuation scheme. We also present fast implementations for two image restoration problems on superresolution and single-photon imaging. We compare Plug-and-Play ADMM with state-of-the-art algorithms in each problem type and demonstrate promising experimental results of the algorithm.
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
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Boyd, S. (2010) · now publishers, Inc. eBooks · doi:10.1561/9781601984616 · Cited by 12,677
Learning a Deep Convolutional Network for Image Super-Resolution
Dong, C., Loy, C. C., He, K., & Tang, X. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10593-2_13 · Cited by 5,494
Multirate Systems and Filter Banks
Vaidyanathan, P. P. (1992) · CaltechAUTHORS (California Institute of Technology) · Cited by 5,457
A Review of Image Denoising Algorithms, with a New One
Buades, A., Coll, B., & Morel, J. M. (2005) · Multiscale Modeling & Simulation · doi:10.1137/040616024 · Cited by 4,083
Introduction to Applied Nonlinear Dynamical Systems and Chaos
Wiggins, S., & Mazel, D. S. (1990) · Computers in Physics · doi:10.1063/1.4822950 · Cited by 3,780
Introduction to Applied Nonlinear Dynamical Systems and Chaos
Wiggins, S. (1990) · Texts in Applied Mathematics · doi:10.1007/978-1-4757-4067-7 · Cited by 2,784
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wang, Y., Yang, J., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/080724265 · Cited by 1,975
Image super-resolution as sparse representation of raw image patches
Yang, J., Wright, J., Huang, T., & Ma, Y. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587647 · Cited by 1,475
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
Research works printed but not linked: 4
- [37] K.-M. Ng, A Continuation Approach for Solving Nonlinear Optimization Problems with Discrete Variables , Ph.D. thesis, Stanford University, 2002. -
- [1] H. V. Poor, An Introduction to Signal Detection and Estimation , Springer, 2nd edition, 1998. -
- [24] C. A. Metzler, A. Maleki, and R. G. Baraniuk, 'From denoising to compressed sensing,' Available online: http://arxiv.org/abs/1406.4175, Jul. 2014. - · arXiv
- [52] J. Huang, A. Singh, and N. Ahuia, 'Single image super-resolution using transformed self-exemplars,' in Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR) , Jun. 2015, pp. 5197-5206. -
Cited by
Items 901–901 of 901
Low‐dose CT denoising using a diffusion prior via score distillation sampling
Jung, H., Lee, J., & Baek, J. (2026) · Medical Physics · doi:10.1002/mp.70707
Metadata
- Authors
- Chan, S. H., Wang, X., & Elgendy, O. A.
- Affiliations
- Purdue University West Lafayette (US)
- Venue
- IEEE Transactions on Computational Imaging
- Published
- 2017-03
- Volume
- 3
- Issue
- 1
- Pages
- 84-98
- ISSN
- 2333-9403 (ISSN-L)
- 2334-0118
- OpenAlex
- W2346305596
- Cited by
- 904
- References
- 58
- Citations by year
- 2026: 85 · 2025: 130 · 2024: 134 · 2023: 114 · 2022: 102 · 2021: 103 · 2020: 93 · 2019: 75 · 2018: 48 · 2017: 18
- FWCI
- 32.42
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- IEEE Transactions on Computational Imaging (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Image and Signal Denoising Methods
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Image Processing Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Keywords
- image restoration, fixed point convergence, image denoising, super-resolution, single-photon imaging, shot noise, Gaussian noise, variable splitting
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.