Fast restoration of natural images corrupted by high-density impulse noise
- Hossein Hosseini^{1}Email author and
- Farokh Marvasti^{1}
https://doi.org/10.1186/1687-5281-2013-15
© Hosseini and Marvasti; licensee Springer. 2013
Received: 2 October 2012
Accepted: 26 January 2013
Published: 2 April 2013
Abstract
In this paper, we suggest a general model for the fixed-valued impulse noise and propose a two-stage method for high density noise suppression while preserving the image details. In the first stage, we apply an iterative impulse detector, exploiting the image entropy, to identify the corrupted pixels and then employ an Adaptive Iterative Mean filter to restore them. The filter is adaptive in terms of the number of iterations, which is different for each noisy pixel, according to the Euclidean distance from the nearest uncorrupted pixel. Experimental results show that the proposed filter is fast and outperforms the best existing techniques in both objective and subjective performance measures.
Keywords
Image denoising Salt-and-pepper noise General fixed-valued impulse noise Image entropy Adaptive iterative mean filterIntroduction
Images are often corrupted by impulse noise during acquisition and transmission; thus, an efficient noise suppression technique is required before subsequent image processing operations [1]. Median filter (MF) [2] is widely used in impulse noise removal methods due to its denoising capability and computational efficiency [3]. However, it is effective only for low noise densities. To overcome this drawback, many recent techniques [4–12] first detect the impulse locations and then filter the noisy pixels without processing the uncorrupted ones.
Various methods have been proposed to estimate the intensity values of noisy pixels. Some of the best existing methods are Opening-Closing Sequence (OCS) filter [4] based on mathematical morphology, Edge-Preserving Algorithm (EPA) [5] which adopts a directional correlation-dependent filtering technique, Switching-based Adaptive Weighted Mean filter (SAWM) [6] which replaces each noisy pixel with the weighted mean of its noise-free neighbors, Decision-based Average or Median filter (DAM) [7] which estimates the value of each noisy pixel using the average or median of the adjacent pixels, Cloud Model filter (CM) [8] which employs an uncertainty-based impulse detector and a weighted fuzzy mean filter and Fast and Efficient Median Filter (FEMF) [9] based on adaptive median filtering of noise-free pixels.
However, instead of two fixed values, impulse noise can be more realistically modeled by two fixed ranges that appear at both ends [10–12]. In [10], the Boundary Discriminative Noise Detection (BDND) is proposed to classify the pixels according to their intensities. The image restoration is done by using the switching median filter. A Noise Fading Technique (NFT), presented in [11], first applies an impulse detector and then employs a pixel restoring median filter for denoising the corrupted pixels in an iterative manner. In [12], a Two-State Switching Median filter (TSSM) is proposed which uses a noise intensity identification scheme to detect the corrupted pixels. The filtering scheme is chosen from two different switching median filters.
In this paper, we suggest a general model for impulse noise which assumes that impulses can take any subset of the entire grey-values dynamic range. Noisy pixels are detected based on iterative measuring the image entropy and restored using an Adaptive Iterative Mean filter (AIM). The proposed filter alters the corrupted pixels in a different number of iterations according to their Euclidean distance from the nearest uncorrupted pixel.
The rest of this paper is organized as follows. Section II reviews the impulse noise models and describes the suggested one. Our algorithm is presented in Section III. The experimental results and comparisons are provided in Section IV and Section V concludes the paper.
Impulse noise model
where x _{ i,j } and y _{ i,j } denote the intensity value of the original and corrupted images at coordinate (i,j), respectively and p is the noise density. This model implies that the pixels are randomly corrupted by two fixed extreme values, 0 and 255 (for 8-bit grey-scale images), with the same probability.
where p = p _{1} + p _{2}. We refer to this model as Fixed-Range Impulse Noise (FRIN). In this model, instead of two fixed values, two fixed ranges at both ends with the length of m are assumed to be impulse noise values. Also the densities of low-intensity and high-intensity impulse noise might be unequal.
where S is the set of impulse noise values with k elements chosen from the set [0 255]. The impulse probabilities don’t have to be equal. We refer to this model as General Fixed-Valued Impulse Noise (GFN) or Multi-Valued Impulse Noise (MVIN). Models described in Equations (1) and (2) are also included in the GFN model by choosing the appropriate set S as S _{1} = {0,255} and S _{2} = {0,1,…,m – 1,255 – m + 1,255 –m + 2,…,255}, respectively. The GFN can bridge the FVIN and the RVIN; if we choose s = [0 255] and all values have the same probability, the RVIN will be obtained.
The proposed method
Many recent image denoising techniques consist of two stages: first detecting the corrupted pixels and then estimating their original values. Traditional impulse detectors fail, when the impulses have few values, distributed in the entire range of grey-values. For the GFN model, we need an Impulse Value Detector (IVD) to determine the noise values. The method is described below:
A-Impulse Value Detector (IVD):
where p _{ i } is the probability of the grey-value i and can be interpreted as the normalized histogram of the image. In natural images, unlike the Gaussian noise, the impulse noise significantly decreases the image entropy.
The impulse value detector, iteratively, detects and removes the impulse grey-values. A grey-value is detected as an impulse if the corresponding pixels have the lowest correlation with their neighbors. After each iteration, by removing an impulse value, the image entropy increases. The process continues until the entropy becomes larger than the entropy threshold, thus it ensures that there are no more impulse values in the image.
- 1.
Construct the Mask matrix with the same size as the image. The Mask is zero in the corresponding image pixels, which are determined as corrupted and is one otherwise.
- 2.Construct the detailed part of the image as follows:${y}^{\text{D}}=\left|\frac{y\phantom{\rule{0.5em}{0ex}}*\phantom{\rule{0.5em}{0ex}}h}{\mathrm{Mask}*\mathrm{\text{h}}}-y\right|$(5)
- 3.The noisy part of the image is determined as below:${y}^{\text{N}}{}_{i,j}=\left\{\begin{array}{l}0\phantom{\rule{1em}{0ex}}\mathrm{if}\phantom{\rule{0.5em}{0ex}}{y}^{\text{D}}{}_{i,j}\phantom{\rule{0.3em}{0ex}}\le \phantom{\rule{0.3em}{0ex}}\mathrm{correlation}\phantom{\rule{0.25em}{0ex}}\mathrm{threshold}\\ {y}_{i,j}\phantom{\rule{5.5em}{0ex}}\mathrm{otherwise}\end{array}\right.$(7)
- 4.
In the image y, replace all the pixels with values equal to g _{ max } with zero.
- 5.
If the entropy of positive elements of the image y is larger than the entropy threshold, stop the iterations, otherwise go to step 1.
B. Image Restoration Using the AIM Filter:
Unlike many techniques which increase the size of the window, until all corrupted pixels are detected and restored, our approach is to employ a small filter, iteratively. This approach has two advantageous: 1) better results, because of stronger correlation among adjacent pixels and 2) less complexity, because of implementation using linear shift-invariant filters.
To restore noisy pixels, we first compute the Distance Transform (DT) of the image. Each element of DT contains the Euclidean distance of the corresponding image pixel with the nearest uncorrupted pixel. For Euclidean distance calculation, we employed the fast algorithm described in [13].
The image y^{0} is the input for the AIM filter. In this image, each noisy pixel takes the grey-value of its nearest uncorrupted pixel. In the AIM filter, the noisy pixels which their corresponding elements of DT have larger value, will be modified in more iterations. Also, Mask^{0} is the all one matrix with the same size as the image and p is the probability of corrupted pixels, which are determined by IVD.
- 1.Iteratively update the image and the Mask matrix. Start from k = 1 and continue until $\frac{k}{3p}$ is greater than the maximum element of DT.${y}^{k}{}_{i,j}=\{\begin{array}{cc}\hfill {y}^{k-1}{}_{i,j}\hfill & \hfill {\mathrm{if}\phantom{\rule{0.25em}{0ex}}\mathrm{DT}}_{i,j}<\frac{k}{3p}\hfill \\ \hfill {y}^{k-1}{}_{i,j}*\mathrm{\text{h}}\hfill & \hfill \mathrm{otherwise}\hfill \end{array}\phantom{\rule{0.25em}{0ex}}$(8)${\mathrm{Mask}}^{k}{}_{i,j}=\{\begin{array}{cc}\hfill {\mathrm{Mask}}^{k-1}{}_{i,j}\hfill & \hfill {\mathrm{if}\phantom{\rule{0.25em}{0ex}}\mathrm{DT}}_{i,j}<\frac{k}{3p}\hfill \\ \hfill {\mathrm{Mask}}^{k-1}{}_{i,j}*\mathrm{\text{h}}\hfill & \hfill \mathrm{otherwise}\hfill \end{array}\phantom{\rule{0.25em}{0ex}}$(9)
- 2.Restored image is obtained by pixel-wise division of the final image and Mask matrix as below:$\mathrm{Restored}\phantom{\rule{0.25em}{0ex}}\mathrm{Image}=\frac{{y}^{\mathrm{Final}}}{{\mathrm{Mask}}^{\mathrm{Final}}}$(10)
Some uncorrupted pixels which have one of impulse values are identified as corrupted by IVD. They are likely to be reproduced in the restoration stage. However, to avoid false alarms, at the end and for each pixel, if the difference between the estimated and original pixel values is lower than the correlation threshold, we replace it with the original value.
Simulation results
The entropy of test images
Image | Entropy |
---|---|
Baboon | 7.36 |
Barbara | 7.63 |
Boat | 7.19 |
Couple | 7.06 |
Hill | 7.48 |
Lena | 7.45 |
Man | 7.19 |
F16 | 6.58 |
Peppers | 7.30 |
Average | 7.25 |
A. Salt & Pepper Noise (SPN):
Restoration results in PSNR (dB) for image Lena corrupted by various densities of SPN
Restoration results in PSNR (dB) for different images corrupted by 80% SPN
Median filter | OCS [4] | EPA [5] | SAWM [6] | DAM [7] | CM [8] | FEMF [9] | AIM [Proposed] | |
---|---|---|---|---|---|---|---|---|
Baboon | 8.15 | 20.48 | 21.30 | 20.95 | 20.34 | 20.53 | 20.46 | 21.44 |
Barbara | 7.90 | 21.69 | 23.08 | 22.96 | 22.09 | 22.80 | 22.44 | 23.49 |
Boat | 8.12 | 24.73 | 25.87 | 25.68 | 25.01 | 25.63 | 25.48 | 26.57 |
Couple | 8.19 | 24.87 | 25.72 | 25.52 | 25.06 | 25.51 | 25.24 | 26.45 |
Hill | 8.07 | 26.63 | 27.83 | 27.62 | 27.12 | 27.33 | 27.27 | 28.51 |
Lena | 8.14 | 27.95 | 29.01 | 28.84 | 27.95 | 28.59 | 28.47 | 29.82 |
Man | 8.08 | 26.06 | 27.11 | 26.85 | 26.24 | 26.39 | 26.52 | 27.70 |
F16 | 7.57 | 24.91 | 26.02 | 26.30 | 25.72 | 25.96 | 25.98 | 27.09 |
Peppers | 7.64 | 24.17 | 25.63 | 25.56 | 25.17 | 25.15 | 25.40 | 26.58 |
Average | 7.98 | 24.61 | 25.73 | 25.59 | 24.97 | 25.32 | 25.25 | 26.41 |
Runtime in seconds for various densities of SPN in the MATLAB environment
B. Fixed-Range Impulse Noise (FRIN):
Traditional methods for SPN removal fail to restore images corrupted by FRIN. Thus, in this case we compare the proposed filter only with appropriate techniques, i.e. BDND, NFT and TSSM.
Conclusion
In this paper, we introduced a more realistic model for the impulse noise called General Fixed-Valued Impulse Noise (GFN). This model implies that, instead of fixed values or ranges, impulses can take any subset of the entire grey-values dynamic range. This model requires a more complex impulse detector, because the noise values do not necessarily locate at the low and high-intensities. We proposed a procedure for impulse value detection using the image entropy. For image restoration, an Adaptive Iterative Mean (AIM) filter is presented. In this filter, the noisy pixels which are farther than their nearest uncorrupted pixel, will be modified in more iterations. The AIM filter outperforms the best existing techniques for SPN and FRIN removal. The proposed method is fast and quite suitable for real-time applications.
Declarations
Authors’ Affiliations
References
- Bovik A: Handbook of image and video processing. Academic Press; 2000.Google Scholar
- Astola J, Kuosmanen P: Fundamentals of nonlinear digital filtering. CRC Press Inc., Boca Raton; 1997.Google Scholar
- Huang TS, Yang GJ, Tang GY: Fast two-dimensional median filtering algorithm. IEEE Trans. Acoustics, Speech. Signal Process 1979, 1(1):13-18.Google Scholar
- Deng Z, Yin Z, Xiong Y: High probability impulse noise-removing algorithm based on mathematical morphology. IEEE Signal Process. Lett 2007, 14(1):31-34.View ArticleGoogle Scholar
- Chen PY, Lien CY: An efficient edge-preserving algorithm for removal of salt-and-pepper noise. IEEE Signal Process. Lett 2008, 15: 833-836.Google Scholar
- Zhang X, Xiong Y: Impulse noise removal using directional difference based noise detector and adaptive weighted mean filter. IEEE Signal Process. Lett 2009, 16(4):295-298.MathSciNetView ArticleGoogle Scholar
- Jourabloo A, Feghahati AH, Jamzad M: New algorithms for recovering highly corrupted images with impulse noise. Scientia Iranica 2012, 19(6):1738-1745. 10.1016/j.scient.2012.07.016View ArticleGoogle Scholar
- Zhou Z: Cognition and Removal of Impulse Noise with Uncertainty. IEEE Trans. Image Process 2012, 21(7):3157-3167.MathSciNetView ArticleGoogle Scholar
- Hsieh MH, Cheng FC, Shie MC, Ruan SJ: Fast and efficient median filter for removing 1–99% levels of salt-and-pepper noise in images. Eng. Appl. Artif. Intel 2012. 10.1016/j.engappai.2012.10.012Google Scholar
- Ng PE, Ma KK: A switching median filter with boundary discriminative noise detection for extremely corrupted images. IEEE Trans. Image Process 2006, 15(6):1506-1516.View ArticleGoogle Scholar
- Indu S, Ramesh C: A noise fading technique for images highly corrupted with impulse noise. International Conference on Computing: Theory and Applications, (ICCTA) 2007, 627-632.Google Scholar
- Xia J, Xiong J, Xu X, Zhang Q: An efficient two-state switching median filter for the reduction of impulse noises with different distributions. 3rd International Congress on Image and Signal Processing (CISP), vol. 2 2010, 639-644.Google Scholar
- Maurer C, Rensheng Q, Vijay R: A linear time algorithm for computing exact Euclidean distance transforms of binary images in arbitrary dimensions. IEEE Trans. Pattern Anal. Mach. Intell 2003, 25(2):265-270. 10.1109/TPAMI.2003.1177156View ArticleGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.