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

DOI10.1016/j.cam.2012.08.019zbMath1254.65037OpenAlexW1968050979MaRDI QIDQ1758409

Shengfeng Zhu, Chunxiao Liu

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

zbMATH Keywords

total variationnumerical resultsglobal minimizationimage denoisinggradient-type algorithmmultiplicative noiseprimal-dual

Mathematics Subject Classification ID

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

Related Items

Primal-dual algorithm based on Gauss-Seidel scheme with application to multiplicative noise removal