Abstract

In the field of image restoration, non-convex penalties and non-local self-similarity (NSS) prior have been found to enhance image edges and textures. However, NSS-based methods often overlook the inherent variations within patch groups by treating them as a single entity for processing. Despite the existence of numerous convex or non-convex regularizers, few of them have been able to adaptively adjust penalty strength based on NSS information in order to preserve fine details in an image. To address this issue, we propose a novel group sparsity residual constraint model with weighted log-sum penalty (GSRC-Log) for image restoration in this paper. The proposed regularization term is parameterized by an adaptive scalar parameter that relates to NSS, allowing the model to prioritize high NSS group sparse coefficients while penalizing low NSS coefficients. For image denoising, we provide detailed analysis on the optimal condition of our proposed model and prove that it has a simple closed-form global solution. For image restoration tasks, we utilize the ADMM algorithm to solve the GSRC-Log problem and empirically verify its convergence. Extensive experimental results on both image denoising and compressive sensing (CS) recovery demonstrate that our proposed GSRC-Log outperforms many popular or state-of-the-art methods.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call