Poisson Image Denoising Using Minimax Concave and Reweighted $\ell_1$ Penalties: Nonblind and Blind Approaches

• URL: http://arxiv.org/abs/2609.07916v1
• Date: Mon, 07 Sep 2026 19:30:00 GMT
• Title: Poisson Image Denoising Using Minimax Concave and Reweighted $\ell_1$ Penalties: Nonblind and Blind Approaches
• Abstract summary: 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.
• Score: 2.538209532048867
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Images are important tools in various sciences. Despite the development of photo-taking tools, creating clear and image without noise remains challenging in practice. In particular, Poisson noise has an effect on medical and astronomical images, and reduces their quality. Additionally, blur is another factor that has an effect on image quality. The problem of image restoration becomes very complicated when we have no information about the Point Spread Function (PSF). These types of problems are known as blind case. However, in some images, such as some astronomical images, the type of PSF can be specified, and these types of problems are known as nonblind problems. Total Variation (TV) is a widely used method for solving such inverse problems, where the selection of the penalty function is the most critical factor that affects the method's performance. In this paper, to improve edge preservation, we employ a reweighted $\ell_1$-regularization of the fractional order derivative. Furthermore, we propose a nonblind and blind image deblurring approach under Poisson noise using the Minimax Concave Penalty (MCP), which is a continuous, sparsity promoting, and nearly unbiased regularizer. This formulation leads to a nonconvex optimization model. To solve the proposed model, we introduce an efficient numerical algorithm based on the Alternating Direction Method of Multipliers (ADMM) and provide an analysis of its convergence. Finally, the effectiveness of the proposed algorithm are demonstrated through extensive experiments on various images.

Related papers

• Framelet-Based Blind Image Restoration with Minimax Concave Regularization [10.552386332422074]
  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.
  arXiv  Detail & Related papers  (2026-04-21T10:24:15Z)
• TTSnap: Test-Time Scaling of Diffusion Models via Noise-Aware Pruning [53.52543819839442]
  A prominent approach to test-time scaling for text-to-image diffusion models formulates the problem as a search over multiple noise seeds.<n>We propose test-time scaling with noise-aware pruning (TTSnap), a framework that prunes low-quality candidates without fully denoising them.
  arXiv  Detail & Related papers  (2025-11-27T09:14:26Z)
• Blind Image Deblurring with FFT-ReLU Sparsity Prior [1.179778723980276]
  Blind image deblurring is the process of recovering a sharp image from a blurred one without prior knowledge about the blur kernel. We introduce a method that leverages a prior which targets the blur kernel to achieve effective deblurring across a wide range of image types.
  arXiv  Detail & Related papers  (2024-06-12T15:51:39Z)
• Solving General Noisy Inverse Problem via Posterior Sampling: A Policy Gradient Viewpoint [21.22750301965104]
  We leverage a pretrained diffusion generative model to solve a wide range of image inverse tasks without task specific model fine-tuning. To precisely estimate the guidance score function of the input image, we propose Diffusion Policy Gradient (DPG) Experiments show that our method is robust to both Gaussian and Poisson noise degradation on multiple linear and non-linear inverse tasks.
  arXiv  Detail & Related papers  (2024-03-15T16:38:47Z)
• Semi-Blind Image Deblurring Based on Framelet Prior [0.3626013617212666]
  Image blurring is caused by various factors such as hand or camera shake. To restore the blurred image, it is necessary to know information about the point spread function (PSF)
  arXiv  Detail & Related papers  (2023-10-02T07:25:05Z)
• Representing Noisy Image Without Denoising [91.73819173191076]
  Fractional-order Moments in Radon space (FMR) is designed to derive robust representation directly from noisy images. Unlike earlier integer-order methods, our work is a more generic design taking such classical methods as special cases.
  arXiv  Detail & Related papers  (2023-01-18T10:13:29Z)
• Point spread function estimation for blind image deblurring problems based on framelet transform [0.0]
  The approximation of the image that has been lost due to the blurring process is an important issue in image processing. The second type of problem is more complex in terms of calculations than the first problems due to the unknown of original image and point spread function estimation. An algorithm based on coarse-to-fine iterative by $l_0-alpha l_1$ regularization and framelet transform is introduced to approximate the spread function estimation. The proposed method is investigated on different kinds of images such as text, face, natural.
  arXiv  Detail & Related papers  (2021-12-21T06:15:37Z)
• 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)
• Fully Unsupervised Diversity Denoising with Convolutional Variational Autoencoders [81.30960319178725]
  We propose DivNoising, a denoising approach based on fully convolutional variational autoencoders (VAEs) First we introduce a principled way of formulating the unsupervised denoising problem within the VAE framework by explicitly incorporating imaging noise models into the decoder. We show that such a noise model can either be measured, bootstrapped from noisy data, or co-learned during training.
  arXiv  Detail & Related papers  (2020-06-10T21:28:13Z)
• 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)
• Variational Denoising Network: Toward Blind Noise Modeling and Removal [59.36166491196973]
  Blind image denoising is an important yet very challenging problem in computer vision. We propose a new variational inference method, which integrates both noise estimation and image denoising.
  arXiv  Detail & Related papers  (2019-08-29T15:54:06Z)

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.