Impulsive noise removal usually employs median filtering, switching median filtering, the total variation method, and variants. These approaches however often introduce excessive smoothing and can result in extensive visual feature blurring and thus are suitable only for images with low density noise. A new method to remove noise is proposed in this paper to overcome this limitation, which divides pixels into different categories based on different noise characteristics. If an image is corrupted by salt-and-pepper noise, the pixels are divided into corrupted and noise-free; if the image is corrupted by random valued impulses, the pixels are divided into corrupted, noise-free, and possibly corrupted. Pixels falling into different categories are processed differently. If a pixel is corrupted, modified total variation diffusion is applied; if the pixel is possibly corrupted, weighted total variation diffusion is applied; otherwise, the pixel is left unchanged. Experimental results show that the proposed method is robust to different noise strengths and suitable for different images, with strong noise removal capability as shown by PSNR/SSIM results as well as the visual quality of restored images.
Impulsive noise removal for color images usually employs vector median filter, switching median filter, the total variation method, and variants. These approaches, however, often introduce excessive smoothing and can result in extensive visual feature blurring and thus are suitable only for images with low density noise. A marginal method to reduce impulsive noise is proposed in this paper that overcomes this limitation that is based on the following facts: (i) each channel in a color image is contaminated independently, and contaminative components are independent and identically distributed; (ii) in a natural image the gradients of different components of a pixel are similar to one another. This method divides components into different categories based on different noise characteristics. If an image is corrupted by salt-and-pepper noise, the components are divided into the corrupted and the noise-free components; if the image is corrupted by random-valued impulses, the components are divided into the corrupted, noise-free, and the possibly corrupted components. Components falling into different categories are processed differently. If a component is corrupted, modified total variation diffusion is applied; if it is possibly corrupted, scaled total variation diffusion is applied; otherwise, the component is left unchanged. Simulation results demonstrate its effectiveness.
16 December 2020 in Journal of Circuits, Systems and Computers
A shrinkage curve optimization is proposed for weighted nuclear norm minimization and is adapted to image denoising. The proposed optimization method employs a penalty function utilizing the difference between a latent matrix and its observation and uses odd polynomials to shrink the singular values of the observation matrix. As a result, the coefficients of polynomial characterize the shrinkage operator fully. Furthermore, the Frobenius norm of the penalty function is converted into the corresponding spectral norm, and thus the parameter optimization problem can be easily solved by using off‐and‐shelf plain least‐squares. In the practical application, the proposed denoising method does not work on the whole image at once, but rather a series of matrix termed Rank‐Ordered Similar Matrix (ROSM). Simulation results on 256 noisy images demonstrate the effectiveness of the proposed algorithms.
We present a method to remove salt-and-pepper noise for single images. The method consists of two stages, noise detection and noise removal. In the first stage, a detector identifies corrupted pixels; in the second stage, an algorithm employs a nonlinear isotropic diffusion to suppression noise, which diffusion is only for those corrupted pixels. We apply our method to a test set containing five images. Experimental results show that the method is powerful for salt-and-pepper noise removal.