Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing

DOI10.1007/s10444-014-9363-2zbMath1326.65069OpenAlexW2059448319MaRDI QIDQ2348695

Yuesheng Xu, Na Zhang, Qia Li, Li-Xin Shen

Publication date: 15 June 2015

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10444-014-9363-2

zbMATH Keywords

convergenceconvex optimizationimage processingproximity operatorfixed-point algorithmBregman iteration method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (24)

A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement ⋮ A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions ⋮ Second order semi-smooth proximal Newton methods in Hilbert spaces ⋮ Parameter choices for sparse regularization with the ℓ1 norm ^* ⋮ Inverting incomplete Fourier transforms by a sparse regularization model and applications in seismic wavefield modeling ⋮ Fixed-point proximity algorithm for minimal norm interpolation ⋮ A primal-dual algorithm framework for convex saddle-point optimization ⋮ Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators ⋮ The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector ⋮ Sparse machine learning in Banach spaces ⋮ Fast multiscale functional estimation in optimal EMG placement for robotic prosthesis controllers ⋮ A duality approach to regularized learning problems in Banach spaces ⋮ Sparse Support Vector Machines in Reproducing Kernel Banach Spaces ⋮ Image restoration by a mixed high-order total variation and \(l_1\) regularization model ⋮ Generalized Mercer Kernels and Reproducing Kernel Banach Spaces ⋮ Fixed-point proximity algorithms solving an incomplete Fourier transform model for seismic wavefield modeling ⋮ Unnamed Item ⋮ Globalized inexact proximal Newton-type methods for nonconvex composite functions ⋮ An adaptive fixed-point proximity algorithm for solving total variation denoising models ⋮ Fast proximity-gradient algorithms for structured convex optimization problems ⋮ A content-adaptive unstructured grid based integral equation method with the TV regularization for SPECT reconstruction ⋮ A two-step fixed-point proximity algorithm for a class of non-differentiable optimization models in machine learning ⋮ Two-step fixed-point proximity algorithms for multi-block separable convex problems ⋮ A content-adaptive unstructured grid based regularized CT reconstruction method with a SART-type preconditioned fixed-point proximity algorithm

Uses Software

• FTVd

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Smooth minimization of non-smooth functions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A unified primal-dual algorithm framework based on Bregman iteration
• Split-Bregman iteration for framelet based image inpainting
• An algorithm for total variation minimization and applications
• A variational approach to remove outliers and impulse noise
• Tight frame: an efficient way for high-resolution image reconstruction
• A first-order primal-dual algorithm for convex problems with applications to imaging
• Proximity algorithms for the L1/TV image denoising model
• Image restoration with discrete constrained total variation. I: Fast and exact optimization
• Convergence analysis of tight framelet approach for missing data recovery
• Simultaneously inpainting in image and transformed domains
• The Moreau envelope approach for the L1/TV image denoising model
• Nesterov's algorithm solving dual formulation for compressed sensing
• Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
• Proximity algorithms for image models: denoising
• Preconditioned alternating projection algorithms for maximum a posteriori ECT reconstruction
• A proximity algorithm accelerated by Gauss–Seidel iterations for L1/TV denoising models
• A Duality-Based Splitting Method for $\ell^1$-$TV$ Image Restoration with Automatic Regularization Parameter Choice
• Linearized Bregman Iterations for Frame-Based Image Deblurring
• The Split Bregman Method for L1-Regularized Problems
• An EM algorithm for wavelet-based image restoration
• Split Bregman Methods and Frame Based Image Restoration
• An Efficient TVL1 Algorithm for Deblurring Multichannel Images Corrupted by Impulsive Noise
• An Efficient Primal-Dual Method for $L^1$TV Image Restoration
• Monotone Operators and the Proximal Point Algorithm
• A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
• A Variational Method in Image Recovery
• Wavelet Algorithms for High-Resolution Image Reconstruction
• Fast, robust total variation-based reconstruction of noisy, blurred images
• Local Strong Homogeneity of a Regularized Estimator
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• Iterative Methods for Total Variation Denoising
• Aspects of Total Variation RegularizedL¹Function Approximation
• An Infeasible Primal-Dual Algorithm for Total Bounded Variation--Based Inf-Convolution-Type Image Restoration
• Signal Recovery by Proximal Forward-Backward Splitting
• Convex Analysis
• An Iterative Regularization Method for Total Variation-Based Image Restoration
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: Multi-step fixed-point proximity algorithms for solving a class of optimization problems arising from image processing