A convex relaxation method for computing exact global solutions for multiplicative noise removal

DOI10.1016/J.CAM.2012.08.019zbMATH Open1254.65037OpenAlexW1968050979MaRDI QIDQ1758409FDOQ1758409

Authors: Chunxiao Liu, Shengfeng Zhu 

Publication date: 9 November 2012

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2012.08.019

Recommendations

• The convex relaxation method on deconvolution model withmultiplicative noise
• A new convex optimization model for multiplicative noise and blur removal
• A New Total Variation Method for Multiplicative Noise Removal
• A convex adaptive total variation model based on the gray level indicator for multiplicative noise removal
• An efficient variational model for multiplicative noise removal

zbMATH Keywords

total variationnumerical resultsimage denoisingmultiplicative noiseprimal-dualglobal minimizationgradient-type algorithm

Mathematics Subject Classification ID

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

Cited In (4)

• The convex relaxation method on deconvolution model withmultiplicative noise
• Flexible parameter selection methods for Rician noise removal with convergence guarantee
• Primal-dual algorithm based on Gauss-Seidel scheme with application to multiplicative noise removal
• A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal

This page was built for publication: A convex relaxation method for computing exact global solutions for multiplicative noise removal

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