Denoising of sparse images in impulsive disturbance environment

Abstract

The paper presents a method for denoising and reconstruction of sparse images based on a gradient-descent algorithm. It is assumed that the original (non-noisy) image is sparse in the two-dimensional Discrete Cosine Transform (2D-DCT) domain. It is also assumed that a number of image pixels is corrupted by a salt and pepper noise. In addition, we assume that there are pixels corrupted by a noise of any value. In this paper we introduce a method to find the positions of the corrupted pixels when the noise is not of the salt and pepper form. The proposed algorithm for noisy pixels detection and reconstruction works blindly. It does not require the knowledge about the positions of corrupted pixels. The only assumption is that the image is sparse and that the noise degrades this property. The advantage of this reconstruction algorithm is that we do not change the uncorrupted pixels in the process of the reconstruction, unlike common reconstruction methods. Corrupted pixels are detected and removed iteratively using the gradient of sparsity measure as a criterion for detection. After the corrupted pixels are detected and removed, the gradient algorithm is employed to reconstruct the image. The algorithm is tested on both grayscale and color images. Additionally, the case when both salt and pepper noise and a random noise, within the pixel values range, are combined is considered. The proposed method can be used without explicitly imposing the image sparsity in a strict sense. Quality of the reconstructed image is measured for different sparsity and noise levels using the structural similarity index, the mean absolute error, mean-square error and peak signal-to-noise ratio and compared to the traditional median filter and recent algorithms, one based on the total-variations reconstruction and a two-stage adaptive algorithm.