Exploiting Image Local And Nonlocal Consistency For Mixed Gaussian-Impulse Noise Removal

Jian Zhang, Ruiqin Xiong, Chen Zhao, Siwei Ma, Debin Zhao

Abstract

Most existing image denoising algorithms are designed to handle a single type of noise. However, real-world images often suffer from mixed noise—typically a combination of Gaussian and impulse noise—acquired during capture and transmission. This paper proposes a new variational algorithm that simultaneously exploits image local consistency and nonlocal consistency. Local consistency is enforced via a hyper-Laplace prior to maintain smoothness and sharp edges, while nonlocal consistency is captured through the three-dimensional sparsity of similar image patches to preserve repetitive textures. Using a Split-Bregman optimization technique, the proposed method achieves significant performance improvements over state-of-the-art schemes.

Introduction

In practical scenarios, images are rarely corrupted by a single noise source. Instead, they often exhibit Gaussian noise (graininess from sensor heat) and impulse noise (sharp "salt-and-pepper" pixels from transmission errors). Traditional denoising methods struggle with this combination: Gaussian filters often leave impulse speckles behind, while impulse-focused filters like median filters tend to blur the underlying image structure.

Existing "two-phase" approaches attempt to detect impulse noise first, but they frequently over-smooth the image and lose fine textures because they fail to fully exploit the statistical properties of natural images. There is a clear need for a unified framework that can address both noise types without sacrificing image detail.

Methodology

The proposed algorithm utilizes two powerful image priors within a unified variational framework to reconstruct clean images from mixed-noise observations:

  1. Image Local Consistency (Hyper-Laplace Prior): Rather than using a standard Laplacian distribution (Total Variation), the model employs a "heavy-tailed" hyper-Laplace prior ($||\nabla x||^{2/3}$). This more accurately models the gradient distribution of natural images, which are characterized by large smooth regions punctuated by sharp edges. This prevents the over-smoothing common in older variational methods.
  2. Image Nonlocal Consistency (3D Sparsity): This exploits the inherent self-similarity of natural images. The algorithm identifies similar patches across the image, stacks them into 3D arrays, and enforces sparsity in the transform domain. This allows the model to recover repetitive patterns that might be completely obscured by noise.

To solve the resulting complex optimization problem efficiently, the researchers implemented the Split-Bregman technique. This approach decomposes the global problem into smaller, iterative sub-problems, allowing for a progressive refinement of the image and the "map" of corrupted pixels.

Experimental Results

The algorithm was rigorously tested on benchmark images including Lena, Boat, and Barbara. The researchers simulated mixed noise by adding Gaussian noise ($\sigma = 10$) and varying levels of impulse noise (10% to 50%).

Comparison of denoising performance on the "Lena" image. The proposed method achieves the highest PSNR (33.00 dB) and superior visual clarity.

Quantitatively, the proposed method consistently outperformed standard techniques like Total Variation (TV) and IFASDA, providing an average improvement of 2 dB in Peak Signal-to-Noise Ratio (PSNR). The visual results are equally compelling, showing sharper edges and fewer artifacts than competing methods.

One of the most significant results was observed in the Barbara dataset, which is known for its complex textures. In scenarios with 50% impulse noise, the proposed method achieved a 3.6 dB gain over IFASDA. As shown in the figure below, the algorithm successfully recovered the fine stripes on the clothing, which other methods reduced to a gray blur.

Denoising results on the "Barbara" image, demonstrating the algorithm's ability to recover fine textures and repetitive patterns even under heavy mixed noise.

Conclusion

By combining local and nonlocal image consistencies, the proposed variational algorithm offers a robust solution for the challenging problem of mixed Gaussian-impulse noise removal. The use of a hyper-Laplace prior and 3D patch sparsity allows for superior edge preservation and texture recovery. Future work may involve optimizing the computational search for nonlocal patches and extending the framework to address other multi-degradation problems, such as simultaneous deblurring and denoising.

Summary updated

Abstract

Most existing image denoising algorithms can only deal with a single type of noise, which violates the fact that the noisy observed images in practice are often suffered from more than one type of noise during the process of acquisition and transmission. In this paper, we propose a new variational algorithm for mixed Gaussian-impulse noise removal by exploiting image local consistency and nonlocal consistency simultaneously. Specifically, the local consistency is measured by a hyper-Laplace prior, enforcing the local smoothness of images, while the nonlocal consistency is measured by three-dimensional sparsity of similar blocks, enforcing the nonlocal self-similarity of natural images. Moreover, a Split-Bregman based technique is developed to solve the above optimization problem efficiently. Extensive experiments for mixed Gaussian plus impulse noise show that significant performance improvements over the current state-of-the-art schemes have been achieved, which substantiates the effectiveness of the proposed algorithm.
BibTeX
@inproceedings{zhang2012exploiting,
  author = {Jian Zhang and Ruiqin Xiong and Chen Zhao and Siwei Ma and Debin Zhao},
  title = {{Exploiting Image Local And Nonlocal Consistency For Mixed Gaussian-Impulse Noise Removal}},
  booktitle = {ICME},
  year = {2012},
  url = {https://openreview.net/forum?id=cgWVRhUN2-a},
}
Figure