- Research Article
- Open Access
A New Switching-Based Median Filtering Scheme and Algorithm for Removal of High-Density Salt and Pepper Noise in Images
- V. Jayaraj^{1}Email author and
- D. Ebenezer^{1}
https://doi.org/10.1155/2010/690218
© V. Jayaraj and D. Ebenezer. 2010
- Received: 21 December 2009
- Accepted: 17 June 2010
- Published: 11 July 2010
Abstract
A new switching-based median filtering scheme for restoration of images that are highly corrupted by salt and pepper noise is proposed. An algorithm based on the scheme is developed. The new scheme introduces the concept of substitution of noisy pixels by linear prediction prior to estimation. A novel simplified linear predictor is developed for this purpose. The objective of the scheme and algorithm is the removal of high-density salt and pepper noise in images. The new algorithm shows significantly better image quality with good PSNR, reduced MSE, good edge preservation, and reduced streaking. The good performance is achieved with reduced computational complexity. A comparison of the performance is made with several existing algorithms in terms of visual and quantitative results. The performance of the proposed scheme and algorithm is demonstrated.
Keywords
- Median Filter
- Linear Prediction
- Impulse Noise
- Infinite Impulse Response
- Impulsive Noise
1. Introduction
when the input is a stationary random process. When the window size " " tends to infinity, this probability tends to 0.5. Streaking and blotching are undesirable effects. Postprocessing of the median filter output is desirable. A better solution is to use other nonlinear filters based on order statistics, which have better performance than median filter with reduced streaking and computational complexity. Streaking cannot be neglected particularly in high-density noise situations where a large number of pixels in a processing window are noisy pixels. One strategy, which is the simplest, is to replace the corrupted pixel by an immediate uncorrupted pixel. When window is moved to the next position, a similar situation arises. The replacement involves repetition of the uncorrupted pixel. This repetition causes streaking. In several algorithms such as adaptive algorithms and robust estimation algorithms, this repetition is less frequent and therefore is not as visible as in case of DBA. This paper introduces a new switching-based median filtering scheme and algorithm for removal of impulse noise with reduced streaking under the constraint of reduced computational complexity. The algorithm is also expected to provide good noise performance and edge preservation. This paper considers salt and pepper type impulse noise [12–17].
2. Switching-Based Median Filters
Switching-based median filters are well known. Identifying noisy pixels and processing only noisy pixels is the main principle in switching-based median filters. There are three stages in switching-based median filtering, namely, noise detection, estimation of noise-free pixels and replacement. The principle of identifying noisy pixels and processing only noisy pixels has been effective in reducing processing time as well as image degradation. The limitation of switching median filter is that defining a robust decision measure is difficult because the decision is usually based on a predefined threshold value. In addition the noisy pixels are replaced by some median value in their vicinity without taking into account local features such as presence of edges. Hence, edges and fine details are not recovered satisfactorily, especially when the noise level is high. In order to overcome these drawbacks. Chan et al. [16] have proposed a two-phase algorithm. In the first phase an adaptive median filter is used to classify corrupted and uncorrupted pixels. In the second phase, specialized regularization method is applied to the noisy pixels to preserve the edges besides noise suppression. The main drawback of this method is that the processing time is very high because it uses very large window size. There are several strategies for identification, processing, and replacement of noisy pixels. The simplest strategy is to replace the noisy pixels by the immediate neighborhood pixel. The DBA [17] employs this strategy wherein the computation time is the lowest among several standard algorithms even at higher noise densities. A disadvantage of this strategy is increased streaking. It is highly desirable to limit streaking which degrades the final processed image. This is indeed a challenging task under the constraint that the processing time be kept as low as possible while preserving edges and removing most of the noise.
3. New Switching-Based Median Filtering Scheme
This paper develops a new switching-based median filtering scheme for tackling the problem of streaking in switching-based median filters with minimal increase in computational load while preserving edges and removing most of the noise. The new scheme employs linear prediction in combination with median filtering. The proposed scheme is based on a new concept of substitution prior to estimation.
A linear predictive substitution of noisy pixels prior to estimation is proposed. The new scheme consists of four stages, namely, detection, substitution, estimation, and replacement in contrast to the existing schemes which work with three stages, namely, detection, estimation, and replacement.
Stage 1 takes pixels of the input image and identifies pixels corrupted by salt and pepper noise. Salt and pepper noise produces two-level pixels, namely, 0 and 255 and, therefore, identification is straightforward.
Stage 2 employs a simple modified first-order linear predictor whose output is used as a substitution for noisy pixels. It should be stated here that the linear predictor is not used as an estimator in strict sense. This new use of linear predictor is developed in the next section.
where is the th order statistic of the observation data. The performance of an L-estimator depends on its weights which are some fixed coefficients.
Stage 4 replaces noisy pixels by the estimated pixels.
The methods chosen in each stage are strongly influenced by the goals, namely, good noise performance, reduced streaking, edge preservation, and minimal computational complexity.
4. Linear Predictive Substitution of Noisy Pixels
We consider the case where an image is corrupted by salt and pepper noise at high noise density levels such that more than half of the pixels inside a window (2D-representation) or inside an array (1D representation) are impulses of value 0 or 255. Noise-free pixels take on values between 0 and 255. For the purpose of analytical treatment, let be a set consisting of original noise-free image pixels and the median of Let be a set in which are noise-free pixels, and are pepper noise pixels. Let be the median of For simplicity, it is assumed that the elements of the set are arranged in ascending order of the values of the pixels. Let be substituted by a new set and be the median of The first elements are noise-free pixels from set and the rest of the elements from are substitution pixels for the noisy pixels These substitution pixels are derived from noise-free image pixels as developed in Section 5. In the case of high density noise levels above 50 percent, the median is also a noisy pixel. Let by and be replaced by
Proposition.
where represents the norm in L1 sense.
Proof.
is an impulse not correlated with because the errors due to faulty operations do not depend on the original signal. Let be the autocorrelation Let be a substitute sample derived from one or more of the noise-free image pixels such that is a prediction. Let be the cross-correlation Now, . If , then impulse noise sample is correlated with and is not correlated with which is a contradiction. This is true for the subsequent elements in the sets and Therefore, . In other words, we propose that in the case of high density impulse noise levels, the median of a substitute set derived from noise-free pixels of the original set according to a predescribed rule that enhances correlation results in a denoised pixel
The next section develops a method for deriving substitute pixels for impulse noise pixels of a given corrupted image.
5. A Low-Order Recursive Linear Predictor from Finite Data
is defined as for to It is assumed that signal values are real. Consider the set and let be substituted by which is a prediction from or all previous elements. Let so that is the new substitute pixel for Now, let be substituted by the prediction . Again, let . We substitute for and so on. The new set is now wherein are substitution pixels for noisy pixels by linear prediction from noise-free pixels. Rewriting as we have This is the substitution set introduced in Section 4.
In image processing with a short finite data, assumption of a power spectrum with known characteristics is generally not possible. The predictor coefficients can be determined from autocorrelation of the available data where signal model is not available. This is a reasonable approach in realistic situations [18].
There are several advantages of the proposed scheme. In DBA the current noisy pixel under processing is replaced with the median of the processing window. If the median itself is corrupted, then the median is replaced by a previously processed neighborhood pixel. At higher noise densities most of the pixels will be corrupted necessitating repeated replacement. This repeated replacement produces streaking. The proposed method avoids this.
In robust statistics estimation filter [19–21], the current noisy pixel under processing is replaced by an image data estimated using an estimation algorithm. But the computation time is much longer. It will be demonstrated in Section 7 that the linear prediction substitution followed by median filtering as introduced by this paper can overcome the problem of streaking and blur while the computational complexity is reduced in comparison with robust statistics estimation filter.
6. The Proposed Noise Removal Algorithm
Let denote the image corrupted by salt and pepper noise. For each pixel a 2-D sliding window of size is selected in such a way that the current pixel lies at the centre of the sliding window. The proposed algorithm first detects the noisy pixel. If the current processing pixel lies inside the dynamic range [ ] then it is considered as a noise-free pixel. Otherwise it is considered as a noisy pixel and replaced by a value using the proposed linear prediction algorithm.
Step 1.
A 2-D window " " of size is selected. Assume that current pixel under processing is
Step 2.
If is an uncorrupted pixel and it is left unchanged and the window slides to the next position.
Step 3.
Else is a corrupted pixel and go to Step 10.
Step 4.
Store all the elements of " " in a 1-D array " ".
Step 5.
Sort the 1-D array " " in ascending order.
Step 6.
For each pixel in " " of value "255" moving from left to right, replace by a predicted value which is given by where and are autocorrelation for lags 1 and 0.
If substitute by (This is a special case when the pixel is a salt noise pixel having the value 0.)
Step 7.
If substitute by (This is a special case when the pixel is a pepper noise pixel having the value 255.)
Step 8.
The new array is Sort the 1-D array " " with predicted values and find the median value.
Step 9.
Replace the current pixel under processing by the above median value.
Step 10.
Steps 1 to 3 are repeated until processing is completed for the entire image.
7. Illustration of the Proposed Algorithm
Each and every pixel of the image is checked for the presence of salt and pepper noise pixel. During processing if a pixel element lies between "0 and 255", it is left unchanged. If the value is 0 or 255, then it is a noisy pixel and it is substituted by a substitution pixel.
Array labeled displays an image corrupted by salt and pepper noise.
Array labeled depicts the current processing window and a pepper noise pixel. The square shown in solid line represents the window; and element inside the circle represents a pepper noise pixel
If the current pixel under processing is between 0 and 255, it is left unchanged. Otherwise it will be replaced by a new pixel value estimated using the proposed algorithm. For this purpose, the elements inside processing window are arranged as an array and sorted in ascending order
Check for the pixel elements of value "255" starting from the left. If the pixel value is "255", then that value will be substituted by a predicted value from the immediate neighborhood pixel. Array Z_{A}illustrates this. The element inside the circle is the substitute pixel for the pepper noise pixel. This is repeated for all the pixels having the value "255". Array is sorted again to find the median. This is shown as array The element encircled is the median
Finally, the current noisy pixel in the window in array is replaced with the new median value. The final processed array is shown as
The element encircled in array is the final estimate of the pepper noise pixel of array In the proposed algorithm, a window will slide over the entire image. Computation complexity is minimum with a fixed window. This procedure is repeated for the entire image. Similar procedure can be adopted for the salt noise substitution, estimation, and replacement.
8. Simulation Results and Discussion
In this section, results are presented to illustrate the performance of the proposed algorithm. Images are corrupted by uniformly distributed salt and pepper noise at different densities for evaluating the performance of the algorithm. Three images are selected. They are Lena, Cameraman, and Boat image. A quantitative comparison is performed between several filters and the proposed algorithm in terms of Peak Signal-to-Noise Ratio (PSNR), Mean Square Error (MSE), Image Enhancement Factor (IEF), Mean Structural SIMilarity (MSSIM) Index, and computational time. The results show improved performance of the proposed algorithm in terms of these measures. Matlab R2007b on a PC equipped with 2.21 GHz CPU and 2 GB RAM has been used for evaluation of computation time of all algorithms.
PSNR and MSE for various filters for Lena image at different noise densities.
Noise density (%) | PSNR | MSE | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
SMF | PSMF | AMF | DBA | REMF | PA | SMF | PSMF | AMF | DBA | REMF | PA | |
20 | 29.039 | 32.379 | 37.561 | 37.476 | 38.204 | 40.188 | 81.126 | 37.6033 | 11.4017 | 11.6275 | 9.8338 | 9.1702 |
50 | 15.095 | 20.997 | 30.061 | 30.249 | 31.499 | 32.942 | 2011..9 | 516.869 | 64.1182 | 61.4046 | 46.050 | 41.5837 |
70 | 9.861 | 9.884 | 25.509 | 25.737 | 27.228 | 28.133 | 6713.6 | 6679.1 | 182.901 | 173.518 | 123.09 | 99.9569 |
80 | 7.926 | 7.983 | 22.975 | 22.936 | 24.702 | 25.836 | 10482 | 10346 | 327.752 | 330.747 | 220.25 | 169.607 |
90 | 6.441 | 6.485 | 19.283 | 19.770 | 21.355 | 24.316 | 14739 | 14609 | 767.042 | 685.698 | 476.01 | 240.925 |
IEF and MSSIM for various filters for Lena image at different noise densities.
Noise density (%) | IEF | MSSIM | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
SMF | PSMF | AMF | DBA | REMF | PA | SMF | PSMF | AMF | DBA | REMF | PA | |
20 | 47.757 | 102.53 | 338.13 | 331.43 | 391.56 | 398.51 | 0.081 | 0.932 | 0.975 | 0.974 | 0.978 | 0.990 |
50 | 4.811 | 18.692 | 150.17 | 157.32 | 209.35 | 241.55 | 0.025 | 0.570 | 0.899 | 0.898 | 0.924 | 0.940 |
70 | 2.014 | 2.024 | 74.156 | 78.265 | 110.14 | 155.65 | 0.012 | 0.054 | 0.790 | 0.796 | 0.852 | 0.883 |
80 | 1.481 | 1.494 | 47.199 | 46.653 | 70.085 | 100.74 | 0.009 | 0.026 | 0.708 | 0.708 | 0.790 | 0.860 |
90 | 1.183 | 1.188 | 22.669 | 25.360 | 36.483 | 88.383 | 0.005 | 0.011 | 0.568 | 0.583 | 0.683 | 0.812 |
PSNR and MSE for various filters for Boat image at different noise densities.
Noise density (%) | PSNR | MSE | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
SMF | PSMF | AMF | DBA | REMF | PA | SMF | PSMF | AMF | DBA | REMF | PA | |
20 | 27.091 | 30.110 | 34.840 | 34.706 | 35.256 | 38.428 | 127.06 | 63.396 | 21.334 | 22.004 | 19.387 | 16.632 |
50 | 15.074 | 20.406 | 27.820 | 27.842 | 28.985 | 31.393 | 2021.5 | 592.166 | 107.408 | 106.867 | 82.137 | 64.782 |
70 | 9.889 | 9.833 | 23.726 | 23.730 | 24.143 | 26.775 | 6671.3 | 6557.700 | 275.748 | 275.461 | 198.95 | 152.041 |
80 | 7.966 | 7.959 | 21.198 | 21.552 | 22.865 | 24.555 | 10388 | 10404.00 | 493.466 | 454.861 | 336.19 | 266.823 |
90 | 6.542 | 6.558 | 17.942 | 18.294 | 19.369 | 22.220 | 14416 | 14363.000 | 1044.500 | 963.108 | 751.93 | 389.985 |
IEF and MSSIM for various filters for boat image at different noise densities.
Noise density (%) | IEF | MSSIM | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
SMF | PSMF | AMF | DBA | REMF | PA | SMF | PSMF | AMF | DBA | REMF | PA | |
20 | 30.185 | 59.774 | 176.77 | 172.65 | 196.61 | 204.95 | 0.109 | 0.918 | 0.970 | 0.970 | 0.973 | 0.982 |
50 | 4.685 | 15.975 | 88.062 | 88.574 | 115.02 | 126.85 | 0.035 | 0.576 | 0.879 | 0.878 | 0.903 | 0.951 |
70 | 1.989 | 1.974 | 47.993 | 48.274 | 66.722 | 77.234 | 0.017 | 0.065 | 0.754 | 0.756 | 0.807 | 0.912 |
80 | 1.466 | 1.464 | 30.766 | 33.230 | 45.331 | 53.011 | 0.011 | 0.032 | 0.657 | 0.665 | 0.726 | 0.839 |
90 | 1.184 | 1.186 | 16.361 | 17.689 | 22.783 | 41.416 | 0.007 | 0.016 | 0.518 | 0.531 | 0.600 | 0.787 |
PSNR and MSE for various filters for Cameraman image at different noise densities.
Noise density (%) | PSNR | MSE | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
SMF | PSMF | AMF | DBA | REMF | PA | SMF | PSMF | AMF | DBA | REMF | PA | |
20 | 23.987 | 25.101 | 30.973 | 30.401 | 31.058 | 34.009 | 259.64 | 200.880 | 51.976 | 59.292 | 50.972 | 28.544 |
50 | 14.417 | 18.507 | 24.212 | 24.034 | 24.671 | 25.933 | 2351.5 | 917.025 | 246.554 | 256.824 | 221.80 | 147.737 |
70 | 9.455 | 9.397 | 20.944 | 20.580 | 21.893 | 23.686 | 7372.7 | 7471.200 | 523.252 | 568.926 | 420.55 | 297.153 |
80 | 7.768 | 7.719 | 18.328 | 18.621 | 19.659 | 22.700 | 10871. | 10996.000 | 18.328 | 893.218 | 703.41 | 357.309 |
90 | 6.169 | 6.202 | 15.621 | 16.591 | 17.103 | 22.151 | 15711. | 15592.000 | 1782.500 | 1425.600 | 1267.0 | 436.059 |
IEF and MSSIM for various filters for cameraman image at different noise densities.
Noise density (%) | IEF | MSSIM | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
SMF | PSMF | AMF | DBA | REMF | PA | SMF | PSMF | AMF | DBA | REMF | PA | |
20 | 15.451 | 19.597 | 79.626 | 67.752 | 73.015 | 98.192 | 0.137 | 0.902 | 0.966 | 0.963 | 0.966 | 0.986 |
50 | 4.293 | 11.092 | 41.427 | 39.008 | 45.476 | 66.712 | 0.048 | 0.569 | 0.871 | 0.868 | 0.883 | 0.949 |
70 | 1.920 | 1.902 | 27.092 | 25.021 | 33.443 | 45.143 | 0.026 | 0.071 | 0.758 | 0.757 | 0.795 | 0.884 |
80 | 1.484 | 1.461 | 16.948 | 18.203 | 22.947 | 39.644 | 0.017 | 0.040 | 0.668 | 0.675 | 0.718 | 0.860 |
90 | 1.165 | 1.167 | 10.223 | 12.729 | 14.327 | 36.718 | 0.008 | 0.018 | 0.541 | 0.586 | 0.619 | 0.848 |
Comparison of PSNR and CPU time in seconds for cameraman image.
Method | Noise density = 70% | Noise density = 80% | Noise density = 90% | |||
---|---|---|---|---|---|---|
PSNR | Time | PSNR | Time | PSNR | Time | |
SMF | 9.8887 | 0.1043 | 7.9656 | 0.1055 | 6.5424 | 0.1111 |
Raymond H.Chan et al. | 23.7257 | 38.4543 | 21.1982 | 44.4529 | 17.9415 | 51.0610 |
DBA | 23.7302 | 5.6979 | 21.552 | 5.6357 | 18.2941 | 5.7585 |
REMF | 24.1434 | 17.9368 | 22.8649 | 20.4194 | 19.369 | 23.0306 |
PA | 26.7745 | 6.8083 | 24.5547 | 7.7198 | 22.2203 | 8.8524 |
In the proposed method, replacement by immediate neighborhood is avoided by substitution of noisy pixels potential candidates based on linear prediction. Since linear prediction is employed prior to any processing, repetition of the same pixel is avoided as window is moved from one position to the next position. This eliminates streaking. In the standard switching median filtering except DBA, estimation of noise-free pixels takes considerable time on account of mathematical criteria employed. This time increases significantly in adaptive based estimation techniques. In the proposed filter, the estimation is not based on explicit computation of estimation criteria; instead a median filtering replaces estimation. This is the main reason for reduction in computational complexity. Extra computation necessitated by low-order linear prediction is significantly smaller than techniques employing rigorous estimation schemes. The DBA which is one of the fastest algorithms (which also avoids estimation) involves three median sorting, namely, right sorting, left, and diagonal sorting. In the proposed filter there is only two sortings. Therefore introduction of first-order linear prediction only slightly increases the computation time compared with DBA but much lower than other filters. The proposed algorithm can be a good compromise in preference to the adaptive algorithm, DBA, and robust statistics-based algorithm.
9. Conclusion
A new switching-based median filtering scheme and an algorithm for removal of high-density salt and pepper noise in images is proposed. The algorithm is based on a new concept of substitution prior to estimation in contrast to the standard switching-based nonlinear filters. Noisy pixels are substituted by prediction prior to estimation. A simple novel recursive linear predictor is developed for this purpose. A subsequent optimization by median filtering results in final estimates. The performance of the algorithm is compared with that of SMF, PSMF, AMF, DBA, and REMF in terms of Peak Signal-to-Noise Ratio, Mean Square Error, Mean Structure Similarity Index, and Image Enhancement Factor and Computational time. Both visual and quantitative results are demonstrated. The results show that the notable features of the proposed algorithm are reduced streaking at high noise densities compared to DBA which is one of the fastest algorithm and reduced computational complexity compared to adaptive and robust algorithms. The proposed algorithm can be a good compromise for salt and pepper noise removal in images at high noise densities. However, further reduction in computational complexity is desirable.
Authors’ Affiliations
References
- Pitas I, Venetsanopoulos AN: Nonlinear Digital Filters Principles and Applications. Kluwer Academic Publishers, Norwell, Mass, USA; 1990.View ArticleMATHGoogle Scholar
- Astola J, Kuosmanen P: Fundamentals of Nonlinear Digital Filtering. CRC Press, Boca Raton, Fla, USA; 1997.MATHGoogle Scholar
- Gallagher NC Jr., Wise GL: A theoretical analysis of the properties of median filters. IEEE Transactions on Acoustics, Speech, and Signal Processing 1981, 29(6):1136-1141. 10.1109/TASSP.1981.1163708View ArticleGoogle Scholar
- Nodes TA, Gallagher NC Jr.: Median filters: some modifications and their properties. IEEE Transactions on Acoustics, Speech, and Signal Processing 1982, 30(5):739-746. 10.1109/TASSP.1982.1163951View ArticleGoogle Scholar
- Abreu E, Lightstone M, Mitra SK, Arakawa K: A new efficient approach for the removal of impulse noise from highly corrupted images. IEEE Transactions on Image Processing 1996, 5(6):1012-1025. 10.1109/83.503916View ArticleGoogle Scholar
- Brownrigg DRK: The weighted median filter. Communications of the ACM 1984, 27(8):807-818. 10.1145/358198.358222View ArticleGoogle Scholar
- Yli-Harja O, Astola J, Neuvo Y: Analysis of the properties of median and weighted median filters using threshold logic and stack filter representation. IEEE Transactions on Signal Processing 1991, 39(2):395-410. 10.1109/78.80823View ArticleMATHGoogle Scholar
- Arce GR, Paredes JL: Recursive weighted median filters admitting negative weights and their optimization. IEEE Transactions on Signal Processing 2000, 48(3):768-779. 10.1109/78.824671View ArticleGoogle Scholar
- Dong Y, Xu S: A new directional weighted median filter for removal of random-valued impulse noise. IEEE Signal Processing Letters 2007, 14(3):193-196.View ArticleGoogle Scholar
- Chen T, Ma K-K, Chen L-H: Tri-state median filter for image denoising. IEEE Transactions on Image Processing 1999, 8(12):1834-1838. 10.1109/83.806630View ArticleGoogle Scholar
- Hwang H, Haddad RA: Adaptive median filters: new algorithms and results. IEEE Transactions on Image Processing 1995, 4(4):499-502. 10.1109/83.370679View ArticleGoogle Scholar
- Zhang S, Karim MA: A new impulse detector for switching median filters. IEEE Signal Processing Letters 2002, 9(11):360-363. 10.1109/LSP.2002.805310View ArticleGoogle Scholar
- Eng H-L, Ma K-K: Noise adaptive soft-switching median filter. IEEE Transactions on Image Processing 2001, 10(2):242-251. 10.1109/83.902289View ArticleMATHGoogle Scholar
- Wang Z, Zhang D: Progressive switching median filter for the removal of impulse noise from highly corrupted images. IEEE Transactions on Circuits and Systems II 1999, 46(1):78-80. 10.1109/82.749102View ArticleGoogle Scholar
- Ng P-E, Ma K-K: A switching median filter with boundary discriminative noise detection for extremely corrupted images. IEEE Transactions on Image Processing 2006, 15(6):1506-1516.View ArticleGoogle Scholar
- Chan RH, Ho C-W, Nikolova M: Salt-and-pepper noise removal by median-type noise detectors and detail-preserving regularization. IEEE Transactions on Image Processing 2005, 14(10):1479-1485.View ArticleGoogle Scholar
- Srinivasan KS, Ebenezer D: A new fast and efficient decision-based algorithm for removal of high-density impulse noises. IEEE Signal Processing Letters 2007, 14(3):189-192.View ArticleGoogle Scholar
- Hayes MH: Statistical Digital Signal Processing and Modeling. John Wiley & Sons, Singapore; 2002.Google Scholar
- Schulte S, Nachtegael M, DeWitte V, van der Weken D, Kerre EE: A fuzzy impulse noise detection and reduction method. IEEE Transactions on Image Processing 2006, 15(5):1153-1162.View ArticleGoogle Scholar
- Ben Hamza A, Krim H: Image denoising: a nonlinear robust statistical approach. IEEE Transactions on Signal Processing 2001, 49(12):3045-3054. 10.1109/78.969512View ArticleGoogle Scholar
- Wang Z, Bovik AC, Sheikh HR, Simoncelli EP: Image quality assessment: from error visibility to structural similarity. IEEE Transactions on Image Processing 2004, 13(4):600-612. 10.1109/TIP.2003.819861View ArticleGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.