| Summary: | Total variation (TV) denoising has attracted considerable attention in 1-D and 2-D signal processing. For image denoising, the convex cost function can be viewed as the regularized linear least squares problem (<inline-formula> <tex-math notation="LaTeX">$\ell _{1}$ </tex-math></inline-formula> regularizer for anisotropic case and <inline-formula> <tex-math notation="LaTeX">$\ell _{2}$ </tex-math></inline-formula> regularizer for isotropic case). However, these convex regularizers often underestimate the high-amplitude components of the true image. In this paper, non-convex regularizers for 2-D TV denoising models are proposed. These regularizers are based on the Moreau envelope and minimax-concave penalty, which can maintain the convexity of the cost functions. Then, efficient algorithms based on forward–backward splitting are proposed to solve the new cost functions. The numerical results show the effectiveness of the proposed non-convex regularizers for both synthetic and real-world image.
|
|---|
