The Maximum Entropy on the Mean Method for Image Deblurring

• URL: http://arxiv.org/abs/2002.10434v4
• Date: Tue, 20 Oct 2020 18:22:47 GMT
• Title: The Maximum Entropy on the Mean Method for Image Deblurring
• Authors: Gabriel Rioux, Rustum Choksi, Tim Hoheisel, Pierre Marechal, Christopher Scarvelis
• Abstract summary: Image deblurring is a notoriously challenging ill-posed inverse problem. We propose an alternative approach, shifting the paradigm towards regularization at the level of the probability distribution on the space of images. Our method is based upon the idea of maximum entropy on the mean wherein we work at the level of the probability density function of the image.
• Score: 4.4518351404598375
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Image deblurring is a notoriously challenging ill-posed inverse problem. In recent years, a wide variety of approaches have been proposed based upon regularization at the level of the image or on techniques from machine learning. We propose an alternative approach, shifting the paradigm towards regularization at the level of the probability distribution on the space of images. Our method is based upon the idea of maximum entropy on the mean wherein we work at the level of the probability density function of the image whose expectation is our estimate of the ground truth. Using techniques from convex analysis and probability theory, we show that the method is computationally feasible and amenable to very large blurs. Moreover, when images are imbedded with symbology (a known pattern), we show how our method can be applied to approximate the unknown blur kernel with remarkable effects. While our method is stable with respect to small amounts of noise, it does not actively denoise. However, for moderate to large amounts of noise, it performs well by preconditioned denoising with a state of the art method.

Related papers

• NoiseDiffusion: Correcting Noise for Image Interpolation with Diffusion Models beyond Spherical Linear Interpolation [86.7260950382448]
  We propose a novel approach to correct noise for image validity, NoiseDiffusion. NoiseDiffusion performs within the noisy image space and injects raw images into these noisy counterparts to address the challenge of information loss.
  arXiv  Detail & Related papers  (2024-03-13T12:32:25Z)
• Gradpaint: Gradient-Guided Inpainting with Diffusion Models [71.47496445507862]
  Denoising Diffusion Probabilistic Models (DDPMs) have recently achieved remarkable results in conditional and unconditional image generation. We present GradPaint, which steers the generation towards a globally coherent image. We generalizes well to diffusion models trained on various datasets, improving upon current state-of-the-art supervised and unsupervised methods.
  arXiv  Detail & Related papers  (2023-09-18T09:36:24Z)
• Deep Richardson-Lucy Deconvolution for Low-Light Image Deblurring [48.80983873199214]
  We develop a data-driven approach to model the saturated pixels by a learned latent map. Based on the new model, the non-blind deblurring task can be formulated into a maximum a posterior (MAP) problem. To estimate high-quality deblurred images without amplified artifacts, we develop a prior estimation network.
  arXiv  Detail & Related papers  (2023-08-10T12:53:30Z)
• Masked Image Training for Generalizable Deep Image Denoising [53.03126421917465]
  We present a novel approach to enhance the generalization performance of denoising networks. Our method involves masking random pixels of the input image and reconstructing the missing information during training. Our approach exhibits better generalization ability than other deep learning models and is directly applicable to real-world scenarios.
  arXiv  Detail & Related papers  (2023-03-23T09:33:44Z)
• 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)
• Poisson2Sparse: Self-Supervised Poisson Denoising From a Single Image [34.27748767631027]
  We present a novel self-supervised learning method for single-image denoising. We approximate traditional iterative optimization algorithms for image denoising with a recurrent neural network. Our method outperforms the state-of-the-art approaches in terms of PSNR and SSIM.
  arXiv  Detail & Related papers  (2022-06-04T00:08:58Z)
• Deblurring via Stochastic Refinement [85.42730934561101]
  We present an alternative framework for blind deblurring based on conditional diffusion models. Our method is competitive in terms of distortion metrics such as PSNR.
  arXiv  Detail & Related papers  (2021-12-05T04:36:09Z)
• Bayesian dense inverse searching algorithm for real-time stereo matching in minimally invasive surgery [1.2074552857379273]
  This paper reports a CPU-level real-time stereo matching method for surgical images (10 Hz on 640 * 480 image with a single core of i5-9400) The proposed method is built on the fast ''dense inverse searching'' algorithm, which estimates the disparity of the stereo images. Experiments indicate that the estimated depth has higher accuracy and fewer outliers than the baseline methods in the surgical scenario.
  arXiv  Detail & Related papers  (2021-06-14T02:26:27Z)
• Polyblur: Removing mild blur by polynomial reblurring [21.08846905569241]
  The proposed algorithm first estimates image blur and then compensates for it by combining multiple applications of the estimated blur in a principled way. Our experiments show that, in the context of mild blur, the proposed method outperforms traditional and modern blind deblurring methods and runs in a fraction of the time.
  arXiv  Detail & Related papers  (2020-12-16T23:38:39Z)
• Solving Linear Inverse Problems Using the Prior Implicit in a Denoiser [7.7288480250888]
  We develop a robust and general methodology for making use of implicit priors in deep neural networks. A CNN trained to perform blind (i.e., with unknown noise level) least-squares denoising is presented. A generalization of this algorithm to constrained sampling provides a method for using the implicit prior to solve any linear inverse problem.
  arXiv  Detail & Related papers  (2020-07-27T15:40:46Z)
• AcED: Accurate and Edge-consistent Monocular Depth Estimation [0.0]
  Single image depth estimation is a challenging problem. We formulate a fully differentiable ordinal regression and train the network in end-to-end fashion. A novel per-pixel confidence map computation for depth refinement is also proposed.
  arXiv  Detail & Related papers  (2020-06-16T15:21:00Z)

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.