Total Variation Denoising with Non-Convex Regularizers

30Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 ℓ1 regularizer for anisotropic case and ℓ2 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.

Cite

CITATION STYLE

APA

Zou, J., Shen, M., Zhang, Y., Li, H., Liu, G., & Ding, S. (2019). Total Variation Denoising with Non-Convex Regularizers. IEEE Access, 7, 4422–4431. https://doi.org/10.1109/ACCESS.2018.2888944

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free