Image Denoising by Gaussian Patch Mixture Model and Low Rank Patches
- URL: http://arxiv.org/abs/2011.10290v1
- Date: Fri, 20 Nov 2020 09:28:04 GMT
- Title: Image Denoising by Gaussian Patch Mixture Model and Low Rank Patches
- Authors: Jing Guo (1), Shuping Wang (1), Chen Luo (1), Qiyu Jin (1), Michael
Kwok-Po Ng (2) ((1) School of Mathematical Science, Inner Mongolia
University, Hohhot, China, (2) Department of Mathematics, University of Hong
Kong, Pokfulam, Hong Kong, China)
- Abstract summary: A new method is proposed by solving two issues: how to improve similar patches matching accuracy and build an appropriate low rank matrix approximation model for Gaussian noise.
By solving the two issues, experimental results are reported to show that the proposed approach outperforms the state-of-the-art denoising methods.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Non-local self-similarity based low rank algorithms are the state-of-the-art
methods for image denoising. In this paper, a new method is proposed by solving
two issues: how to improve similar patches matching accuracy and build an
appropriate low rank matrix approximation model for Gaussian noise. For the
first issue, similar patches can be found locally or globally. Local patch
matching is to find similar patches in a large neighborhood which can alleviate
noise effect, but the number of patches may be insufficient. Global patch
matching is to determine enough similar patches but the error rate of patch
matching may be higher. Based on this, we first use local patch matching method
to reduce noise and then use Gaussian patch mixture model to achieve global
patch matching. The second issue is that there is no low rank matrix
approximation model to adapt to Gaussian noise. We build a new model according
to the characteristics of Gaussian noise, then prove that there is a globally
optimal solution of the model. By solving the two issues, experimental results
are reported to show that the proposed approach outperforms the
state-of-the-art denoising methods includes several deep learning ones in both
PSNR / SSIM values and visual quality.
Related papers
- A Novel Truncated Norm Regularization Method for Multi-channel Color
Image Denoising [5.624787484101139]
This paper is proposed to denoise color images with a double-weighted truncated nuclear norm minus truncated Frobenius norm minimization (DtNFM) method.
Through exploiting the nonlocal self-similarity of the noisy image, the similar structures are gathered and a series of similar patch matrices are constructed.
Experiments on synthetic and real noise datasets demonstrate that the proposed method outperforms many state-of-the-art color image denoising methods.
arXiv Detail & Related papers (2023-07-16T03:40:35Z) - Region-wise matching for image inpainting based on adaptive weighted
low-rank decomposition [4.323678254948305]
Digital image inpainting is a problem, inferring the content in the missing (unknown) region to agree with the known region data.
Low-rank and nonlocal self-similarity are two important priors for image inpainting.
We propose a region-wise (RwM) algorithm by dividing the neighborhood of a target patch into multiple subregions and then search the most similar one within each subregion.
arXiv Detail & Related papers (2023-03-22T09:38:34Z) - Linear Combinations of Patches are Unreasonably Effective for Single-Image Denoising [5.893124686141782]
Deep neural networks have revolutionized image denoising in achieving significant accuracy improvements.
To alleviate the requirement to learn image priors externally, single-image methods perform denoising solely based on the analysis of the input noisy image.
This work investigates the effectiveness of linear combinations of patches for denoising under this constraint.
arXiv Detail & Related papers (2022-12-01T10:52:03Z) - Overlap-guided Gaussian Mixture Models for Point Cloud Registration [61.250516170418784]
Probabilistic 3D point cloud registration methods have shown competitive performance in overcoming noise, outliers, and density variations.
This paper proposes a novel overlap-guided probabilistic registration approach that computes the optimal transformation from matched Gaussian Mixture Model (GMM) parameters.
arXiv Detail & Related papers (2022-10-17T08:02:33Z) - Multi-channel Nuclear Norm Minus Frobenius Norm Minimization for Color
Image Denoising [9.20787253404652]
One traditional strategy is to convert the RGB image to a less correlated color space and denoise each channel of the new space separately.
This paper proposes a new multi-channel optimization model for color image denoising under the nuclear norm minus Frobenius norm minimization framework.
Experimental results on both synthetic and real noise datasets demonstrate the proposed model outperforms state-of-the-art models.
arXiv Detail & Related papers (2022-09-16T04:10:29Z) - IDR: Self-Supervised Image Denoising via Iterative Data Refinement [66.5510583957863]
We present a practical unsupervised image denoising method to achieve state-of-the-art denoising performance.
Our method only requires single noisy images and a noise model, which is easily accessible in practical raw image denoising.
To evaluate raw image denoising performance in real-world applications, we build a high-quality raw image dataset SenseNoise-500 that contains 500 real-life scenes.
arXiv Detail & Related papers (2021-11-29T07:22:53Z) - Noise2Score: Tweedie's Approach to Self-Supervised Image Denoising
without Clean Images [35.41467558264341]
We present a novel approach, called Noise2Score, which reveals a missing link in order to unite different approaches.
Specifically, we show that image denoising problems without clean images can be addressed by finding the mode of the posterior distribution.
Our method then uses the recent finding that the score function can be stably estimated from the noisy images using the amortized residual denoising autoencoder.
arXiv Detail & Related papers (2021-06-13T14:41:09Z) - Learning based signal detection for MIMO systems with unknown noise
statistics [84.02122699723536]
This paper aims to devise a generalized maximum likelihood (ML) estimator to robustly detect signals with unknown noise statistics.
In practice, there is little or even no statistical knowledge on the system noise, which in many cases is non-Gaussian, impulsive and not analyzable.
Our framework is driven by an unsupervised learning approach, where only the noise samples are required.
arXiv Detail & Related papers (2021-01-21T04:48:15Z) - Neighbor2Neighbor: Self-Supervised Denoising from Single Noisy Images [98.82804259905478]
We present Neighbor2Neighbor to train an effective image denoising model with only noisy images.
In detail, input and target used to train a network are images sub-sampled from the same noisy image.
A denoising network is trained on sub-sampled training pairs generated in the first stage, with a proposed regularizer as additional loss for better performance.
arXiv Detail & Related papers (2021-01-08T02:03:25Z) - Plug-And-Play Learned Gaussian-mixture Approximate Message Passing [71.74028918819046]
We propose a plug-and-play compressed sensing (CS) recovery algorithm suitable for any i.i.d. source prior.
Our algorithm builds upon Borgerding's learned AMP (LAMP), yet significantly improves it by adopting a universal denoising function within the algorithm.
Numerical evaluation shows that the L-GM-AMP algorithm achieves state-of-the-art performance without any knowledge of the source prior.
arXiv Detail & Related papers (2020-11-18T16:40:45Z) - Rethinking Generative Zero-Shot Learning: An Ensemble Learning
Perspective for Recognising Visual Patches [52.67723703088284]
We propose a novel framework called multi-patch generative adversarial nets (MPGAN)
MPGAN synthesises local patch features and labels unseen classes with a novel weighted voting strategy.
MPGAN has significantly greater accuracy than state-of-the-art methods.
arXiv Detail & Related papers (2020-07-27T05:49:44Z)
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.