Framelet-Based Blind Image Restoration with Minimax Concave Regularization

• URL: http://arxiv.org/abs/2604.19314v1
• Date: Tue, 21 Apr 2026 10:24:15 GMT
• Title: Framelet-Based Blind Image Restoration with Minimax Concave Regularization
• Abstract summary: Blind image dering has been extensively due to its practical importance and inherent difficulty.<n>TV regularization has been widely adopted to promote sparsity in imageblur or transform domains, leading to improved fine structures.<n>We introduce the minimax penalty (MCP), which promotes enhanced sparsity and provides a closer approximation to $ell_$-norm regularization.<n>A reweighted $ell_$-norm regularization is incorporated to further reduce estimation bias and improve the preservation of fine image details and textures.
• Score: 10.552386332422074
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recovering corrupted images is one of the most challenging problems in image processing. Among various restoration tasks, blind image deblurring has been extensively studied due to its practical importance and inherent difficulty. In this problem, both the point spread function (PSF) and the underlying latent sharp image must be estimated simultaneously. This problem cannot be solved directly due to its ill-posed nature. One powerful tool for solving such problems is total variation (TV) regularization. The $\ell_0$-norm regularization within the TV framework has been widely adopted to promote sparsity in image gradients or transform domains, leading to improved preservation of edges and fine structures. However, the use of the $\ell_0$-norm results in a highly nonconvex and computationally intractable optimization problem, which limits its practical applicability. To overcome these difficulties, we employ the minimax concave penalty (MCP), which promotes enhanced sparsity and provides a closer approximation to the $\ell_0$-norm. In addition, a reweighted $\ell_1$-norm regularization is incorporated to further reduce estimation bias and improve the preservation of fine image details and textures. After introducing the proposed model, a numerical algorithm is developed to solve the resulting optimization problem. The effectiveness of the proposed approach is then demonstrated through experimental evaluations on several test images.

Related papers

• Poisson Image Denoising Using Minimax Concave and Reweighted $\ell_1$ Penalties: Nonblind and Blind Approaches [2.538209532048867]
  In some images, such as astronomical images, the type of PSF can be specified, and these types of problems are known as blind problems.<n>We propose a nonblind and blind image deblurring Poisson noise using the Minimax Concave Penalty (MCP), which is a continuous, sparsity promoting, and nearly unbiased regularizer.
  arXiv  Detail & Related papers  (2026-09-07T19:30:00Z)
• Deep Image Prior with L0 Gradient Regularizer for Image Smoothing [2.0901018134712297]
  Image smoothing is a fundamental image processing operation that preserves the underlying structure, such as strong edges and contours, and removes minor details and textures in an image.<n>Many image smoothing algorithms rely on computing local window statistics or solving an optimization problem.<n>Recent state-of-the-art methods leverage deep gradient training, but they require a carefully curated training.<n>This framework can perform high-quality image smoothing without any data.
  arXiv  Detail & Related papers  (2026-01-19T21:10:32Z)
• ICM-SR: Image-Conditioned Manifold Regularization for Image Super-Resoultion [39.19685799384519]
  Real world image super-resolution (Real-ISR) often leverages the powerful generative priors of text-to-image diffusion models.<n>Existing methods often overlook the importance of the regularizing manifold, typically defaulting to a text-conditioned manifold.<n>We propose image-conditioned manifold regularization (ICM), a method that regularizes the output towards a manifold conditioned on the sparse yet essential structural information.
  arXiv  Detail & Related papers  (2025-11-27T03:06:21Z)
• An Improved Optimal Proximal Gradient Algorithm for Non-Blind Image Deblurring [15.645711819668582]
  We introduce an improved optimal proximal gradient algorithm (IOptISTA) to efficiently address the non-blind image deblurring problem.<n>The results indicate that our algorithm yields enhanced PSNR and SSIM values, as well as a reduced tolerance, compared to existing methods.
  arXiv  Detail & Related papers  (2025-02-11T14:52:11Z)
• Hierarchical Similarity Learning for Aliasing Suppression Image Super-Resolution [64.15915577164894]
  A hierarchical image super-resolution network (HSRNet) is proposed to suppress the influence of aliasing. HSRNet achieves better quantitative and visual performance than other works, and remits the aliasing more effectively.
  arXiv  Detail & Related papers  (2022-06-07T14:55:32Z)
• Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization [70.4342220499858]
  We introduce novel online algorithms that can exploit smoothness and replace the dependence on $T$ in dynamic regret with problem-dependent quantities. Our results are adaptive to the intrinsic difficulty of the problem, since the bounds are tighter than existing results for easy problems and safeguard the same rate in the worst case.
  arXiv  Detail & Related papers  (2021-12-29T02:42:59Z)
• On Measuring and Controlling the Spectral Bias of the Deep Image Prior [63.88575598930554]
  The deep image prior has demonstrated the remarkable ability that untrained networks can address inverse imaging problems. It requires an oracle to determine when to stop the optimization as the performance degrades after reaching a peak. We study the deep image prior from a spectral bias perspective to address these problems.
  arXiv  Detail & Related papers  (2021-07-02T15:10:42Z)
• Deep Variational Network Toward Blind Image Restoration [60.45350399661175]
  Blind image restoration is a common yet challenging problem in computer vision. We propose a novel blind image restoration method, aiming to integrate both the advantages of them. Experiments on two typical blind IR tasks, namely image denoising and super-resolution, demonstrate that the proposed method achieves superior performance over current state-of-the-arts.
  arXiv  Detail & Related papers  (2020-08-25T03:30:53Z)
• A Flexible Framework for Designing Trainable Priors with Adaptive Smoothing and Game Encoding [57.1077544780653]
  We introduce a general framework for designing and training neural network layers whose forward passes can be interpreted as solving non-smooth convex optimization problems. We focus on convex games, solved by local agents represented by the nodes of a graph and interacting through regularization functions. This approach is appealing for solving imaging problems, as it allows the use of classical image priors within deep models that are trainable end to end.
  arXiv  Detail & Related papers  (2020-06-26T08:34:54Z)
• The Power of Triply Complementary Priors for Image Compressive Sensing [89.14144796591685]
  We propose a joint low-rank deep (LRD) image model, which contains a pair of complementaryly trip priors. We then propose a novel hybrid plug-and-play framework based on the LRD model for image CS. To make the optimization tractable, a simple yet effective algorithm is proposed to solve the proposed H-based image CS problem.
  arXiv  Detail & Related papers  (2020-05-16T08:17:44Z)
• Image Denoising Using Sparsifying Transform Learning and Weighted Singular Values Minimization [7.472473280743767]
  In image denoising (IDN) processing, the low-rank property is usually considered as an important image prior. As a convex relaxation approximation of low rank, nuclear norm based algorithms and their variants have attracted significant attention. By taking both advantages of image domain minimization and transform domain in a general framework, we propose a sparsity learning transform method.
  arXiv  Detail & Related papers  (2020-04-02T00:30:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.