CORRELATION COEFFICIENT BASED DETECTION ALGORITHM FOR REMOVAL OF RANDOM VALUED IMPULSE NOISE IN IMAGES

Transcription

1 NEETI SINGH AND O UMAMAHESWARI: CORRELATION COEFFICIENT BASED DETECTION ALGORITHM FOR REMOVAL OF RANDOM VALUED IMPULSE NOISE IN IMAGES DOI: /ijivp CORRELATION COEFFICIENT BASED DETECTION ALGORITHM FOR REMOVAL OF RANDOM VALUED IMPULSE NOISE IN IMAGES Neeti Singh and O. Umamaheswari Department of Electronics and Communication Engineering, College of Engineering, Guindy, Anna University, Chennai, India Abstract This paper aims to present an alternative and novel method for removal of Random Valued Impulse Noise in corrupted images which is a challenging task as compared to the removal of fixed valued impulse noise. The proposed algorithm i.e. Correlation Coefficient Based Detection Algorithm (CCBD) is a two stage filter. The Detection stage of CCBD utilises the Correlation Coefficients of the absolute differences of the pixels in detection window with their Mean, the Central Pixel and a predefined value respectively. The Filtering stage of CCBD utilises the Fuzzy Switching Weighted Median filter (FSWM) for restoration of the corrupted image. The performance of CCBD has been compared to some of the existing methods e.g. Rank Order Absolute Difference (), Rank Order Logarithmic Difference (), Triangle Based Linear Interpolation () and Adaptive Switching Median () algorithms. The Comparative analysis in terms of MSE, PSNR and SSIM show that the CCBD is superior to the existing methods in all parameters. Keywords: Random Valued Impulse Noise, Correlation Coefficient, High Density Noise, Fuzzy Switching Weighted Median Filter, Noise Removal, Correlation Coefficient based Detection Algorithm. 1. INTRODUCTION Digital images usually get corrupted by different kinds of noise due to various reasons such as malfunctioning pixels in camera sensors, faulty memory locations and transmission in noisy channel [1]. In Random Valued Impulse Noise (RVIN), noisy pixels randomly assume a value between and 255 and it is very difficult to detect them [2]. The noise removal from noisy images in such situations becomes a challenging problem. There exist several methods and algorithms which attempt to remove RVIN from corrupted images [3]-[14]. However, these algorithms have their own assumptions, advantages and limitations. Some of them alter all the pixels irrespective of the level of noise corruption whereas certain other schemes first carry out the detection of impulsive noise followed by the altering of the noisy pixels. The existing methods which have been considered for comparison with the proposed method (CCBD) are the Rank Order Absolute Difference Algorithm () [15], Rank Order Logarithmic Difference () [16], Triangle Based Linear Interpolation Algorithm () [17] and Adaptive Switching Median Algorithm () [18]. At lower Noise Densities, these algorithms perform satisfactorily. However, at higher Noise Densities, these filtering schemes produce images which have blurring effect, unpreserved edges and poor resolution due to miss detection of noisy pixels as noise free and vice versa. Therefore, a novel method of noise detection named Correlation Coefficient based Detection Algorithm (CCBD) has been proposed in this paper which is better than the existing algorithms as shown by its performance on various metrics. In [15], the detection stage is based on the absolute differences between the Central Pixel (CP) and other pixels. After calculating the absolute values, it is arranged in an ascending order. Predefined threshold is utilised to ascertain whether a pixel is noisy or noise free. The algorithm works well for low noise densities. The algorithm is similar to the. The advantage of the is that it takes the logarithmic function of the absolute differences for comparison [16]. The detection stage of gives better results as compared to the because it can easily differentiate between the noisy and noise free pixels. The main drawback of the algorithm is misdetection at higher noise densities. method [17] utilises the Triangle-Based Linear Interpolation [19], [2] to detect noisy and noise free pixels. It is designed to suppress the RVIN while preserving image details. Differential Evolution algorithm [21] is used to optimize the tuning parameter which is used in to control the process of detection stage. In the algorithm, the noisy pixels are detected by using the absolute deviation of the Central Pixel (CP) with the mean value which is then compared with a threshold value [18], [22], [23]. If the absolute deviation is greater than the threshold value, the pixel under consideration is treated as noisy pixel otherwise it is treated as noise free. Only noisy pixels are subjected to filtering process. The proposed algorithm CCBD is also a two stage filter. The detection stage of CCBD involves 3 conditions to be verified in order to accurately detect noisy pixels. These conditions are based on the Correlation Coefficients of the absolute differences of the pixels in detection window (except CP) with their Mean (µ), the Central Pixel (CP) and a predefined value explained later. The filtering stage of CCBD is based on the Fuzzy Switching Weighted Median filter (FSWM) to replace only the noisy pixels detected in the detection stage while leaving noise free pixels unaltered [24]-[26]. The CCBD filter yields better results than the existing methods in all the performance parameters like MSE, PSNR and SSIM. Although there is some misdetection in CCBD filter, it gives satisfying results even at very high noise densities like 95% RVIN. 2. PROPOSED DETECTION ALGORITHM 2.1 NOISE MODEL This filter uses the random valued impulse noise model (RVIN) of unequal probability. The Probability density function, F(Q i,j), can be expressed as, 1614

2 y y y ISSN: (ONLINE) ICTACT JOURNAL ON IMAGE AND VIDEO PROCESSING, NOVEMBER 217, VOLUME: 8, ISSUE: 2 ND 1 Qi, jd, 2 F Qi, j = 1 ND Qi, j Pi, j, ND2 255 d Qi, j 255, 2 where, Q i,j is the (i,j) th pixel in the corrupted image, P i,j is the i,j th pixel in the original image, N D is the Noise Density and d is the noise intensity level. Here, N D = (N D1 + N D2) and N D1 and N D2 represent the pepper and salt noise densities, respectively which are different i.e. (N D1 N D2). The dynamic range of the image intensity values is [, R-1], where R = 2 z and z is the number of bits per pixel. Here, an 8-bit gray image is assumed and hence, z = 8 and R = CORRELATION AND DEPENDENCE Correlation or dependence or association between two variables or datasets is a statistical relationship which may or may not be causal. Correlation generally refers to the extent to which two datasets have a linear relationship. Correlations can be applied for ascertaining the behaviour of a parameter in some instances because they indicate a predictive relationship between that parameter and another. Though the presence of a correlation alone is not sufficient to infer the presence of a causal relationship yet it provides an indication of a possible relationship which has to be established by other conditions. The correlation can be viewed as synonymous with dependence in informal parlance but it refers to one of the several specific types of relationship between the mean values in a technical sense. Therefore, a correlation can be considered as an evidence for a possible causal relationship but it cannot indicate as to what such causal relationship might be, if any. 2.3 CORRELATION COEFFICIENT The correlation coefficient (r) measures the linear dependence between the two variables or datasets. There are different types of correlation coefficients. The research uses the Pearson s correlation coefficient in the proposed algorithm. The mathematical formula for computing correlation coefficient between two datasets x and y is as follows, xy n i1 n i1 x -x y -y i n x -x y -y i i 2 2 i1 i where, {x 1,x 2,,x n} and {y 1,y 2,y n} are two datasets containing n values and x and y are mean values of these datasets respectively. As explained earlier, the Correlation Coefficient indicates the strength and the direction of the linear relationship between two datasets. It may take any value from -1 and +1. A value of +1 shows total positive linear correlation, shows no linear correlation at all and -1 shows total negative linear correlation between two datasets. A perfect Correlation of ±1 occurs only when all the points of the dataset fall on a single straight line. A value greater than.8 generally signifies a strong correlation between the datasets whereas a value less than.5 generally signifies a weak correlation. The Fig.1 below shows the different (1) (2) values of the Correlation Coefficient between two datasets x and y and their inter-relationship graphically Total Positive Correlation, r = x (a) Total Negative Correlation, r = x (b) Weak Positive Correlation, < r < x (c) 1615

3 y y NEETI SINGH AND O UMAMAHESWARI: CORRELATION COEFFICIENT BASED DETECTION ALGORITHM FOR REMOVAL OF RANDOM VALUED IMPULSE NOISE IN IMAGES Weak Negative Correlation, -1 < r < x (d) No Correlation, r = x (e) Fig.1. Graph of Correlation Coefficients for different kinds of Correlations: (a) Total Positive Correlation, (b) Total Negative Correlation, (c) Weak Positive Correlation, (d) Weak Negative Correlation, (e) No Correlation 2.4 CORRELATION COEFFICIENT BASED DETECTION ALGORITHM (CCBD) Correlation Coefficient Based Detection (CCBD) Algorithm makes use of three Correlation Coefficients calculated mutually for three datasets obtained by taking absolute differences of pixels in the detection window (except CP) with its Mean (µ), Central Pixel (CP) and number (which is the average luminescence value i.e. the average of and 255). Then by applying three predefined conditions, we segregate noisy pixels from non-noisy pixels. The reason for choosing the concept of correlation coefficient for detection of noisy pixels is following. If the CP is a noisy pixel, the absolute differences of all pixels in a window (except CP) with the CP will throw up an array which will not have close Correlation with an array formed of the absolute differences of those pixels with their Mean (µ) or the average luminescence value (i.e ). In contrast, if the CP is non-noisy, the arrays obtained as above will have close Correlation with each other. As seen earlier, a Correlation below.5 depicts a weak association between the datasets. Therefore, the conditions used in this Algorithm are based on the value.5 which is taken as a Threshold for correlation coefficient below which the CP will be termed as noisy. However, if the value of the correlation coefficient is higher than.5, further conditions need to be verified to detect the noisy pixels. The step wise Algorithm is given as below: Step 1: Let s take a 55 window as detection window. Then calculate the Mean of all pixels of this window except the CP and denote it as µ. Step 2: Calculate A ij as Absolute differences of µ with all pixels of the detection window except CP and get 24 such values. Step 3: Calculate B ij as Absolute difference of CP with all pixels of the detection window except CP and get 24 such values. Step 4: Now, calculate C ij as Absolute difference of the number with all pixels of the detection window except CP and get 24 such values. Step 5: Now, calculate following Correlation Coefficients by using the formula in Eq.(2), r ba = Correlation Coefficient of arrays B ij and A ij (3) r bc = Correlation Coefficient of arrays B ij and C ij (4) r ac = Correlation Coefficient of arrays A ij and C ij (5) Step 6: Now, apply the first condition as follows- If r ba <.5, CP is noisy, Else r ba.5 Check the second condition End Step 7: Now, apply the second condition as follows- If.5 r ba <.95 and r bc <.5, CP is noisy, Else r ba.95, Check the third condition, End Step 8: Now, apply the third condition as follows- If r ba.95 and r bc <.5 and r ac <.5, CP is noisy, Else, CP is non-noisy, End By this Algorithm we detect all the noisy pixels in the corrupted image and feed them to the Filtering stage for restoration. 3. FILTERING ALGORITHM In the filtering stage, we consider only the noisy pixels without altering the noise free pixels. The fuzzy switching weighted median filter (FSWM) is utilised in the filtering stage of CCBD [24]-[26]. The FSWM filter is an improvisation over the Median Filter and the Fuzzy Switching Median Filter which give limited 1616

4 ISSN: (ONLINE) ICTACT JOURNAL ON IMAGE AND VIDEO PROCESSING, NOVEMBER 217, VOLUME: 8, ISSUE: 2 restoration results [27]-[3]. The FSWM provides better replacement results because the noisy pixels after detection alone are replaced by the fuzzy switching weighted median value of the noise-free pixels in its surrounding. The restoration value in FSWMF is a linear equation of the original pixel value, Fuzzy function and the weighted median value. The steps involved are as follows: Step 1: To extract Local Information, we first calculate the absolute luminance difference δ i,j in a window W(3,3) as follows i k, j l Wi k, j l Wi, j (6) where, (i+k, j+l) (i,j) and -N k, l N Step 2: The maximum absolute luminance difference in the filtering window i.e. Local Information is defined as: i, j max i k, j l (7) Step 3: Then the Fuzzy reasoning is applied to the Local Information D i,j. The fuzzy membership function FF i,j is defined as follows N D Qi, jd, 2 FFi, j = 1 N D Qi, j Pi, j (8) N D 255 d Qi, j 255, 2 Step 4: The next step is the calculation of the weighted median (MED) by using the noise-free pixels. The weights of a pixel are decided on the basis of the gradient of the surrounding pixels as follows 3 if 5 w mn, 2 if 5 1 and (9) 1 if 1 MED median wm, n Wi m, j n (1) with Q i+m,j+n as noise free pixel. The idea behind choosing only the noise-free pixels in calculation of MED is to avoid the vitiation of the weighted median by the noisy pixels if at all they are also taken into account. Step 5: The restoration term is thus defined as linear combination of original pixel value and median value, i.e. S (1 FF ) Q FF MED (11) X, Y X, Y X, Y X, Y In this manner, the pixels which are marked noisy alone are replaced in the filtering stage and the noise-free pixels are retained the same without any modification. This ensures an accurate restoration of corrupted image even at higher noise densities. effectiveness and robustness of the CCBD over a variety of images. The size of the images has been chosen as and RVIN of unequal probability (N D1 =.25N D; N D2 =.75N D) with noise intensity level up to 4 (i.e. d = 4) has been used to corrupt these images before filtering. Simulations have been carried out in Matlab R213a for a noise density varying from 75% to 95% RVIN and comparison of CCBD is done with different filters like [15], [16], [17] and [18]. From the detected outputs of the existing methods, it can be seen that there is a large number of miss detection of noisy pixels as non-noisy and vice versa. However, in the proposed CCBD, miss detection is substantially minimized and only noisy pixels are detected as noisy. Some miss detection occurs in CCBD which will be addressed in our future works. Mean Square Error (MSE) and Peak Signal-to-Noise Ratio (PSNR) in db provide the quantitative measurement of restoration performance. These are defined as, MSE 1 S i j P i j,, 2 M N (12) i1 j1 MN PSNR 255 db MSE 2 1log1 (13) where, M and N are the total number of pixels in the horizontal and vertical dimensions of the image, and S(i,j) and P(i,j) are the pixel values in the (i,j) th locations of the restored image and the original image, respectively. The structural similarity (SSIM) index is another parameter used for measuring the similarity between the original and restored images. It is designed to give better results than the traditional methods like MSE and PSNR which give results only in numbers and fail to capture the visual perception. For two images, u and v, the SSIM index is defined as, SSIM(u,v) = [l(u,v)] α [c(u,v)] β [s(u,v)] γ (14) where, l(u,v), c(u,v), and s(u,v) are the Luminance, Contrast and Structure components of the index respectively. Typical values of the constants are taken as α = β = γ = 1. Matlab specific functions are used to calculate the MSE, PSNR and SSIM. The Fig.2, Fig.3 and Fig.4 depicts the restoration results of different filters i.e. [15], [16], [17], [18] and CCBD for Lena, boat and cameraman images corrupted by 95% of RVIN respectively. As already mentioned, the CCBD method uses a level by level verification to avoid miss detection of noise free pixels as noisy pixels. From Fig.2, Fig.3 and Fig.4 we can see that the existing methods fail to restore the images at higher noise densities whereas the proposed method CCBD restores the corrupted images efficiently. Not only the restoration of images is satisfactory but the edge preservation and contrast are also better. 4. SIMULATION RESULTS AND DISCUSSIONS To demonstrate the effectiveness of the proposed method CCBD, we have considered various standard test images like Lena, Boat, Cameraman, Barbara, Baboon, Monarch, Pepper and Rice which are extensively used in literature to measure the performance of the existing methods. Further, TID28 database (a set of 25 images) was considered to demonstrate the (a) (b) (c) 1617

5 NEETI SINGH AND O UMAMAHESWARI: CORRELATION COEFFICIENT BASED DETECTION ALGORITHM FOR REMOVAL OF RANDOM VALUED IMPULSE NOISE IN IMAGES (d) (e) (f) (d) (e) (f) (g) Fig.2. Comparison of Restoration of Lena image corrupted by 95% RVIN: (a) Original Image, (b) Noisy Image, (c) [15], (d) [16], (e) [17], (f) [18], (g) CCBD (a) (b) (c) (d) (e) (f) (g) Fig.3. Comparison of Restoration of Boat image corrupted by 95% RVIN: (a) Original Image, (b) Noisy Image, (c) [15], (d) [16], (e) [17], (f) [18], (g) CCBD (a) (b) (c) (g) Fig.4. Comparison of Restoration of Cameraman image corrupted by 95% RVIN: (a) Original Image, (b) Noisy Image, (c) [15], (d) [16], (e) [17], (f) [18], (g) CCBD From simulations we have seen that [15] algorithm provides good results only up to 5% noise density beyond which miss detection is very high. Although the [16] provides better results than the [15], it also is not satisfactory after 6% noise density. [17] detection algorithm is also good only up to 75% noise density beyond which miss detection increases and picture quality worsens. [18] though provides better value of MSE, it does not give good quality picture restoration because of miss detection at higher noise densities. In contrast, the CCBD method provides very good results because it is based on adaptive conditions and its algorithm is robust. Due to less miss detection, the restoration of corrupt images by CCBD is of very high quality. The FSWM filtering used in CCBD also contributes towards the accurate restoration. It is seen that the performance of the CCBD filter is far better than the other filters even when the noise density is 95%. The Table.1, Table.2 and Table.3 below respectively show the comparison of MSE, PSNR and SSIM of CCBD with existing methods for Lena, Boat and Cameraman images corrupted with noise densities from 75% to 95%. The Fig.5(a) and Fig.5(b) below show the graph of PSNR vs. Noise Density and SSIM vs. Noise Density for different methods for Lena and Boat respectively. Table.1. Comparison of MSE of CCBD with existing methods for Lena, Boat and Cameraman images corrupted with RVIN of different Noise Densities Noise Density 75% 8% Image [15] [16] [17] [18] CCBD Lena Boat Cameraman Lena Boat Cameraman % Lena

6 SIM PSNR ISSN: (ONLINE) ICTACT JOURNAL ON IMAGE AND VIDEO PROCESSING, NOVEMBER 217, VOLUME: 8, ISSUE: 2 9% 95% Boat Cameraman Lena Boat Cameraman Lena Boat Cameraman Table.2. Comparison of PSNR of CCBD with existing methods for Lena, Boat and Cameraman images corrupted with RVIN of different Noise Densities Noise Density 75% 8% 85% 9% 95% Image [15] [16] [17] [18] CCBD Lena Boat Cameraman Lena Boat Cameraman Lena Boat Cameraman Lena Boat Cameraman Lena Boat Cameraman Table.3. Comparison of SSIM of CCBD with existing methods for Lena, Boat and Cameraman images corrupted with RVIN of different Noise Densities Noise Density 75% 8% 85% 9% 95% Image [15] [16] [17] [18] CCBD Lena Boat Cameraman Lena Boat Cameraman Lena Boat Cameraman Lena Boat Cameraman Lena Boat Cameraman CCBD 3 75% 8% 85% 9% 95% Noise Density (a) 75% 8% 85% 9% 95% Node Density (b) CCBD Fig.5. Graphical Comparison of Performance Parameters of CCBD with existing methods: (a) PSNR vs Noise Density for Lena, (b) SSIM vs. Noise Density for Boat From the Table.1, it can be seen that the CCBD achieves a significantly low MSE value even at 95% noise density. This is primarily because of the relatively better noise detection and efficient fuzzy switching weighted median filtering compared to the median filtering used in other methods. It is again evident from the Table.2 and Fig.5(a) that the CCBD consistently returns the higher values of PSNR as compared to the other methods. From the Table.3 and Fig.5(b), it s clear that the CCBD filter provides best results in SSIM even at very high noise densities. The higher values of SSIM yielded by CCBD are also supported by the visual comparison of the original and corrupted images, whereby it s evident that the CCBD filter is able to preserve the thin lines when compared with the other filters. In fact, the uniqueness of the CCBD is that the SSIM of the results increases with increase in the noise density. This phenomenon has been discussed later in this paper. In addition to the three standard images (i.e. Lena, Boat and Cameraman), simulations have also been carried out on the TID28 database. Average values of MSE, PSNR and SSIM have been calculated for the existing methods and compared with the CCBD for the TID28 database in the Table.4, Table.5 and Table

7 NEETI SINGH AND O UMAMAHESWARI: CORRELATION COEFFICIENT BASED DETECTION ALGORITHM FOR REMOVAL OF RANDOM VALUED IMPULSE NOISE IN IMAGES Table.4. Restoration Results in average MSE for TID28 database corrupted by RVIN Noise Density [15] [16] [17] [18] CCBD 75% % % % % (a) Table.5. Restoration Results in average PSNR for TID28 database corrupted by RVIN Noise Density [15] [16] [17] [18] CCBD 75% % % % % Table.6. Restoration Results in average SSIM for TID28 database corrupted by RVIN Noise Density [15] [16] [17] [18] CCBD 75% % % % % These simulations demonstrate that the proposed algorithm provides superior results than the existing methods at higher noise densities for a wide range of images. Since the restored picture quality is also comparably good in CCBD, its SSIM values at higher noise densities are better than that of,, and. The restoration results of CCBD on TID28 image database for 95% noise density are shown in the Fig.6. (b) (c) Fig.6. Restoration of CCBD algorithm on TID28 database corrupted with 95% RVIN (a) Original Images (b) Noisy Images (c) Restored Images by CCBD Therefore, for high noise densities i.e. after 75%, the proposed method CCBD consistently yields better values of the performance parameters as compared to the [15], [16], [17] and [18] algorithms. Further, the picture quality returned by the CCBD is superior to other methods up to 162

8 ISSN: (ONLINE) ICTACT JOURNAL ON IMAGE AND VIDEO PROCESSING, NOVEMBER 217, VOLUME: 8, ISSUE: 2 very high noise densities. With the increase in the noise density, CCBD s performance remains more or less steady up to 9 to 95% Noise Density whereas the performance of other methods deteriorate very sharply. This is possible because the CCBD method satisfactorily attempts to address miss detection up to 95% whereas other methods fail to do so. The Fig.7 below shows the restoration of cropped Lena image by existing methods and CCBD. (a) (b) (c) (d) (e) (f) (c) Fig.8. Restoration performance of CCBD on different images corrupted by 95% RVIN (a) Original Images (From left to right: Barbara, Baboon, Monarch, Pepper and Rice ) (b) Corrupted Images with 95% RVIN and (c) Restored Images by CCBD Algorithm The Fig.8 shows the restoration of Barbara, Baboon, Monarch, Pepper and Rice images corrupted by RVIN of 95% noise density by the CCBD. From the above results we can conclude that the proposed method provides satisfactory results even up to very high noise densities e.g. 95% for the above images. Since the quality of the restored picture is comparably very good in CCBD, its SSIM values at higher noise densities are also very high. Further, to avoid miss detection, the CCBD uses three conditions involving various calculations thereby taking slightly higher calculation time as compared to above methods. Our future work will be to attempt to reduce the calculation time as well as reduction of the minute miss detection present now. 5. ROBUSTNESS OF CCBD ALGORITHM (g) Fig.7. Comparison of Restoration of cropped Lena image corrupted by 95% RVIN (Special emphasis on Hat, Mirror and Eyebrow in the image): (a) Original Image, (b) Noisy Image, (c) [15], (d) [16], (e) [17], (f) [18], (g) CCBD Here, we can see that neither of the existing methods is able to restore the Hat and Mirror portion of the cropped Lena image properly. Since their detection is satisfactory only up to 5 to 75% noise density, miss detection beyond that results in blurring and haziness. In contrast, the detection in CCBD is satisfactory up to 95% with minute miss detection. This results in better restoration of image and better contrast as compared to the existing methods. In restoration of cropped Lena image, though there are rare spots of miss detection, the fine double borders of the Hat and Mirror have been properly restored. Similarly, the other minute details such as the Eyebrow have been restored properly. (a) The CCBD algorithm is a robust algorithm which has been especially designed for very high noise densities. Since the algorithm uses a 55 window, we get enough number of pixels to create sufficiently long arrays of absolute differences which returns useful values of Correlation Coefficients. The three conditions used in detection algorithm have been arrived at after carrying out numerous simulations on Matlab. Though the algorithm is not completely miss detection proof, yet the detection of noisy pixels by this algorithm is far superior to that of the existing methods as already discussed. We will now discuss three cases of Central Pixels (CP) including one noise free pixel and two noisy pixels Adjoining is a real 55 detection window taken from the CCBD s Matlab simulation where the CP is noise free with a value of 134. Values of various Correlation Coefficients used in CCBD i.e. r ba, r bc and r ac are calculated and shown in the Fig.9. As we can see from the graphs below, the value of r ba, r bc and r ac are all greater than.5 and hence none of the three conditions of the CCBD algorithm gets satisfied resulting in the detection of the CP as noise free which is true as can be seen from the detection window. (b) 1621

9 NEETI SINGH AND O UMAMAHESWARI: CORRELATION COEFFICIENT BASED DETECTION ALGORITHM FOR REMOVAL OF RANDOM VALUED IMPULSE NOISE IN IMAGES B ij B ij A ij (a) r ba =.835 Now we take another real 55 detection window where the CP is noisy with a value of 1. Values of various Correlation Coefficients used in CCBD are calculated and shown in the Fig.1. From the graphs in Fig.1 below, we see that the values of r ba and r bc are less than.5 and value of r ac is more than.5 i.e. the first condition itself is satisfied and there is no need to verify the other two. Hence, the CP is detected as noisy pixel which is true as can be seen from the detection window Now we take another real 55 detection window where the CP is noisy with a value of 251. Values of various Correlation Coefficients used in CCBD are calculated and shown in the Fig.11. From the graphs in Fig.11 below, we again see that the values of r ba and r bc are less than.5 and value of r ac is more than.5 i.e. the first condition itself is satisfied and there is no need to verify the other two. Hence, the CP is again detected as noisy pixel which is true as can be seen from the detection window. 3 A ij C ij (b) r bc = C ij (c) r ac =.8836 Fig.9. Graphs of Correlation Coefficients for a non-noisy pixel (value of CP = 134): (a) Correlation Coefficient r ba, (b) Correlation Coefficient r bc, (c) Correlation Coefficient r ac B ij B ij A ij (a) r ba = C ij (b) r bc =

10 ISSN: (ONLINE) ICTACT JOURNAL ON IMAGE AND VIDEO PROCESSING, NOVEMBER 217, VOLUME: 8, ISSUE: 2 A ij C ij (c) r ac =.9488 Fig.1. Graphs of Correlation Coefficients for a noisy pixel (value of CP = 1): (a) Correlation Coefficient r ba, (b) Correlation Coefficient r bc, (c) Correlation Coefficient r ac A ij C ij (c) r ac =.999 Fig.11. Graphs of Correlation Coefficients for a noisy pixel (value of CP = 251): (a) Correlation Coefficient r ba, (b) Correlation Coefficient r bc, (c) Correlation Coefficient r ac B ij B ij A ij (a) r ba = -.24 Further, as mentioned earlier, the proposed method i.e. CCBD is very unique in performance. As shown in the Table.7 and Fig.12, the value of SSIM of CCBD increases with increase in the Noise Density. This phenomenon is neither seen in the existing methods which have been taken for comparison in this paper nor in other algorithms mentioned in the references. This behaviour of CCBD makes it more suitable for higher Noise Densities. Though the slope of curve representing the SSIM vs. Noise Density varies for different images yet the slope is positive in all cases which mean that the CCBD invariably yields higher values of SSIM for higher Noise Densities. Table.7. Increasing Trend of SSIM calculated by CCBD method for Lena, Boat, Cameraman and TID28 database images corrupted with RVIN of different noise densities Noise Density Lena Boat Cameraman TID28 75% % % % % C ij (b) r bc =

11 SSIM NEETI SINGH AND O UMAMAHESWARI: CORRELATION COEFFICIENT BASED DETECTION ALGORITHM FOR REMOVAL OF RANDOM VALUED IMPULSE NOISE IN IMAGES % 8% 85% 9% 95% Noise Density Fig.12. Graph of SSIM for different images calculated by CCBD 6. CONCLUSION In this paper, a novel method is presented for effective removal of RVIN in images which is based on Correlation Coefficient. Numerous Simulation results have demonstrated the efficacy of this method in removing high density RVIN while preserving image details. The proposed method is found to suppress up to 95% of noise satisfactorily due to the effective use of Correlation Coefficient concept. Further, the results establish that the proposed method CCBD performs far better than the existing state-of-the-art filtering approaches as discussed in this paper. ACKNOWLEDGMENTS The authors would like to thank the Anna University, Chennai, India to provide lab for simulations and library facilities for review of literature. REFERENCES Lena Boat Cameraman TID28 [1] R.C. Gonzalez and R.E. Woods, Digital Image Processing, Prentice Hall, 22. [2] A.S. Awad, Standard Deviation for obtaining the Optimal Direction in the Removal of Impulse Noise, IEEE Signal Processing Letters, Vol. 18, No. 7, pp , 211. [3] Zhiyong Zuo, Tianxu Zhang, Jing Hu and Gang Zhou, A New Method For Removing Impulse Noise Based On Noise Space Characteristic, Optik-International Journal for Light and Electron Optics, Vol. 124, No. 18, pp , 213. [4] Gaihua Wang, Hu Zhu and Yunyan Wang, Fuzzy Decision Filter For Color Images Denoising, Optik-International Journal for Light and Electron Optics, Vol. 126, No. 2, pp , 215. [5] Vikas Gupta, Vijayshri Chaurasia and Madhu Shandilya, Random-Valued Impulse Noise Removal using Adaptive Dual Threshold Median Filter, Journal of Visual Communication and Image Representation, Vol. 26, pp , 215. [6] Ilke Turkmen, The ANN based Detector to Remove Random-Valued Impulse Noise in Images, Journal of Visual Communication and Image Representation, Vol. 34, pp , 216. [7] Muhammad Habib, Ayyaz Hussain, Saqib Rasheed and Mubashir Ali, Adaptive Fuzzy Inference System based Directional Median Filter for Impulse Noise Removal, International Journal of Electronics and Communications, Vol. 7, pp , 216. [8] E. Besdok, Impulsive Noise Suppression from Images with a Modified Two-Step Iterative-Median Filter, Journal of Electronic Imaging, Vol. 13, pp , 24. [9] Tao Chen, Kai-Kuang Ma and Li-Hui Chen, Tri-State Median Filter for Image Denoising, IEEE Transactions on Image Processing, Vol. 8, No. 12, pp , [1] E. Abreu, M. Lightstone, S.K. Mitra and K. Arakawa, A New Efficient Approach for the Removal of Impulse Noise from Highly Corrupted Images, IEEE Transactions on Image Processing, Vol. 5, No. 6, pp , [11] P. Ng and K. Ma, A Switching Median filter with Boundary Discriminative Noise Detection for Extremely Corrupted Images, IEEE Transactions on Image Processing, Vol. 15, No. 6, pp , 26. [12] W. Luo, A New Efficient Impulse Detection Algorithm for the Removal of Impulse Noise, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. 1, pp , 25. [13] N. Singh and O. Umamaheswari, Some Studies on Detection and Filtering Algorithm for the Removal of Random Valued Impulse Noise, IET Image Processing, Vol. 11, No. 11, pp , 217. [14] N. Singh and O. Umamaheswari, A new Denoising Algorthm for Random Valued Impulse Noise in Images using Measure of Disperson, Proceedings of International Conference on Signal Processing, Communication and Networking, pp , 217. [15] R. Garnett, T. Huegerich, C. Chui and W.J. He, A Universal Noise Removal Algorithm with an Impulse Detector, IEEE Transactions on Image Processing, Vol. 14, No. 11, pp , 25. [16] Yiqiu Dong, Raymond H. Chan and Shufang Xu, A Detection Statistic for Random-Valued Impulse Noise, IEEE Transactions on Image Processing, Vol. 16, No. 4, pp , 27. [17] P. Civicioglu, Removal of Random-Valued Impulsive Noise from Corrupted Images, IEEE Transactions on Consumer Electronics, Vol. 55, No. 4, pp , 29. [18] Xia Lan and Zhiyong Zuo, Random-Valued Impulse Noise Removal by the Adaptive Switching Median Detector and Detail-Preserving Regularization, Optik-International Journal for Light and Electron Optics, Vol. 125, No. 3, pp , 214. [19] P. Civicioglu and M. Alci, Impulsive Noise Suppression from Highly Distorted Images with Triangular Interpolants, International Journal of Electronics and Communications, Vol. 58, No. 5, pp , 24. [2] I. Amidror, Scattered Data Interpolation Methods for Electronic Imaging Systems: A Survey, Journal of Electronic Imaging, Vol. 11, No. 2, pp ,

12 ISSN: (ONLINE) ICTACT JOURNAL ON IMAGE AND VIDEO PROCESSING, NOVEMBER 217, VOLUME: 8, ISSUE: 2 [21] K. Price, R.M. Storn and J.A. Lampinen, Differential Evolution: A Practical Approach to Global Optimization, Springer, 25. [22] R.H. Chan, C.W. Ho and M. Nikolova, Salt-and-Pepper Noise Removal by Median-Type Noise Detectors and Detail-Preserving Regularization, IEEE Transactions on Image Processing, Vol. 1, No. 14, pp , 25. [23] A. Nieminen, P. Heinonen and Y. Neuvo, A New Class of Detail-Preserving Filters for Image Processing, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 1, No. 9, pp. 74-9, [24] Chang-You Wang, Yang Fu-ping and Gong Hui, A New Kind of Adaptive Weighted Median Filter Algorithm, Proceedings of International Conference on Computer Application and System Modelling, pp. 1-5, 21. [25] C. Suganya and O. Uma Maheswari, Image Restoration using Noise Adaptive Fuzzy Switching Weighted Median Filter for the Removal of Impulse Noise, Proceedings of Defense Science Research Conference and Expo, pp. 1-4, 211. [26] N. Singh, G. Vasugi and O. Umamaheswari, An efficient Algorithm for removing RVIN in Grayscale Images, Proceedings of 1 st International Conference on Nanoelectronics, Circuits and Communication Systems, pp , 215. [27] Jaakko Astola and Pauli Kuosmanen, Fundamentals of Non Linear Signal Processing, CRC press, [28] J. Harikiran, B. Saichandana and B. Divakar, Impulse Noise Removal in Digital Images, International Journal of Computer Applications, Vol. 1, No. 8, pp , 21. [29] W.K. Pratt, Median Filtering, Technical Report, University of Southern California, [3] Kenny Kal Vin Toh and Nor Ashidi Mat Isa, Noise Adaptive Fuzzy Switching Median Filter for Salt-and- Pepper Noise Reduction, IEEE Signal Processing Letters, Vol. 17, No. 3, pp ,