Solving total-variation image super-resolution problems via proximal symmetric alternating direction methods
DOI10.1186/S13660-016-1136-7zbMATH Open1347.65046OpenAlexW2512967577WikidataQ59466622 ScholiaQ59466622MaRDI QIDQ308168FDOQ308168
Authors: Bin Gao, Fenggang Sun, Ying Tong, ShiMing Xu
Publication date: 5 September 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-016-1136-7
Recommendations
- Fast minimization methods for solving constrained total-variation superresolution image reconstruction
- A total fractional-order variation model for image super-resolution and its SAV algorithm
- Efficient and effective total variation image super-resolution: a preconditioned operator splitting approach
- Solving constrained total-variation image restoration and reconstruction problems via alternating direction methods
- Image super-resolution by TV-regularization and Bregman iteration
convergencenumerical resultconvex minimizationlinearizationcomputer visionlinearized Peaceman-Rechford splitting methodproximal symmetric alternating direction method of multiplierssingle image super-resolutionstrictly contractive
Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- Matrix computations.
- Solving constrained total-variation image restoration and reconstruction problems via alternating direction methods
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- Image Super-Resolution Via Sparse Representation
- Deconvolving Images With Unknown Boundaries Using the Alternating Direction Method of Multipliers
- A strictly contractive Peaceman-Rachford splitting method for convex programming
- A strictly contractive Peaceman-Rachford splitting method with logarithmic-quadratic proximal regularization for convex programming
- Superresolution image reconstruction using fast inpainting algorithms
- Convergence study on the symmetric version of ADMM with larger step sizes
- Fast Single Image Super-Resolution Using a New Analytical Solution for <inline-formula> <tex-math notation="LaTeX">$\ell _{2}$ </tex-math> </inline-formula>–<inline-formula> <tex-math notation="LaTeX">$\ell _{2}$ </tex-math> </inline-formula> Problems
- Statistical Modeling of 3-D Natural Scenes With Application to Bayesian Stereopsis
- Image super-resolution by TV-regularization and Bregman iteration
Cited In (1)
This page was built for publication: Solving total-variation image super-resolution problems via proximal symmetric alternating direction methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q308168)