Proximity algorithms for image models: denoising

DOI10.1088/0266-5611/27/4/045009MaRDI QIDQ2996607zbMATH OpenOpenAlexFDO

Authors Yuesheng Xu, Charles A. Micchelli, Lixin Shen

Publication date 3 May 2011

Published in Inverse Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1088/0266-5611/27/4/045009

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Machine vision and scene understanding (68T45)

Recommendations

• Proximity algorithms for the L1/TV image denoising model
• Fractional-order total variation image denoising based on proximity algorithm
• An adaptive fixed-point proximity algorithm for solving total variation denoising models
• An Efficient Proximity Point Algorithm for Total-Variation-Based Image Restoration
• A fixed-point algorithm for second-order total variation models in image denoising

Cited in

(only showing first 100 items - show all)

• The Moreau envelope approach for the L1/TV image denoising model
• A globally convergent algorithm for a constrained non-Lipschitz image restoration model
• Explicit iteration schemes for minimization problems arising from image denoising
• The matrix splitting based proximal fixed-point algorithms for quadratically constrained \(\ell_{1}\) minimization and Dantzig selector
• A total fractional-order variation regularized reconstruction method for CT
• Algorithms for structured sparsity promoting functions regularized image restoration model
• Fixed-point algorithms for a TVL1 image restoration model
• Computing proximity operators of scale and signed permutation invariant functions
• Resolvent of the parallel composition and the proximity operator of the infimal postcomposition
• A content-adaptive unstructured grid based integral equation method with the TV regularization for SPECT reconstruction
• An adaptive fixed-point proximity algorithm for solving total variation denoising models
• Primal-dual fixed point algorithm based on adapted metric method for solving convex minimization problem with application
• Parameter choices for sparse regularization with the ℓ1 norm ^*
• MiKM: multi-step inertial Krasnosel'skiǐ-Mann algorithm and its applications
• A Krasnoselskii-Mann proximity algorithm for Markowitz portfolios with adaptive expected return level
• Successive affine learning for deep neural networks
• Comparative analysis of the prox penalty and Bregman algorithms for image denoising
• Learning with optimal interpolation norms
• A fast fixed point algorithm for total variation deblurring and segmentation
• Relaxed alternating minimization algorithm for separable convex programming with applications to imaging
• Multiplicative noise removal in imaging: an exp-model and its fixed-point proximity algorithm
• _0-minimization methods for image restoration problems based on wavelet frames
• Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications
• New fast proximal point algorithms for monotone inclusion problems with applications to image recovery
• A weighted \(H^{1}\) seminorm regularization method for Fredholm integral equations of the first kind
• Two modified schemes for the primal dual fixed point method
• An adaptive data-fitting model for Speckle reduction of log-compressed ultrasound images
• Multi-step inertial forward-backward-half forward algorithm for solving monotone inclusion
• A fast edge detection algorithm using binary labels
• XCT image reconstruction by a modified superiorized iteration and theoretical analysis
• _1DecNet+: a new architecture framework by _1 decomposition and iteration unfolding for sparse feature segmentation
• Convergence Theorems and Convergence Rates for the General Inertial Krasnosel’skiǐ–Mann Algorithm
• scientific article; zbMATH DE number 7626740 (Why is no real title available?)
• Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
• Efficient algorithm for isotropic and anisotropic total variation deblurring and denoising
• An accelerated preconditioned proximal gradient algorithm with a generalized Nesterov momentum for PET image reconstruction
• General viscosity iterative approximation for solving unconstrained convex optimization problems
• Nonlinear multigrid method for solving the anisotropic image denoising models
• Adaptive image restoration via a relaxed regularization of mean curvature
• Multiplicative noise removal with a sparsity-aware optimization model
• A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems
• A new total variation model for restoring blurred and speckle noisy images
• A preconditioning technique for first-order primal-dual splitting method in convex optimization
• Modified general inertial Mann and general inertial viscosity algorithms for fixed point and common fixed point problems with applications
• Generalized Mercer kernels and reproducing kernel Banach spaces
• Sparsity promoting regularization for effective noise suppression in SPECT image reconstruction
• Alternating method based on framelet l₀-norm and TV regularization for image restoration
• Structured sparsity promoting functions
• Proximal algorithms in statistics and machine learning
• A two-step fixed-point proximity algorithm for a class of non-differentiable optimization models in machine learning
• Convergence Rate Analysis of Accelerated Forward-Backward Algorithm with Generalized Nesterov Momentum Scheme
• Spherical Framelets from Spherical Designs
• Image restoration based on the hybrid total-variation-type model
• A parametric maximum flow approach for discrete total variation regularization
• An inertial Mann algorithm for nonexpansive mappings
• Fixed-point proximity algorithm for minimal norm interpolation
• Properties and iterative methods for the lasso and its variants
• Efficient primal-dual fixed point algorithms with dynamic stepsize for composite convex optimization problems
• An inertial semi-forward-reflected-backward splitting and its application
• A fixed-point algorithm for second-order total variation models in image denoising
• Primal-dual fixed point methods for regularized least-squares problems
• A relax inexact accelerated proximal gradient method for the constrained minimization problem of maximum eigenvalue functions
• Wavelet inpainting with the \(\ell_{0}\) sparse regularization
• Iterative methods for computing the resolvent of the sum of a maximal monotone operator and composite operator with applications
• Algorithmic versatility of SPF-regularization methods
• An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration
• Accelerated non-overlapping domain decomposition method for total variation minimization
• A fixed-point proximity algorithm for recovering low-rank components from incomplete observation data with application to motion capture data refinement
• A constructive approach for computing the proximity operator of the \(p\)-th power of the \(\ell_1\) norm
• Alternating direction method of multipliers for nonconvex log total variation image restoration
• An image sharpening operator combined with framelet for image deblurring
• On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms
• Inertial Krasnosel'skiǐ-Mann type hybrid algorithms for solving hierarchical fixed point problems
• LU-Net: combining LSTM and U-Net for sinogram synthesis in sparse-view SPECT reconstruction
• Regularization with multilevel non-stationary tight framelets for image restoration
• Rician noise removal via a learned dictionary
• New accelerated splitting algorithm for monotone inclusion problems
• Revisiting graph neural networks from hybrid regularized graph signal reconstruction
• Fractional-order total variation image denoising based on proximity algorithm
• Inverting incomplete Fourier transforms by a sparse regularization model and applications in seismic wavefield modeling
• New inertial proximal gradient methods for unconstrained convex optimization problems
• Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method
• Domain decomposition method for image deblurring
• A dictionary learning approach for fractal image coding
• Inexact fixed-point proximity algorithm for the _0 sparse regularization problem
• Nesterov's algorithm solving dual formulation for compressed sensing
• Spatially adaptive oscillation total generalized variation for image restoration with structured textures
• Proximal ADMM approach for image restoration with mixed Poisson-Gaussian noise
• Stochastic primal dual fixed point method for composite optimization
• A two-stage method for piecewise-constant solution for Fredholm integral equations of the first kind
• Two-step fixed-point proximity algorithms for multi-block separable convex problems
• Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
• Proximity algorithms for the L1/TV image denoising model
• An approximate sparsity model for inpainting
• Modular proximal optimization for multidimensional total-variation regularization
• Fast proximity-gradient algorithms for structured convex optimization problems
• Sparse frame DOA estimations via a rank-one correlation model for low SNR and limited snapshots
• A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems
• Properties and iterative methods for the \(Q\)-lasso
• An integral equation model for PET imaging

This page was built for publication: Proximity algorithms for image models: denoising

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996607)