A New Technique for Edge Improved Salt and Pepper Noise Removal

DOI : 10.17577/IJERTV4IS070215

Download Full-Text PDF Cite this Publication

Text Only Version

A New Technique for Edge Improved Salt and Pepper Noise Removal

D.Vijayalakshmi,

Department of Electronics and Communication, Vignan Institute of Engineering for Women, Visakhapatnam.

T. Sandhya Kumari,

Department of Electronics and Communication, Vignan Institute of Engineering for Women, Visakhapatnam.

Abstract – Filtering impulse noise with edge details preservation is an important task during denoising. In this proposed method if the pixel is detected as a noisy pixel, then it undergoes edge preserving process to detect whether the pixel is a corrupted pixel or edge. This step improves the impulse noise removal especially at higher noise densities using an adaptive window in the filtering process. The performance of the proposed method is compared with the existing decision based median and standard median filter in terms of PSNR and SSIM which showed improved performance.

Keywords – Denoising,Edgepreserving,Adaptive Median Filtering.

I.INTRODUCTON

The Images are usually corrupted with noises from by various sources. Amongst the various types of noises the impulse noise affects the image during image acquisition and transmission. Impulse noise is independent and uncorrelated to image pixels. The impulse noise is of two types namely the fixed valued impulse noise known as salt and pepper noise; the other one is random valued impulse noise.

In the salt and pepper noise, the noisy pixels take either salt value (255) or pepper value (0) and it appears black and white spots on the images. If p is the total noise density then salt noise and pepper noise will have a noise density of p/2.The mathematical representation of impulse noise is given as:

0or 255 with probability p

gxy = ———-(1)

fxywith probability 1-p

Where gxy represents the noisy image pixel, p is the total noise density of impulse noise and fxy is the uncorrupted image pixel. Every time the salt noise and pepper noise may have different noise densities p1 and p2 and the total noise density will be p=p1+ p2.

The two important aspects of image processing are removal of noise and preserving the edge details. Linear and nonlinear filters are used for noise reduction. But nonlinear filter provides better results in reducing impulse noise. The Median filters widely used for preserving the edges and to improve the PSNR values. The linear filters mostly follow a neighborhood averaging mechanism for removing impulse noise. But that tends to destroy all high frequency

components like edges in the image, so nonlinear digital filters widely used for removing impulse noise are median filters. Median filters are known for their capability to remove impulse noise as well as preserve the edges. This led to the development of nonlinear median-type filters such as stack filters [4], multistage median [5], weighted median [6,7], rank conditioned median [8], and relaxed median [9]. The main drawback of a standard median filter (SMF) is that it is effective only for low noise densities. At high noise densities, SMFs often exhibit blurring for large window sizes and insufficient noise suppression for small window sizes. The filters designed for image processing are required to yield sufficient noise reduction without losing the high fre-quency content of image edges [13], [16]. However, most of the median filters operate uniformly across the image and thus tend to modify both noise and noise-free pixels. Consequently, the effective removal of impulse often leads to images with blurred and distorted features. Ideally, the filtering should be applied only to corrupted pixels while leaving un-corrupted pixels intact [10][12]. Applying median filter unconditionally across the entire image as practiced in the conventional schemes would inevitably alter the intensities and remove the signal details of uncorrupted pixels. Therefore, a noise detec-tion process to discriminate between uncorrupted pixels and the corrupted pixels prior to applying nonlinear filtering is highly desirable.

Decision-based or switching median filters [11], [14] have been proposed with this objective. Possible noisy pixels are identified and replaced with median value or its variant while leaving uncorrupted pixels unchanged. The main drawback of decision-based or switching median filter is that defining a robust decision measure is difficult [12], because the decision is usually based on a predefined threshold value.Although the processing time is less but there occurs a heavy blurring at high noise levels. In order to improve the performance of filtering a new method is proposed. The proposed method has two stages. In the first stage the noisy pixels are identified and in the second stage noise is reduced with edge preservation.

  1. PROPOSED METHOD

    The proposed method comprises of two parts namely detection stage and second stage wherein noise elimination is undertaken with edge preservation. The detection stage with a 3×3 window size provides a better image detail with relatively low loss of the image

    information. The Impulse noise is added to the targeted image, and then the noisy pixels are detected with reference to three different conditions. After the detection of noisy pixels they, are subjected to de-noising process. The complete de -noising process is as follows:-

    Step One:-

    First take smallest size of filtering window i.e.,

    3X3.

    gx-1,y-1 gx-1,y gx-1,y+1

    gxy= gx,y-1 gx,y gx-y+1 gx+1,y-1 gx+1,y gx+1,y+1

    Step Two:-

    The above shown expression has nine elements in filtering window. After excluding the central pixel i.e. gx,y , in 3X3 filtering window, then calculate maximum and minimum for the remaining 8 pixel in the filtering window.

    Min[g] = min [gx-1,y-1,gx-1,y,gx-1,y+1, gx,y-1,gx-y+1, gx+1,y-1,gx+1,y,gx+1,y+1]

    Max[g] = max [gx-1,y-1,gx-1,y,gx-1,y+1, gx,y-1,gx-y+1, gx+1,y-1,gx+1,y,gx+1,y+1]

    three conditions arise:

    1. When the value of center pixel lies between max and minvalue of present window then it is termed as noise free pixel.

      Max [g] > gx,y> Min[g] – (Noise free pixel)

    2. When the value of center pixel is more than maximum orlesser than minimum, then it is termed as noisy pixel.

    gx,y> Max [g] or gx,yj< Min [g] – (Noisy pixel)

    (b) When the value of center pixel equals the minimum or themaximum, i.e.

    gx,y = Max [g] or gx,yj = Min [g]

    Thereafter determine from center pixel whether it is an edge or a noisy pixel. In this detection process the filtering window would be subdivided to four sub windows, i.e. central column, central row and two diagonals respectively. Afterthencalculate sum of absolute difference between gx,y and its neighbours as follows:

    Central Column (m1) = { gx+1,y – gx,y} + { gx-1,y – gx,y } Central Row (m2) = { gx,y-1-gx,y} + { gx-y+1-gx,y}

    Diagonal 1 (m3) = { gx+1,y-1-gx,y} + { gx-1,y+1-gx,y }

    Diagonal 2 (m4) = { gx+1,y+1-gx,y } + { gx-1,y-1-gx,y }

    (d)The minimum value is determined fro 4 sub windows and is termedas pivot point, i.e. M.

    v= min [m1, m2, m3, m4]

    However: If

    v<T1 (30) or v>T2 (230) then

    gx,y = Noisy pixel Else

    gx,y = Noise-free, and it is an edge.

    then median filtering method is used for the noisy pixel. The Denoising step involves following:-

    1. Moving a spatially adaptive window (w) of size 3×3 over the noisy image.

    2. Testing the central pixel of the spatial window to determine whether it is corrupted or uncorrupted.

    3. A pixel of an image can have values only between 0 and 255. In impulse noise crrupted image the noisy pixels normally obtain minimum or maximum pixel values i.e. either 0 or 255. In case the pixel is non- noisy, then it is unprocessed else, use the adaptive median filter to the pixel. Then, the arithmetic data within this window are calculated which include minimum ( min), maximum (max) and median values (median) for the pixels.

    4. Two prong approaches are applied on the basis of the calculated parameters. if the median value lies between the min and the max pixel values; it is further confirmed that the centre pixel x(i,j) also lies within these limits. thereafter when first condition is confirmed , then centre pixel, x(i,j) is left unprocessed

      {y(i,j) = x(i,j)} else x(i,j) is substituted by the median value {y(i,j) = median}; where: y(i,j) signifies the restored pixel value. However, if the median value does not lie within the min and the max pixel values; the size of the window ( w) is adaptively increased by a factor of 2.

    5. Thereafter, the shifting of the spatial window (centering it) to the next pixel in the noisy image. The control then transfers again to the first step, determining the parameters within this incremented window. It is pertinent to mention that the increment in the window size is permitted only to a maximum limit (wmax) of 9×9; beyond which the centre pixel will be always replaced by the last processed pixel value.

  2. PERFORMANCEMEASURES

The performance of the proposed method is quantitatively estimated using the parameters Peak Signal to Noise Ratio (PSNR) in dB and Structural Similarity Index (SSIM).

PSNR = 10log10 255 2

MSE= ( )2

Where

r – original image

x -restored image

MN -size of the original image

To show the individuality of the proposed algorithm, experiments are carried out on low, medium and high detailed standard images. All images are grayscale with intensity values in the range of [0, 255]. Images are of size 256×256.

SSIM = (2 +1)(2 +2 )

( 2+ 2 +1 )( 2+ 2+2 )

Fig. 1 shows comparison among the repaired

where

images obtained by standard, SMF(3X3), DMF [1],and the

proposed filter in this paper. The performances in terms of

PSNR and SSIM for all the above mentioned algorithms are

µx -Average of x

µy -Average of y

2 -Variance of x

2 -Variance of y

-covariance of x and y

C1=(k1L)2,C2=(k2L)2

Where

L=dynamic range (L=255) k1=0.01 and k2=0.03

IV .RESULTS AND DISCUSSIONS

The proposed filter is tested using 256×256, 8-bits/pixel gray scale high detailed image of Barbara, Lena, Cameraman and Baboon as input images .The images are corrupted by impulse noise at various densities.

For qualitative analysis, performances of the filters are tested at different levels of noise densities, and the results are shown in Figs. 1. In Fig. 1, the first column represents original images, and the second column represents noisy images at different densities. Subsequent columns represent the processed images for SMF, DMF, and PA respectively.

shown inTable I and II, III and IV respectively.

Table I shows computed values of PSNR and SSIM for the cameraman image at all noise levels. Similarly Table II shows the values for Barbara image, Table III for Lena image and Table IV for Baboon image. It is clear from the Tables at all noise levels the performance the proposed filter overtakes the present one. The qualitative analysis from Fig. 1 proves that the levelof impulse noise is considerably reduced and the picturing is also improved to a great extent in the reconstructed images. For higher noise density level (50%-90%), the performance of the proposed filter is preserving the details of the image along with suppression of noise.

V.CONCLUSION

This paper proposes an adaptive median filtering with edge preservation for suppression of impulse noise at high noise intensities; without incorporation of difficult optimization techniques. The proposed approach performs decision to edge or noisy pixel and for the noisy pixel; the window size is depending upon the number of corrupted pixels within the local window to a maximum of 9×9. The results show that the proposed filter recommends an effective improvement in the performance across a wide range of noise densities in comparison with other filtering approaches.

(a)

(b)

(c)

(d)

(e)

Fig 1.Simulation results of different filters column. (a) Original image. (b) Noisy corrupted image. (c) Output for SMF. (d) Output for DMF. (e) Output for PA. Row 1 shows the cameraman image corrupted by 50% noise. Row 2 shows the barbaral image corrupted by 60% noise. Row 3 shows the Lena image corrupted by 70% noise. Row 4 shows the baboon image corrupted by 80% noise.

Impulse Noise Density

PSNR

SSIM

SMF

DMF

PA

SMF

DMF

PA

10%

25.934

30.373

34.08

0.947

0.998

0.999

20%

24.142

28.538

30.048

0.889

0.997

0.998

30%

20.57

27.003

28.06

0.879

0.996

0.998

40%

17.427

25.335

26.02

0.869

0.994

0.996

50%

14.282

23.623

24.29

0.860

0.992

0.995

60%

11.724

22.55

23.49

0.853

0.990

0.991

70%

9.434

21.00

22.327

0.815

0.980

0.989

80%

7.757

19.328

21.00

0.800

0.960

0.985

90%

6.186

17.225

18.231

0.662

0.950

0.980

Table I PSNR and SSIM for cameraman at different noise intensites Table II PSNR and SSIM for Barbara image at different noise intensites

Impulse Noise Density

PSNR

SSIM

SMF

DMF

PA

SMF

DMF

PA

10%

27.861

32.52

36.625

0.995

0.998

0.999

20%

25.697

31.059

33.01

0.989

0.997

0.998

30%

21.801

29.29

30.245

0.969

0.995

0.998

40%

18.084

27.67

28.277

0.959

0.991

0.997

50%

15.023

25.938

26.530

0.927

0.986

0.997

60%

2.028

24.433

24.77

0.918

0.972

0.996

70%

9.80

22.435

23.433

0.895

0.934

0.995

80%

8.059

20.699

21.596

0.844

0.925

0.990

90%

6.618

17.663

19.791

0.789

0.899

0.980

Table III PSNR and SSIM for lena image at different noise intensites

Impulse Noise Density

PSNR

SSIM

SMF

DMF

PA

SMF

DMF

PA

10%

31.616

36.19

39.48

0.88

0.997

0.999

20%

27.511

34.25

35.29

0.83

0.994

0.998

30%

22.649

31.44

32.262

0.789

0.993

0.994

40%

18.566

29.18

30.145

0.728

0.99

0.991

50%

14.41

27.558

28.623

0.69

0.985

0.989

60%

11.661

26

27.021

0.659

0.982

0.985

70%

9.26

23.83

25

0.637

0.945

0.983

80%

7.42

21.101

23.05

0.6

0.882

0.958

90%

5.789

18.014

20.7

0.577

0.843

0.943

Table IV PSNR and SSIM for Baboon image at different noise intensites

Impulse Noise Density

PSNR

SSIM

SMF

DMF

PA

SMF

DMF

PA

10%

27.861

32.52

36.625

0.995

0.998

0.999

20%

25.697

31.059

33.01

0.989

0.997

0.998

30%

21.801

29.29

30.245

0.969

0.995

0.998

40%

18.084

27.67

28.277

0.959

0.991

0.997

50%

15.023

25.938

26.530

0.927

0.986

0.997

60%

12.028

24.433

24.77

0.918

0.972

0.996

70%

9.80

22.435

23.433

0.895

0.934

0.995

80%

8.059

20.699

21.596

0.844

0.925

0.990

90%

6.618

17.663

19.791

0.789

0.899

0.980

REFERENCES

  1. 1.K.S. SrinivasanandD.Ebenezer, A New Fast and Efficient Decision-Based Algorithm for Removal of High-Density Impulse Noises, IEEE Signal Processing Letters, Vol. 14, No. 3, pp. 189-192 2007.

  2. Md. MansoorRoomi ,T. PandyMaheswari , V. Abhai Kumar, A Detail Preserving Filter for Impulse Noise Detection and Removal, ICGST-GVIP Journal, Volume 7, Issue 3, November 2007.

  3. Vikas Gupta, RajeshMahle, UmeshGour, Image Noise Removal with Detail Preservation for Random Valued Impulse Noise,2 013 Nirma University International Conference on Engineering (NUiCONE).

  4. P. D. Wendt, E. J. Coyle, and N. C. Gallagher, Stack filters, IEEE Trans.Acoust., Speech, SignalProcessing, vol. ASSP-34, pp. 898919,Aug. 1986.

  5. G. R. Arce and R. E. Foster, Detail preserving ranked- order based filters for image processing,

6.

IEEE Trans. Acoust., Speech, Signal Processing, vol.37, pp. 8398, Jan. 1989.

  1. S. J. Ko and Y. H. Lee, Center weighted median

    filters and their applications to image enhancement

    IEEE Trans. Circuits Syst., vol. 38, no.9, pp. 984993, Sep. 1991.

  2. R. Yang, L. Yin, M. Gabbouj, J. Astola, and Y. Neuvo, Optimal weighted median filters under tural constraints, IEEE Trans.SignalProcessing, vol. 43, pp. 591604, Mar. 1995.

  3. R. C. Hardie and K. E. Barner, Rank conditioned rank selection filters for signal restoration, IEEETrans.Image Processing, vol. 3, pp.192206, Mar.1994.

  4. A. Ben Hamza, P. Luque, J. Martinez, and R. Roman, Removing noise and preserving details with relaxed median filters, J. Math. Imag. Vision, vol. 11, no. 2, pp. 161177, Oct. 1999.

  5. S. Zhang and M. A. Karim, A new impulse detector for switching median filters, IEEE Signal Process. Lett., vol. 9, no. 11, pp. 360363, Nov. 2002.

  6. H.-L. Eng and K.-K. Ma, Noise adaptive soft-switching median filter, IEEE Trans. Image Process., vol. 10, no. 2, pp. 242251, Feb. 2001.

  7. G. Pok and J.-C. Liu, Decision based median filter improved by pre-dictions, in Proc. ICIP, 1999, vol. 2, pp. 410413.

  8. T. Sun and Y. Neuvo, Detail-preserving median based filters in image processing, Pattern Recognit. Lett., vol. 15, pp. 341347, 1994.

  9. D. Florencio and T. Schafer, Decision-based median filter using local signal statistics, in Proc. SPIE Int. Symp. Visual CommunicationsImage Processing, Chicago, IL, Sep. 1994.

  10. I. Pitas and A. N. Venetsanopoulos, Nonlinear Digital Filters Princi-ples and Applications. Norwell, MA: Kluwer, 1990.

  11. C. A. Pomalaza-Racz and C. D. Macgillem, An adaptive non linear edge preserving filter, IEEE Trans. Acoust., Speech, Signal Process., vol. ASSP-32, pp. 571576, Jun. 1984

Leave a Reply