A proximity algorithm accelerated by Gauss–Seidel iterations for L1/TV denoising models

DOI10.1088/0266-5611/28/9/095003zbMath1273.65085OpenAlexW2038123181MaRDI QIDQ3168174

Yuesheng Xu, Qia Li, Li-Xin Shen, Charles A. Micchelli

Publication date: 29 October 2012

Published in: Inverse Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0266-5611/28/9/095003

zbMATH Keywords

convergence numerical experiment computational efficiency proximity algorithm images L1/TV denoising model componentwise Gauss-Seidel iteration

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (20)

Wavelet inpainting with the \(\ell_{0}\) sparse regularization ⋮ Fixed point algorithm based on adapted metric method for convex minimization problem with application to image deblurring ⋮ Local linear convergence of a primal-dual algorithm for the augmented convex models ⋮ Finding Dantzig selectors with a proximity operator based fixed-point algorithm ⋮ Impulse noise removal by using a nonconvex TGV regularizer and nonconvex fidelity ⋮ Fixed-Point-like method for a new Total variation-based image restoration model ⋮ The Moreau envelope approach for the L1/TV image denoising model ⋮ Sparse Support Vector Machines in Reproducing Kernel Banach Spaces ⋮ Generalized Mercer Kernels and Reproducing Kernel Banach Spaces ⋮ Primal-dual algorithm based on Gauss-Seidel scheme with application to multiplicative noise removal ⋮ Unnamed Item ⋮ An approximate sparsity model for inpainting ⋮ A fast higher degree total variation minimization method for image restoration ⋮ Nesterov's algorithm solving dual formulation for compressed sensing ⋮ Reprint of ``Nesterov's algorithm solving dual formulation for compressed sensing ⋮ An adaptive fixed-point proximity algorithm for solving total variation denoising models ⋮ A two-step fixed-point proximity algorithm for a class of non-differentiable optimization models in machine learning ⋮ Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing ⋮ Fixed-point algorithms for a TVL1 image restoration model ⋮ Two-step fixed-point proximity algorithms for multi-block separable convex problems

This page was built for publication: A proximity algorithm accelerated by Gauss–Seidel iterations for L1/TV denoising models