Chapter 3. Study and Analysis of Different Noise Reduction Filters
|
|
- Vernon Sullivan
- 5 years ago
- Views:
Transcription
1 Chapter 3 Study and Analysis of Different Noise Reduction Filters Noise is considered to be any measurement that is not part of the phenomena of interest. Departure of ideal signal is generally referred to as noise. Noise arises as a result of unmodelled or unmodellable processes going on in the production and capture of real signal. It is not part of the ideal signal and may be caused by a wide range of sources, e. g. variation in the detector sensitivity, environmental variations, the discrete nature of radiation, transmission or quantization errors etc. It is also possible to treat irrelevant scene details as if they are image noises e.g. surface reflectance textures. The characteristics of noise (Russo, 2005) depend on its source, as does the operator which reduces its effects. Many image processing packages contains operators to artificially add noise to an image. Deliberately corrupting an image with noise allows us to test the resistance of an image processing operator to noise and assess the performance of various noise filters. There are two ways of image corruption by noise: noise addition and noise multiplication. A model of an image degraded by additive random noise is given by (Gonzalez and Woods, 2002). g( x, y) f ( x, y) n( x, y) (3.1) Where n( x, y) represents the signal independent additive random noise. The level of noise is generally expressed by its variance. In order to compare the performance of the original, degraded and processed images, some measures of error are necessary. The Peak Signal-to-Noise Ratio (PSNR) is often used for the characterization of signal. 60
2 PSNR is the ratio between possible power of a signal and the power of corrupting noise that affects the fidelity of its representation. PSNR = 10 log10 (255 2 /MSE) (3.2) Higher PSNR value provides higher image quality. Mean square error (MSE) is given by: MSE N i j1 f ( i, j) F( i, j) 2 N 2 (3.3) Where, f is the original image F is the filtered image and N is the size of image. MSE is an estimator in many ways to quantify the amount by which a filtered/noisy image differs from noiseless image. 3.1 Classification of Different Types of Noise Digital images acquired with an electronic camera are typically corrupted with noise due to the optical system, light sensor and associated electronics. The transmission of video images is often accompanied by noise depending on environmental conditions. Video images transmitted via satellite are very susceptible to the electronic interference due to sunspot activity. Noise is classified based upon the shape of its probability density function (pdf). The mean and variance are important parameters to characterize the noise. Mean value m, gives the average brightness of the noise and square root of variance gives the average peak-to-peak gray level deviation of the noise (Xu and Lai, 1998). The mean and variance are defined as: gmax m k p ( k) (3.4) k0 n 61
3 gmax 2 2 ( kpn ( k) m) k0 (3.5) Where, p n (k) is the frequency of occurrence of noise amplitude, k and g max is the maximam gray level of the image. Ideally, k varies from - to +, however, since the pixel levels are limited in the range [0,L-1], the noise amplitude level k also lies in [0, L- 1]. Now we want to describe different types of noise that we have studied for our work Gaussian Noise The most common type of noise that is found in an image is Gaussian noise, which is the result of many unknown noises from independent sources added together. Gaussian noise is expressed by the probability density function (pdf) as (Xu and Lai, 1998): 2 ( km) 1 2 pn ( k) e ; 2 k (3.6) Where k=grey level, m mean and standard deviation In the pdf, mean is located at the peak, having highest probability of occurrence and the width is determined by the standard deviation. Gaussian noise is defined over infinite range; however, the digitized image has finite range. Hence the noise values that exceed the gray level range are deposited at the 0 and g max points on the pdf. For 99.7% of the gray levels, the peak-to-peak gray level deviation is equal to 6. Figure 3: Gaussian Noise Distribution Function 62
4 3.1.2 Salt and Pepper Noise In the salt and pepper noise model only two possible values are possible, a and b, and probability of obtaining each of them is less than 0.1(otherwise, the noise would vastly dominate the image). For an 8 bit/pixel image, the typical intensity value g for pepper noise is close to 0 and for salt noise is close to 255. The probability density function (PDF) for salt and pepper noise (Meher, 2004) model is given by: A for g a (" pepper ") PDF salt and pepper= B for g b(" salt" ) (3.7) Figure 3.1: Salt and Pepper Noise Distribution Function The salt and pepper noise is generally caused by malfunctioning of camera s sensor cells, by memory cell failure or by synchronization errors in the image digitizing or transmission. 3.2 Image Denoising Image denoising is a delicate and difficult task. A trade-off between noise reduction and the preservation of actual image features occurs, in order to enhance the relevant image content. Reducing noise has always been one of the standard problems of image processing. A multitude of methods have been proposed to remove noise as it is well 63
5 known that every source of noise creates a different type of noise. The purpose of denoising is to suppress the noise from the observed signal, and help the recovery of functions of that signal. In statistical terms (Hazma and Krim, 2001), this corresponds to a non parametric regression, where an orthogonal basis expansion is used to estimate the unknown function using a time regression setting Conventional Filters Filters are mainly used to suppress either the high frequencies in the image, i.e., for smoothing the image, or the low frequencies, i.e., for enhancing or detecting edges in the image.suppose that an image-processing operator F acts on the two input images A and B and produces output images C and D respectively. If the operator F is linear (Gonzalez and Woods, 2002; Jain, 1989), then F (a A+ b B) = a C + b D (3.8) Where a and b are constants. This means that each pixel in the output of a linear operator is the weighted sum of a set of pixels in the input image. For example, the threshold operator is non-linear (Astola and Kuosmanen, 1997) because individually, corresponding pixels in the two images A and B may be below the threshold, whereas the pixel obtained by adding A and B may be above threshold. Similarly, the absolute value operation is non-linear: -1+1 ~ = (3.9) Simple Mean Filter The moving average or mean filter (MF) is a simple linear filter. The idea of mean filtering is simply to replace each pixel value in an image with the mean (`average') 64
6 value of its neighbors, including itself (Gonzalez and Woods, 2002; Jain, 1989). This has the effect of eliminating pixel values, which are unrepresentative of their surroundings. Often a 3 3 square kernel shown in Figure 3.2 is used. 1 1 X Figure 3.2: 3 3 averaging kernel used in mean filtering It is very simple to implement in hardware and software. The computational complexity is very low. It works fine for low power AWGN. As the noise power increases, its filtering performance degrades. If the noise power is high, then a larger window should be employed for spatial sampling to have better local statistical information. As the window size increases, MF produces a reasonably high blurring effect and thus thin edges and fine details in an image are lost. There are two main problems with mean filtering, which are: A single pixel with a very unrepresentative value can significantly affect the mean value of all the pixels in its neighborhood. When the filter neighborhood straddles an edge, the filter will interpolate new values for pixels on the edge thereby blurring the edge. This may be a problem if sharp edges are required in the output Disk Filter Disk filter (Gonzalez and Woods, 2002) uses a circular averaging filter (pillbox) within the square matrix of side 2*radius+1. The pillbox has circular top and straight sides. For example, if the lens of a camera is not properly focused, each point in the image will be projected to a circular spot on the image sensor. In other words, the pillbox is the point 65
7 spread function of an out-of-focus lens. The Disk filter convolved image will appear blurry and have less defined edges, but will be lower in random noise. These are called smoothing filters, for their action in the time domain, or low-pass filters, for how they treat the frequency domain Median filter The median filter is a nonlinear digital filtering technique, often used to remove noise. Such noise reduction is a typical pre-processing step to improve the results of later processing (for example, edge detection on an image). Median filtering is very widely used in digital image processing because, under certain conditions, it preserves edges while removing noise. Median filter (Eng and Ma, 2001) is a spatial filtering operation, so it uses a 2-D mask that is applied to each pixel in the input image. To apply the mask means to centre it in a pixel, evaluating the covered pixel brightnesses and determining which brightness value is the median value. Figure presents the concept of spatial filtering based on a 3x3 mask, where I is the input image and O is the output image. Figure 3.3: Shows concept of spatial filtering The median value is determined by sorting all the pixel values from the surrounding neighborhood into numerical order and then replacing the pixel being 66
8 considered with the middle pixel value (Chan et al., 2005; Wang and Hang, 1999). If the neighborhood under consideration contains an even number of pixels, the average of the two middle pixel values is used. Figure 3.3 illustrates calculation of median value. Figure 3.4: The median value of a pixel neighborhood As can be seen, the central pixel value of 150 is rather unrepresentative of the surrounding pixels and is replaced with the median value: 124. A 3 3 square neighborhood is used here; however, larger neighborhoods will produce more severe smoothing. By calculating the median value of a neighborhood rather than the mean filter, the median filter has two main advantages over the mean filter: The median is more robust than the mean and so a single very unrepresentative pixel in a neighborhood will not affect the median value significantly. Since the median value must actually be the value of one of the pixels in the neighborhood, the median filter does not create new unrealistic pixel values, when the filter straddles an edge. For this reason, the median filter is much better at preserving sharp edges than the mean filter. The main problem of the median filter is its high computational cost (for sorting N pixels, the temporal complexity is O (N log N), even with the most efficient sorting algorithms).in General, the median filter allows a great deal of high spatial frequency 67
9 detail to pass while remaining very effective at removing noise on images where less than half of the pixels in a smoothing neighborhood have been effected. (As a consequence of this, median filtering can be less effective at removing noise from images corrupted with Gaussian noise). Unlike the mean filter, the median filter is non-linear. This means that for two images A (x) and B (x), we have Median A (x) +B (x) Median A (x) + Median (x) (3.10) Gaussian Filter The Gaussian Filter (Krystek, 1996; Vanherck, 1994) is a 2-D convolution operator that is used to `blur' images and remove detail and noise. In this sense, it is similar to the mean filter, but it uses a different kernel that represents the shape of a Gaussian (`bell-shaped') hump. This kernel has some special properties as explained below. The Gaussian distribution in 1-D has the form: G x 2 x e (3.11) 2 where is the standard deviation of the distribution. We have also assumed that the distribution has a mean of zero (i.e. it is centered on the line x=0). The distribution is illustrated in Figure 3.5. Figure 3.5: 1-D Gaussian distribution with mean 0 and =1 68
10 In 2-D, an isotropic (i.e. circularly symmetric) Gaussian has the form: G x 2 2 x y 1 2 2, y e 2 (3.12) 2 This distribution is shown in Figure 3.6. Figure 3.6: 2-D Gaussian distribution with mean (0, 0) and =1 The idea of Gaussian smoothing is to use this 2-D distribution as a `point-spread' function, and this is achieved by convolution. Since the image is stored as a collection of discrete pixels we need to produce a discrete approximation to the Gaussian function before we can perform the convolution. In theory, the Gaussian distribution is non-zero everywhere, which would require an infinitely large convolution kernel, but in practice it is effectively zero more than about three standard deviations from the mean, and so we can truncate the kernel at this point. Figure 3.7 shows a suitable integer-valued convolution kernel that approximates a Gaussian filter with a = 1.0. Figure 3.7: Discrete approximation to Gaussian function with =1.0 69
11 Once a suitable kernel has been calculated, then the Gaussian smoothing can be performed using standard convolution methods. The convolution can in fact be performed fairly quickly since the equation for the 2-D isotropic Gaussian shown above is separable into x and y components. Thus the 2-D convolution can be performed by first convolving with a 1-D Gaussian in the x direction, and then convolving with another 1-D Gaussian in the y direction. (The Gaussian is in fact the only completely circularly symmetric operator which can be decomposed in such a way.) Figure 3.8 shows the 1-D x component kernel that would be used to produce the full kernel shown in Figure 3.7 (after scaling by 273, rounding and truncating one row of pixels around the boundary because they mostly have the value 0. This reduces the 7x7 matrix to the 5x5 shown above.). The y component is exactly the same but is oriented vertically. Figure 3.8: one of the pair of 1-D convolution kernels used to calculate the full kernel more quickly A further way to compute a Gaussian smoothing with a large standard deviation is to convolve an image several times with a smaller Gaussian. While this is computationally complex, it can have applicability if the processing is carried out using a hardware pipeline. The Gaussian filter not only has utility in engineering applications. It is also attracting attention from computational biologists because it has been attributed with some amount of biological plausibility, e.g. some cells in the visual pathways of the brain often have an approximately Gaussian response. 70
12 3.2.4 The Laplace Operator The Laplacian operator (Taubin, 1995; Zhang, 2003) is a 2-D isotropic measure of the 2nd spatial derivative of an image. It is particularly good at finding the fine detail in an image. Any feature with a sharp discontinuity (like noise) will be enhanced by a Laplacian operator. Thus, one application of a Laplacian operator is to restore fine detail to an image which has been smoothed to remove noise. The Laplacian L(x, y) of an image with pixel intensity values I(x, y) is given by: L 2 2 I I (3.13) x y x, y 2 2 The Laplacian operator is implemented as a convolution between an image and a kernel. The Laplacian kernel can be constructed in various ways but is generally used as a 3-by-3 kernel and shown in the figure below Figure 3.9: Laplacian 3x3 kernel In image convolution, the kernel is centered on each pixel in turn, and the pixel value is replaced by the sum of the kernel mutipled by the image values. In the particular kernel we are using here, we are counting the contributions of the diagonal pixels as well as the orthogonal pixels in the filter operation Laplacian of Gaussian Laplacian filters are derivative filters used to find areas of rapid change (edges) in images. Since derivative filters are very sensitive to noise, it is common to smooth the 71
13 mage (e.g., using a Gaussian filter) before applying the Laplacian. This two-step process is called the Laplacian of Gaussian (LoG) operation f ( x, y) f ( x, y) f ( x, y) 2 2 L( x, y) (3.14) x y There are different ways to find an approximate discrete convolution kernal that approximates the effect of the Laplacian. A possible kernel is Figure 3.10: Commonly used discrete approximations to the Laplacian filter. This is called a negative Laplacian because the central peak is negative. We have defined the Laplacian using a negative peak because this is more common; however, it is equally valid to use the opposite sign convention. To include a smoothing Gaussian filter, combine the Laplacian and Gaussian functions to obtain a single equation: x y x y LOG( x, y) (1 )exp( ) (3.15) and is shown in Figure 3.11 Figure 3.11: The 2-D Laplacian of Gaussian (LoG) function. The x and y axes are marked in standard deviations ( ). 72
14 A discrete kernel for the case of σ = 1.4 is given by Figure 3.12: Discrete approximation to LoG function with Gaussian = 1.4 The LoG operator takes the second derivative of the image. Where the image is basically uniform, the LoG will give zero. Wherever a change occurs, the LoG will give a positive response on the darker side and a negative response on the lighter side. At a sharp edge between two regions, the response will be zero at a long distance from the edge, positive just to one side of the edge, negative just to the other side of the edge, zero at some point in between, on the edge itself. Figure 3.13 illustrates the response of the LoG to a step edge. Figure 3.13: Response of 1-D LoG filter to a step edge. 73
15 The left hand graph shows a 1-D image, 200 pixels long, containing a step edge. The right hand graph shows the response of a 1-D LoG filter with Gaussian = 3 pixels Wiener Filter Wiener (1949) proposed the concept of Wiener filtering. There are two methods: (i) Fourier-transform based method (frequency-domain) and (ii) mean-squared based method (spatial-domain) for implementing Wiener filter. The former method is used only for complete restoration (denoising and deblurring) whereas the latter is used for denoising. In Fourier transform based method of Wiener filtering, normally a priori knowledge of the power spectra of noise and the original image is required. But in mean-squared method, no such a priori knowledge is required. Hence, it is easier to use the mean-squared method for image denoising. Wiener filter is based on the leastsquared principle, i.e. the filter minimizing the mean-squared error (MSE) between the actual output and the desired output (Shui, 2005). Image statistics vary too much from a region to another even within the same image. Thus, both global statistics (mean variance etc. of the whole image) and local statistics (mean, variance etc. of a small region or sub-image) are important. Wiener filtering is based on both the global statistics and local statistics and is given by: f 2 2 f x y g gx, y g, 2 f n (3.16) where, g is the local mean, 2 f is the local signal variance, 2 n is the noise variance and f x, y denotes the restored image. For (2a+1) (2b+1) window of noisy image g(x, y), the local mean g 2 and local Variance g are defined by: 74
16 a b 1 g gs, t L sa tb (3.17) where, L, is the total number of pixels in a window, i.e. L = (2a+1) (2b+1); and 2 a b 2 1 g gs, t g (3.18) L 1 s a tb The local signal variance 2 f used in (3.16) is calculated from 2 g with a priori knowledge of noise variance, 2 n simply by subtracting 2 2 n from g with the assumption that the signal and noise are not correlated with each other. From (3.16) it may be observed that the filter-output is equal to local mean, if the current pixel value equals local mean. Otherwise, it outputs a different value; the value being some what different from local mean. If the input current value is more (less) than the local mean, then the filter outputs a positive (negative) differential amount taking the noise variance and the signal variance into consideration. Thus, the filter output varies from the local mean depending upon the local variance and hence tries to catch the true original value as far as possible. In statistical theory, Wiener filtering is a great land mark. It estimates the original data with minimum mean-squared error and hence, the overall noise power in the filtered output is minimal. Thus, it is accepted as a benchmark in 1-D and 2-D signal processing Unsharp Filter Unsharp filterering technique is used commonly in the printing industry for crispening the edges. A signal proportional to the unsharp or low-pass filtered, version 75
17 of the image is subtracted from the image. This is equivalent to adding the gradient, or a high-pass signal, to the image. Steps for Unsharp Filtering are: Blur the image Subtract the blurred version from the original (this is called the mask) g mask ( x, y) f ( x, y) f ( x, y) (3.19) Where f ( x, y) an original is image and ( x, y) f is the blurred image Add the mask to the original g( x, y) f ( x, y) k. g ( x, y) mask where k is a weight. We can better understand the operation of the unsharp sharpening filter by examining its frequency response characteristics. If we have a signal as shown in Figure 3.14(a), subtracting away the lowpass component of that signal (as in Figure 3.14(b)), yields the highpass, or `edge', representation shown in Figure 3.14(c). Figure 3.14: Calculating an edge image for unsharp filtering This edge image can be used for sharpening if we add it back into the original signal, as shown in Figure
18 Figure 3.15: Sharpening the original signal by adding the edge image The unsharp filter is implemented as a window-based operator, i.e. it relies on a convolution kernel to perform spatial filtering. It can be implemented using an appropriately defined lowpass filter to produce the smoothed version of an image, which is then pixel subtracted from the original image in order to produce a description of image edges, i.e. a highpassed image Lee Filter The Lee filter (Lee, 1980) developed by Jong-Sen Lee is an adaptive filter which changes its characteristics according to the local statistics in the neighborhood of the current pixel. Lee filters utilize the statistical distribution of the DN values within the moving kernel to estimate the value of the pixel of interest. The filter assumes a Gaussian distribution for the noise in the image data. The Lee filter is based on the assumption that the mean and variance of the pixel of interest is equal to the local mean and variance of all pixels within the user-selected moving kernel. The Lee filter is able to smooth away noise in flat regions, but leaves the fine details (such as lines and textures) unchanged. It uses small window (3 3, 5 5, 7 7).The formula used for the Lee filter is: DN out Mean KDN Mean (3.20) in Where Mean=Average of pixels in a moving window 77
19 Var ( x) K= 2 2 Mean Var ( x ) (3.21) and Variance within window Mean within window 2 Sigma 1 2 Var ( x) Mean within window 2 (3.22) The distinct characteristic of the filter is that in the areas of low signal activity (flat regions) the estimated pixel approaches the local mean, whereas in the areas of high signal activity (edge areas) the estimated pixel favours the corrupted image pixel, thus retaining the edge information. It is generally claimed that human vision is more sensitive to noise in a flat area than in an edge area. The major drawback of the filter is that it leaves noise in the vicinity of edges and lines. However, it is still desirable to reduce noise in the edge area without sacrificing the edge sharpness. Some variants of Lee filter available in the literature handle multiplicative noise and yield edge sharpening Frost Filter The Frost filter (Frost et al., 1982) is an adaptive and exponentially-weighted averaging filter based on the coefficient of variation which is the ratio of the local standard deviation to the local mean of the degraded image. The Frost filter replaces the pixel of interest with a weighted sum of the values within the nxn moving kernel. The weighting factors decrease with distance from the pixel of interest. The weighting factors increase for the central pixels as variance within the kernel increases. This filter assumes multiplicative noise and stationary noise statistics and follows the following formula: 78
20 DN k e nxn t (3.23) Where 4 2 n 2 2 I K= normalization constant I = local mean σ = Local variance = image coefficient of variation value t X X Y 0 Y 0, and n= moving kernel size 3.3 Estimation of Statistical Parameters Over the past few years, various filters have been proposed based on numerous purposes. Consequently, criteria quantifying the performances of the filters are desired. Two general classes of criteria are used as the basis for such evaluations (Gonzalez and Woods, 2002; Wang et al., 2002): (a) Objective fidelity criteria A simple and convenient mechanism for quantitating the differences between two images by letting functions represents images (b) Subjective fidelity criteria Human observers evaluate different images and averaging their evaluations. 79
21 The parameters which are used in the filter performance evaluation are Mean Square Error (MSE) (Girod,1993), Peak Signal to Noise Ratio (PSNR) (Eskicioglu and Fisher, 1995), Correlation Coefficient (COC) (Rodgers and Nicewander, 1995), and Mean Structural Similarity Index Measure (MSSIM) (Eskicioglu and Fisher, 1995), UQI (Universal Quality Index (Wang and Bovik, 2002). These are already explained in chapter I. 3.4 Simulation Results All the filters like Mean, Circular Mean, Median, Gaussian, Laplacian, Laplacian of Gaussian, Wiener, Unsharp, Lee and Frost filters are simulated on MATLAB 7.0 platform. The experiments are performed on 40 gray scale images (taken from the database of images Berkeley Segmentation Dataset, Matlab test images and this database brings a set of 200 images of natural scenes and their ground truth produced manually) and results on a few images (natural gray scale images; Lena and Cameraman, and two synthetic sharp edge images; Test_corners image and Test_pattern) shown in figure 3.16 below (Table 3.1 to 3.32) have been presented. To analyse the performance of various filters in the noisy environment, first the image is corrupted with Gaussian noise of variance =.05, 0.1, 0.25 and 0.5 and salt and pepper noise of density=.05, 0.1, 0.25 and 0.5. The Mean Square Error (MSE), Peak-Signal-to- Noise Ratio (PSNR), Correlation Coefficient (COC), Mean Structural Similarity Index Measure (SSIM) and Universal Quality Index (UQI) are taken as performance measures. Results of performance evaluation of various filters have been shown qualitatively as well as quantitatively. The figure 3.16 shows a few test images used in study. 80
22 Test Corners Test Pattern Lena Cameraman Figure 3.16: Shows a few test images used for simulation along with their names 81
23 3.4.1 Visual Results of Various Filters on Images Corrupted With Salt and Pepper Noise Test_corners Image Results I. Filtering performance of various filters operated on Test_corners image corrupted with salt and pepper noise of density=0.05 Figure 3.17: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) II. Filtering performance of various filters operated on Test_corners image corrupted with salt and pepper noise of density=0.1 Figure 3.18: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 82
24 III. Filtering performance of various filters operated on Test_corners image corrupted with salt and pepper noise of density=0.25 Figure 3.19: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) IV. Filtering performance of various filters operated on Test_corners image corrupted with salt and pepper noise of density=0.5 Figure 3.20: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 83
25 Test_pattern Image Results I. Filtering performance of various filters operated on Test_pattern image corrupted with salt and pepper noise of density=0.05 Figure 3.21: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) II. Filtering performance of various filters operated on Test_pattern image corrupted with salt and pepper noise of density=0.1 Figure 3.22: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 84
26 III. Filtering performance of various filters operated on Test_pattern image corrupted with salt and pepper noise of density=0.25 Figure 3.23: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) IV. Filtering performance of various filters operated on Test_pattern image corrupted with salt and pepper noise of density=0.5 Figure 3.24: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 85
27 Lena Image Results I. Filtering performance of various filters operated on Lena image corrupted with salt and pepper noise of density=0.05 Figure 3.25: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) II. Filtering performance of various filters operated on Lena image corrupted with salt and pepper noise of density=0.1 Figure 3.26: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 86
28 III. Filtering performance of various filters operated on Lena image corrupted with salt and pepper noise of density=0.25 Figure 3.27: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) IV. Filtering performance of various filters operated on Lena image corrupted with salt and pepper noise of density=0.5 Figure 3.28: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 87
29 Cameraman Image Results I. Filtering performance of various filters operated on Cameraman Image corrupted with salt and pepper noise of density=0.05 Figure 3.29: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) II. Filtering performance of various filters operated on Cameraman image corrupted with salt and pepper noise of density=0.1 Figure 3.30: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 88
30 III. Filtering performance of various filters operated on Cameraman image corrupted with salt and pepper noise of density=0.25 Figure 3.31: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) IV. Filtering performance of various filters operated on Cameraman image corrupted with salt and pepper noise of density=0.5 Figure 3.32: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 89
31 3.4.2 Visual Results of Different Filters on Images Corrupted with Gaussian noise Test_corners Image Results I. Filtering performance of various filters operated on Test_corners image corrupted with Gaussian noise of variance =0.05 Figure 3.33: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) II. Filtering performance of various filters operated on Test_corners image corrupted with Gaussian noise of variance =0.1 Figure 3.34: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 90
32 III. Filtering performance of various filters operated on Test_corners image corrupted Gaussian noise of variance =0.25 Figure 3.35: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) IV. Filtering performance of various filters operated on Test_corners image corrupted with Gaussian noise of variance =0.5 Figure 3.36: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 91
33 Test_pattern Image Results I. Filtering performance of various filters operated on Test_pattern image corrupted with Gaussian noise of variance =0.05 Figure 3.37: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) II. Filtering performance of various filters operated on Test_pattern image corrupted with Gaussian noise of variance =0.1 Figure 3.38: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 92
34 III. Filtering performance of various filters operated on Test_pattern image corrupted with Gaussian noise of variance =0.25 Figure 3.39: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) IV. Filtering performance of various filters operated on Test_pattern image corrupted with Gaussian noise of variance =0.5 Figure 3.40: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 93
35 Lena Image Results I. Filtering performance of various filters operated on Lena image corrupted with Gaussian noise of variance =0.05 Figure 3.41: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) II. Filtering performance of various filters operated on Lena image corrupted with Gaussian noise of variance =0.1 Figure 3.42: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 94
36 III. Filtering performance of various filters operated on Lena image corrupted with Gaussian noise of variance =0.25 Figure 3.43: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) IV. Filtering performance of various filters operated on Lena image corrupted with Gaussian noise of variance =0.5 Figure 3.44: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 95
37 Cameraman Image Results I. Filtering performance of various filters operated on Cameraman Image corrupted with Gaussian noise of variance=0.05 Figure 3.45: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) II. Filtering performance of various filters operated on Cameraman image corrupted with Gaussian noise of variance=0.1 Figure 3.46: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 96
38 III. Filtering performance of various filters operated on Cameraman image corrupted with Gaussian noise of variance=0.25 Figure 3.47: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) IV. Filtering performance of various filters operated on Cameraman image corrupted with Gaussian noise of variance=0.5 Figure 3.48: (a) Original Image (b) Noisy image (c) Mean (d) Disk (e) Gaussian (f) 97
39 3.4.3 Quantitative Results of Different Filters on Images Corrupted With Gaussian Noise Cameraman Image Results Table 3.1: Results of different quantitative parameters for Cameraman image with Gaussian noise of variance=0.05 Average Disk Gaussian Laplacian e LoG e Unsharp e Median Wiener Lee Frost Table 3.2: Results of different quantitative parameters for Cameraman image with Gaussian noise of variance=0.1 Average Disk e Gaussian Laplacian e LoG e Unsharp e Median Wiener Lee Frost Table 3.3: Results of different quantitative parameters for Cameraman image with Gaussian noise of variance=0.25 Average e Disk e Gaussian e Laplacian e LoG e Unsharp e Median e Wiener e Lee e Frost e
40 Table 3.4: Results of different quantitative parameters for Cameraman image with Gaussian noise of variance=0.5 Average e Disk e Gaussian e Laplacian e LoG e Unsharp e Median e Wiener e Lee e Frost e Lena Image Results Table 3.5: Results of different quantitative parameters for Lena with Gaussian noise of variance=0.05 Average Disk Gaussian Laplacian e LoG e Unsharp e Median Wiener Lee Frost Table 3.6: Results of different quantitative parameters for Lena with Gaussian noise of variance=0.1 Average Disk Gaussian Laplacian e LoG e Unsharp e Median Wiener Lee Frost
41 Table 3.7: Results of different quantitative parameters for Lena with Gaussian noise of variance=0.25 Average e Disk e Gaussian e Laplacian e LoG e Unsharp e Median e Wiener e Lee e Frost e Table 3.8: Results of different quantitative parameters for Lena with Gaussian noise of variance=0.5 Average e Disk e Gaussian e Laplacian e LoG e Unsharp e Median e Wiener e Lee e Frost e Test_pattern Image Results Table 3.9: Results of different quantitative parameters for Test_pattern image with Gaussian noise of variance=0.05 Average e Disk e Gaussian Laplacian e LoG e Unsharp e Median e Wiener Lee e Frost e
42 Table 3.10: Results of different quantitative parameters for Test_pattern image with Gaussian noise of variance=0.1 Average e Disk e Gaussian Laplacian e LoG e Unsharp e Median e Wiener Lee e Frost e Table 3.11: Results of different quantitative parameters for Test_pattern image with Gaussian noise of variance=0.25 Average e Disk e Gaussian e Laplacian e LoG e Unsharp e Median e Wiener e Lee e Frost e Table 3.12: Results of different quantitative parameters for Test_pattern image with Gaussian noise of variance=0.5 Average e Disk e Gaussian e Laplacian e LoG e Unsharp e Median e Wiener e Lee e Frost e
43 Test_corners Image Results Table 3.13: Results of different quantitative parameters for Test_corners Image with Gaussian noise of variance=0.05 Average Disk e Gaussian Laplacian e LoG e Unsharp e Median Wiener Lee Frost Table 3.14: Results of different quantitative parameters for Test_corners Image with Gaussian noise of variance=0.1 Average Disk e Gaussian Laplacian e LoG e Unsharp e Median Wiener Lee e Frost Table 3.15: Results of different quantitative parameters for Test_corners Image with Gaussian noise of variance=0.25 Average e Disk e Gaussian e Laplacian e LoG e Unsharp e Median e Wiener e Lee e Frost e
44 Table 3.16: Results of different quantitative parameters for Test_corners Image with Gaussian noise of variance=0.5 Average e Disk e Gaussian e Laplacian e LoG e Unsharp e Median e Wiener e Lee e Frost e
45 3.4.4 Quantitative Results of Different Filters on Images Corrupted with Salt and Pepper Noise Cameraman Image Results Table 3.17: Results of different quantitative parameters for Cameraman Image with salt and pepper noise density=0.05 Average Disk Gaussian Laplacian e LoG e Unsharp e Median Wiener Lee Frost Table 3.18: Results of different quantitative parameters for Cameraman Image with salt and pepper noise density=0.1 Average Disk Gaussian Laplacian e LoG e Unsharp e Median Wiener Lee Frost Table 3.19: Results of different quantitative parameters for Cameraman Image with salt and pepper noise density=0.25 Average e Disk Gaussian e Laplacian e LoG e Unsharp e Median Wiener e Lee e Frost e
46 Table 3.20: Results of different quantitative parameters for Cameraman Image with salt and pepper noise density=0.5 Average e Disk e Gaussian e Laplacian e LoG e Unsharp e Median e Wiener e Lee e Frost e Lena Image Results Table 3.21: Results of different quantitative parameters for Lena image with salt and pepper noise density=0.05 Average Disk Gaussian Laplacian e LoG e Unsharp e Median Wiener Lee Frost Table 3.22: Results of different quantitative parameters for Lena image with salt and pepper noise density=0.1 Average Disk Gaussian Laplacian e LoG e Unsharp e Median Wiener Lee Frost
47 Table 3.23: Results of different quantitative parameters for Lena image with salt and pepper noise density=0.25 Average Disk Gaussian e Laplacian e LoG e Unsharp e Median Wiener e Lee Frost e Table 3.24: Results of different quantitative parameters for Lena image with salt and pepper noise density=0.5 Average e Disk Gaussian e Laplacian e LoG e Unsharp e Median e Wiener e Lee e Frost e Test_pattern Image Results Table 3.25: Results of different quantitative parameters for Test_pattern with salt and pepper noise density=0.05 Average e Disk e Gaussian Laplacian e LoG e Unsharp e Median Wiener Lee e Frost e
48 Table 3.26: Results of different quantitative parameters for Test_pattern with salt and pepper noise density=0.1 Average e Disk e Gaussian e Laplacian e LoG e Unsharp e Median Wiener e Lee e Frost e Table 3.27: Results of different quantitative parameters for Test_pattern with salt and pepper noise density=0.25 Average e Disk e Gaussian e Laplacian e LoG e Unsharp e Median e Wiener e Lee e Frost e Table 3.28: Results of different quantitative parameters for Test_pattern with salt and pepper noise density=0.5 Average e Disk e Gaussian e Laplacian e LoG e Unsharp e Median e Wiener e Lee e Frost e
Image Filtering. Median Filtering
Image Filtering Image filtering is used to: Remove noise Sharpen contrast Highlight contours Detect edges Other uses? Image filters can be classified as linear or nonlinear. Linear filters are also know
More informationCoE4TN4 Image Processing. Chapter 3: Intensity Transformation and Spatial Filtering
CoE4TN4 Image Processing Chapter 3: Intensity Transformation and Spatial Filtering Image Enhancement Enhancement techniques: to process an image so that the result is more suitable than the original image
More informationDigital Image Processing
Digital Image Processing Part 2: Image Enhancement Digital Image Processing Course Introduction in the Spatial Domain Lecture AASS Learning Systems Lab, Teknik Room T26 achim.lilienthal@tech.oru.se Course
More informationOn the evaluation of edge preserving smoothing filter
On the evaluation of edge preserving smoothing filter Shawn Chen and Tian-Yuan Shih Department of Civil Engineering National Chiao-Tung University Hsin-Chu, Taiwan ABSTRACT For mapping or object identification,
More informationImage analysis. CS/CME/BIOPHYS/BMI 279 Fall 2015 Ron Dror
Image analysis CS/CME/BIOPHYS/BMI 279 Fall 2015 Ron Dror A two- dimensional image can be described as a function of two variables f(x,y). For a grayscale image, the value of f(x,y) specifies the brightness
More informationImage Denoising using Filters with Varying Window Sizes: A Study
e-issn 2455 1392 Volume 2 Issue 7, July 2016 pp. 48 53 Scientific Journal Impact Factor : 3.468 http://www.ijcter.com Image Denoising using Filters with Varying Window Sizes: A Study R. Vijaya Kumar Reddy
More informationImage Enhancement. DD2423 Image Analysis and Computer Vision. Computational Vision and Active Perception School of Computer Science and Communication
Image Enhancement DD2423 Image Analysis and Computer Vision Mårten Björkman Computational Vision and Active Perception School of Computer Science and Communication November 15, 2013 Mårten Björkman (CVAP)
More informationFiltering in the spatial domain (Spatial Filtering)
Filtering in the spatial domain (Spatial Filtering) refers to image operators that change the gray value at any pixel (x,y) depending on the pixel values in a square neighborhood centered at (x,y) using
More informationA Spatial Mean and Median Filter For Noise Removal in Digital Images
A Spatial Mean and Median Filter For Noise Removal in Digital Images N.Rajesh Kumar 1, J.Uday Kumar 2 Associate Professor, Dept. of ECE, Jaya Prakash Narayan College of Engineering, Mahabubnagar, Telangana,
More informationCS534 Introduction to Computer Vision. Linear Filters. Ahmed Elgammal Dept. of Computer Science Rutgers University
CS534 Introduction to Computer Vision Linear Filters Ahmed Elgammal Dept. of Computer Science Rutgers University Outlines What are Filters Linear Filters Convolution operation Properties of Linear Filters
More informationImage Processing for feature extraction
Image Processing for feature extraction 1 Outline Rationale for image pre-processing Gray-scale transformations Geometric transformations Local preprocessing Reading: Sonka et al 5.1, 5.2, 5.3 2 Image
More informationRemoval of High Density Salt and Pepper Noise through Modified Decision based Un Symmetric Trimmed Median Filter
Removal of High Density Salt and Pepper Noise through Modified Decision based Un Symmetric Trimmed Median Filter K. Santhosh Kumar 1, M. Gopi 2 1 M. Tech Student CVSR College of Engineering, Hyderabad,
More informationProf. Feng Liu. Winter /10/2019
Prof. Feng Liu Winter 29 http://www.cs.pdx.edu/~fliu/courses/cs4/ //29 Last Time Course overview Admin. Info Computer Vision Computer Vision at PSU Image representation Color 2 Today Filter 3 Today Filters
More information10. Noise modeling and digital image filtering
Image Processing - Laboratory 0: Noise modeling and digital image filtering 0. Noise modeling and digital image filtering 0.. Introduction Noise represents unwanted information which deteriorates image
More informationAn Efficient Noise Removing Technique Using Mdbut Filter in Images
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 10, Issue 3, Ver. II (May - Jun.2015), PP 49-56 www.iosrjournals.org An Efficient Noise
More informationKeywords Fuzzy Logic, ANN, Histogram Equalization, Spatial Averaging, High Boost filtering, MSE, RMSE, SNR, PSNR.
Volume 4, Issue 1, January 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com An Image Enhancement
More information1.Discuss the frequency domain techniques of image enhancement in detail.
1.Discuss the frequency domain techniques of image enhancement in detail. Enhancement In Frequency Domain: The frequency domain methods of image enhancement are based on convolution theorem. This is represented
More informationImage Enhancement in spatial domain. Digital Image Processing GW Chapter 3 from Section (pag 110) Part 2: Filtering in spatial domain
Image Enhancement in spatial domain Digital Image Processing GW Chapter 3 from Section 3.4.1 (pag 110) Part 2: Filtering in spatial domain Mask mode radiography Image subtraction in medical imaging 2 Range
More informationPractical Image and Video Processing Using MATLAB
Practical Image and Video Processing Using MATLAB Chapter 10 Neighborhood processing What will we learn? What is neighborhood processing and how does it differ from point processing? What is convolution
More informationDigital Image Processing
Digital Image Processing Part : Image Enhancement in the Spatial Domain AASS Learning Systems Lab, Dep. Teknik Room T9 (Fr, - o'clock) achim.lilienthal@oru.se Course Book Chapter 3-4- Contents. Image Enhancement
More informationFrequency Domain Enhancement
Tutorial Report Frequency Domain Enhancement Page 1 of 21 Frequency Domain Enhancement ESE 558 - DIGITAL IMAGE PROCESSING Tutorial Report Instructor: Murali Subbarao Written by: Tutorial Report Frequency
More informationIMAGE ENHANCEMENT IN SPATIAL DOMAIN
A First Course in Machine Vision IMAGE ENHANCEMENT IN SPATIAL DOMAIN By: Ehsan Khoramshahi Definitions The principal objective of enhancement is to process an image so that the result is more suitable
More informationMotivation: Image denoising. How can we reduce noise in a photograph?
Linear filtering Motivation: Image denoising How can we reduce noise in a photograph? Moving average Let s replace each pixel with a weighted average of its neighborhood The weights are called the filter
More informationImage Denoising Using Statistical and Non Statistical Method
Image Denoising Using Statistical and Non Statistical Method Ms. Shefali A. Uplenchwar 1, Mrs. P. J. Suryawanshi 2, Ms. S. G. Mungale 3 1MTech, Dept. of Electronics Engineering, PCE, Maharashtra, India
More informationFiltering Images in the Spatial Domain Chapter 3b G&W. Ross Whitaker (modified by Guido Gerig) School of Computing University of Utah
Filtering Images in the Spatial Domain Chapter 3b G&W Ross Whitaker (modified by Guido Gerig) School of Computing University of Utah 1 Overview Correlation and convolution Linear filtering Smoothing, kernels,
More informationMidterm Examination CS 534: Computational Photography
Midterm Examination CS 534: Computational Photography November 3, 2015 NAME: SOLUTIONS Problem Score Max Score 1 8 2 8 3 9 4 4 5 3 6 4 7 6 8 13 9 7 10 4 11 7 12 10 13 9 14 8 Total 100 1 1. [8] What are
More informationAchim J. Lilienthal Mobile Robotics and Olfaction Lab, AASS, Örebro University
Achim J. Lilienthal Mobile Robotics and Olfaction Lab, Room T29, Mo, -2 o'clock AASS, Örebro University (please drop me an email in advance) achim.lilienthal@oru.se 4.!!!!!!!!! Pre-Class Reading!!!!!!!!!
More informationProf. Vidya Manian Dept. of Electrical and Comptuer Engineering
Image Processing Intensity Transformations Chapter 3 Prof. Vidya Manian Dept. of Electrical and Comptuer Engineering INEL 5327 ECE, UPRM Intensity Transformations 1 Overview Background Basic intensity
More informationImages and Filters. EE/CSE 576 Linda Shapiro
Images and Filters EE/CSE 576 Linda Shapiro What is an image? 2 3 . We sample the image to get a discrete set of pixels with quantized values. 2. For a gray tone image there is one band F(r,c), with values
More informationPerformance Analysis of Average and Median Filters for De noising Of Digital Images.
Performance Analysis of Average and Median Filters for De noising Of Digital Images. Alamuru Susmitha 1, Ishani Mishra 2, Dr.Sanjay Jain 3 1Sr.Asst.Professor, Dept. of ECE, New Horizon College of Engineering,
More informationImage filtering, image operations. Jana Kosecka
Image filtering, image operations Jana Kosecka - photometric aspects of image formation - gray level images - point-wise operations - linear filtering Image Brightness values I(x,y) Images Images contain
More informationPERFORMANCE ANALYSIS OF LINEAR AND NON LINEAR FILTERS FOR IMAGE DE NOISING
Impact Factor (SJIF): 5.301 International Journal of Advance Research in Engineering, Science & Technology e-issn: 2393-9877, p-issn: 2394-2444 Volume 5, Issue 3, March - 2018 PERFORMANCE ANALYSIS OF LINEAR
More informationIMAGE PROCESSING: AREA OPERATIONS (FILTERING)
IMAGE PROCESSING: AREA OPERATIONS (FILTERING) N. C. State University CSC557 Multimedia Computing and Networking Fall 2001 Lecture # 13 IMAGE PROCESSING: AREA OPERATIONS (FILTERING) N. C. State University
More informationA Novel Approach for MRI Image De-noising and Resolution Enhancement
A Novel Approach for MRI Image De-noising and Resolution Enhancement 1 Pravin P. Shetti, 2 Prof. A. P. Patil 1 PG Student, 2 Assistant Professor Department of Electronics Engineering, Dr. J. J. Magdum
More informationMotivation: Image denoising. How can we reduce noise in a photograph?
Linear filtering Motivation: Image denoising How can we reduce noise in a photograph? Moving average Let s replace each pixel with a weighted average of its neighborhood The weights are called the filter
More informationComputer Vision, Lecture 3
Computer Vision, Lecture 3 Professor Hager http://www.cs.jhu.edu/~hager /4/200 CS 46, Copyright G.D. Hager Outline for Today Image noise Filtering by Convolution Properties of Convolution /4/200 CS 46,
More informationInterpolation of CFA Color Images with Hybrid Image Denoising
2014 Sixth International Conference on Computational Intelligence and Communication Networks Interpolation of CFA Color Images with Hybrid Image Denoising Sasikala S Computer Science and Engineering, Vasireddy
More informationAbsolute Difference Based Progressive Switching Median Filter for Efficient Impulse Noise Removal
Absolute Difference Based Progressive Switching Median Filter for Efficient Impulse Noise Removal Gophika Thanakumar Assistant Professor, Department of Electronics and Communication Engineering Easwari
More informationDesign of Hybrid Filter for Denoising Images Using Fuzzy Network and Edge Detecting
American Journal of Scientific Research ISSN 450-X Issue (009, pp5-4 EuroJournals Publishing, Inc 009 http://wwweurojournalscom/ajsrhtm Design of Hybrid Filter for Denoising Images Using Fuzzy Network
More informationCOMPARITIVE STUDY OF IMAGE DENOISING ALGORITHMS IN MEDICAL AND SATELLITE IMAGES
COMPARITIVE STUDY OF IMAGE DENOISING ALGORITHMS IN MEDICAL AND SATELLITE IMAGES Jyotsana Rastogi, Diksha Mittal, Deepanshu Singh ---------------------------------------------------------------------------------------------------------------------------------
More informationImage analysis. CS/CME/BioE/Biophys/BMI 279 Oct. 31 and Nov. 2, 2017 Ron Dror
Image analysis CS/CME/BioE/Biophys/BMI 279 Oct. 31 and Nov. 2, 2017 Ron Dror 1 Outline Images in molecular and cellular biology Reducing image noise Mean and Gaussian filters Frequency domain interpretation
More informationImage Enhancement using Histogram Equalization and Spatial Filtering
Image Enhancement using Histogram Equalization and Spatial Filtering Fari Muhammad Abubakar 1 1 Department of Electronics Engineering Tianjin University of Technology and Education (TUTE) Tianjin, P.R.
More informationImage analysis. CS/CME/BioE/Biophys/BMI 279 Oct. 31 and Nov. 2, 2017 Ron Dror
Image analysis CS/CME/BioE/Biophys/BMI 279 Oct. 31 and Nov. 2, 2017 Ron Dror 1 Outline Images in molecular and cellular biology Reducing image noise Mean and Gaussian filters Frequency domain interpretation
More informationA Modified Non Linear Median Filter for the Removal of Medium Density Random Valued Impulse Noise
www.ijemr.net ISSN (ONLINE): 50-0758, ISSN (PRINT): 34-66 Volume-6, Issue-3, May-June 016 International Journal of Engineering and Management Research Page Number: 607-61 A Modified Non Linear Median Filter
More informationPerformance Comparison of Mean, Median and Wiener Filter in MRI Image De-noising
Performance Comparison of Mean, Median and Wiener Filter in MRI Image De-noising 1 Pravin P. Shetti, 2 Prof. A. P. Patil 1 PG Student, 2 Assistant Professor Department of Electronics Engineering, Dr. J.
More informationA Fast Median Filter Using Decision Based Switching Filter & DCT Compression
A Fast Median Using Decision Based Switching & DCT Compression Er.Sakshi 1, Er.Navneet Bawa 2 1,2 Punjab Technical University, Amritsar College of Engineering & Technology, Department of Information Technology,
More informationImpulse Noise Removal and Detail-Preservation in Images and Videos Using Improved Non-Linear Filters 1
Impulse Noise Removal and Detail-Preservation in Images and Videos Using Improved Non-Linear Filters 1 Reji Thankachan, 2 Varsha PS Abstract: Though many ramification of Linear Signal Processing are studied
More informationImage De-noising Using Linear and Decision Based Median Filters
2018 IJSRST Volume 4 Issue 2 Print ISSN: 2395-6011 Online ISSN: 2395-602X Themed Section: Science and Technology Image De-noising Using Linear and Decision Based Median Filters P. Sathya*, R. Anandha Jothi,
More informationChrominance Assisted Sharpening of Images
Blekinge Institute of Technology Research Report 2004:08 Chrominance Assisted Sharpening of Images Andreas Nilsson Department of Signal Processing School of Engineering Blekinge Institute of Technology
More informationChapter 6. [6]Preprocessing
Chapter 6 [6]Preprocessing As mentioned in chapter 4, the first stage in the HCR pipeline is preprocessing of the image. We have seen in earlier chapters why this is very important and at the same time
More informationTable of contents. Vision industrielle 2002/2003. Local and semi-local smoothing. Linear noise filtering: example. Convolution: introduction
Table of contents Vision industrielle 2002/2003 Session - Image Processing Département Génie Productique INSA de Lyon Christian Wolf wolf@rfv.insa-lyon.fr Introduction Motivation, human vision, history,
More informationLecture 3: Linear Filters
Signal Denoising Lecture 3: Linear Filters Math 490 Prof. Todd Wittman The Citadel Suppose we have a noisy 1D signal f(x). For example, it could represent a company's stock price over time. In order to
More information8.2 IMAGE PROCESSING VERSUS IMAGE ANALYSIS Image processing: The collection of routines and
8.1 INTRODUCTION In this chapter, we will study and discuss some fundamental techniques for image processing and image analysis, with a few examples of routines developed for certain purposes. 8.2 IMAGE
More informationImage Filtering in Spatial domain. Computer Vision Jia-Bin Huang, Virginia Tech
Image Filtering in Spatial domain Computer Vision Jia-Bin Huang, Virginia Tech Administrative stuffs Lecture schedule changes Office hours - Jia-Bin (44 Whittemore Hall) Friday at : AM 2: PM Office hours
More informationLiterature Survey On Image Filtering Techniques Jesna Varghese M.Tech, CSE Department, Calicut University, India
Literature Survey On Image Filtering Techniques Jesna Varghese M.Tech, CSE Department, Calicut University, India Abstract Filtering is an essential part of any signal processing system. This involves estimation
More informationStochastic Image Denoising using Minimum Mean Squared Error (Wiener) Filtering
Stochastic Image Denoising using Minimum Mean Squared Error (Wiener) Filtering L. Sahawneh, B. Carroll, Electrical and Computer Engineering, ECEN 670 Project, BYU Abstract Digital images and video used
More informationRemoval of High Density Salt and Pepper Noise along with Edge Preservation Technique
Removal of High Density Salt and Pepper Noise along with Edge Preservation Technique Dr.R.Sudhakar 1, U.Jaishankar 2, S.Manuel Maria Bastin 3, L.Amoog 4 1 (HoD, ECE, Dr.Mahalingam College of Engineering
More informationABSTRACT I. INTRODUCTION
2017 IJSRSET Volume 3 Issue 8 Print ISSN: 2395-1990 Online ISSN : 2394-4099 Themed Section : Engineering and Technology Hybridization of DBA-DWT Algorithm for Enhancement and Restoration of Impulse Noise
More informationDIGITAL IMAGE DE-NOISING FILTERS A COMPREHENSIVE STUDY
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 DIGITAL IMAGE DE-NOISING FILTERS A COMPREHENSIVE STUDY Jaskaranjit Kaur 1, Ranjeet Kaur 2 1 M.Tech (CSE) Student,
More informationImage preprocessing in spatial domain
Image preprocessing in spatial domain convolution, convolution theorem, cross-correlation Revision:.3, dated: December 7, 5 Tomáš Svoboda Czech Technical University, Faculty of Electrical Engineering Center
More informationNon Linear Image Enhancement
Non Linear Image Enhancement SAIYAM TAKKAR Jaypee University of information technology, 2013 SIMANDEEP SINGH Jaypee University of information technology, 2013 Abstract An image enhancement algorithm based
More informationPerformance Comparison of Various Filters and Wavelet Transform for Image De-Noising
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 10, Issue 1 (Mar. - Apr. 2013), PP 55-63 Performance Comparison of Various Filters and Wavelet Transform for
More informationC. Efficient Removal Of Impulse Noise In [7], a method used to remove the impulse noise (ERIN) is based on simple fuzzy impulse detection technique.
Removal of Impulse Noise In Image Using Simple Edge Preserving Denoising Technique Omika. B 1, Arivuselvam. B 2, Sudha. S 3 1-3 Department of ECE, Easwari Engineering College Abstract Images are most often
More informationPart I Feature Extraction (1) Image Enhancement. CSc I6716 Spring Local, meaningful, detectable parts of the image.
CSc I6716 Spring 211 Introduction Part I Feature Extraction (1) Zhigang Zhu, City College of New York zhu@cs.ccny.cuny.edu Image Enhancement What are Image Features? Local, meaningful, detectable parts
More informationCS6670: Computer Vision Noah Snavely. Administrivia. Administrivia. Reading. Last time: Convolution. Last time: Cross correlation 9/8/2009
CS667: Computer Vision Noah Snavely Administrivia New room starting Thursday: HLS B Lecture 2: Edge detection and resampling From Sandlot Science Administrivia Assignment (feature detection and matching)
More informationHistorical Document Preservation using Image Processing Technique
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 2, Issue. 4, April 2013,
More informationImage Denoising Using Different Filters (A Comparison of Filters)
International Journal of Emerging Trends in Science and Technology Image Denoising Using Different Filters (A Comparison of Filters) Authors Mr. Avinash Shrivastava 1, Pratibha Bisen 2, Monali Dubey 3,
More informationComparative Analysis of Methods Used to Remove Salt and Pepper Noise
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 232 88X IMPACT FACTOR: 6.17 IJCSMC,
More informationNoise Adaptive and Similarity Based Switching Median Filter for Salt & Pepper Noise
51 Noise Adaptive and Similarity Based Switching Median Filter for Salt & Pepper Noise F. Katircioglu Abstract Works have been conducted recently to remove high intensity salt & pepper noise by virtue
More informationNoise Reduction Technique in Synthetic Aperture Radar Datasets using Adaptive and Laplacian Filters
RESEARCH ARTICLE OPEN ACCESS Noise Reduction Technique in Synthetic Aperture Radar Datasets using Adaptive and Laplacian Filters Sakshi Kukreti*, Amit Joshi*, Sudhir Kumar Chaturvedi* *(Department of Aerospace
More informationDe-Noising Techniques for Bio-Medical Images
De-Noising Techniques for Bio-Medical Images Manoj Kumar Medikonda 1, Dr. B.Jagadeesh 2, Revathi Chalumuri 3 1 (Electronics and Communication Engineering, G. V. P. College of Engineering(A), Visakhapatnam,
More informationLAB MANUAL SUBJECT: IMAGE PROCESSING BE (COMPUTER) SEM VII
LAB MANUAL SUBJECT: IMAGE PROCESSING BE (COMPUTER) SEM VII IMAGE PROCESSING INDEX CLASS: B.E(COMPUTER) SR. NO SEMESTER:VII TITLE OF THE EXPERIMENT. 1 Point processing in spatial domain a. Negation of an
More informationFUZZY BASED MEDIAN FILTER FOR GRAY-SCALE IMAGES
FUZZY BASED MEDIAN FILTER FOR GRAY-SCALE IMAGES Sukomal Mehta 1, Sanjeev Dhull 2 1 Department of Electronics & Comm., GJU University, Hisar, Haryana, sukomal.mehta@gmail.com 2 Assistant Professor, Department
More informationFilip Malmberg 1TD396 fall 2018 Today s lecture
Today s lecture Local neighbourhood processing Convolution smoothing an image sharpening an image And more What is it? What is it useful for? How can I compute it? Removing uncorrelated noise from an image
More informationImage Enhancement for Astronomical Scenes. Jacob Lucas The Boeing Company Brandoch Calef The Boeing Company Keith Knox Air Force Research Laboratory
Image Enhancement for Astronomical Scenes Jacob Lucas The Boeing Company Brandoch Calef The Boeing Company Keith Knox Air Force Research Laboratory ABSTRACT Telescope images of astronomical objects and
More informationRemoval of Gaussian noise on the image edges using the Prewitt operator and threshold function technical
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 15, Issue 2 (Nov. - Dec. 2013), PP 81-85 Removal of Gaussian noise on the image edges using the Prewitt operator
More informationAn Adaptive Kernel-Growing Median Filter for High Noise Images. Jacob Laurel. Birmingham, AL, USA. Birmingham, AL, USA
An Adaptive Kernel-Growing Median Filter for High Noise Images Jacob Laurel Department of Electrical and Computer Engineering, University of Alabama at Birmingham, Birmingham, AL, USA Electrical and Computer
More informationAvailable online at ScienceDirect. Procedia Computer Science 42 (2014 ) 32 37
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 42 (2014 ) 32 37 International Conference on Robot PRIDE 2013-2014 - Medical and Rehabilitation Robotics and Instrumentation,
More informationDirection based Fuzzy filtering for Color Image Denoising
International Research Journal of Engineering and Technology (IRJET) e-issn: 2395-56 Volume: 4 Issue: 5 May -27 www.irjet.net p-issn: 2395-72 Direction based Fuzzy filtering for Color Denoising Nitika*,
More informationImage Denoising with Linear and Non-Linear Filters: A REVIEW
www.ijcsi.org 149 Image Denoising with Linear and Non-Linear Filters: A REVIEW Mrs. Bhumika Gupta 1, Mr. Shailendra Singh Negi 2 1 Assistant professor, G.B.Pant Engineering College Pauri Garhwal, Uttarakhand,
More informationChapter 2 Image Enhancement in the Spatial Domain
Chapter 2 Image Enhancement in the Spatial Domain Abstract Although the transform domain processing is essential, as the images naturally occur in the spatial domain, image enhancement in the spatial domain
More informationDigital Image Processing 3/e
Laboratory Projects for Digital Image Processing 3/e by Gonzalez and Woods 2008 Prentice Hall Upper Saddle River, NJ 07458 USA www.imageprocessingplace.com The following sample laboratory projects are
More informationVLSI Implementation of Impulse Noise Suppression in Images
VLSI Implementation of Impulse Noise Suppression in Images T. Satyanarayana 1, A. Ravi Chandra 2 1 PG Student, VRS & YRN College of Engg. & Tech.(affiliated to JNTUK), Chirala 2 Assistant Professor, Department
More informationI. INTRODUCTION II. EXISTING AND PROPOSED WORK
Impulse Noise Removal Based on Adaptive Threshold Technique L.S.Usharani, Dr.P.Thiruvalarselvan 2 and Dr.G.Jagaothi 3 Research Scholar, Department of ECE, Periyar Maniammai University, Thanavur, Tamil
More informationFPGA IMPLEMENTATION OF RSEPD TECHNIQUE BASED IMPULSE NOISE REMOVAL
M RAJADURAI AND M SANTHI: FPGA IMPLEMENTATION OF RSEPD TECHNIQUE BASED IMPULSE NOISE REMOVAL DOI: 10.21917/ijivp.2013.0088 FPGA IMPLEMENTATION OF RSEPD TECHNIQUE BASED IMPULSE NOISE REMOVAL M. Rajadurai
More informationDigital Image Processing
Thomas.Grenier@creatis.insa-lyon.fr Digital Image Processing Exercises Département Génie Electrique 5GE - TdSi 2.4: You are hired to design the front end of an imaging system for studying the boundary
More informationVision Review: Image Processing. Course web page:
Vision Review: Image Processing Course web page: www.cis.udel.edu/~cer/arv September 7, Announcements Homework and paper presentation guidelines are up on web page Readings for next Tuesday: Chapters 6,.,
More informationFourier Transform. Any signal can be expressed as a linear combination of a bunch of sine gratings of different frequency Amplitude Phase
Fourier Transform Fourier Transform Any signal can be expressed as a linear combination of a bunch of sine gratings of different frequency Amplitude Phase 2 1 3 3 3 1 sin 3 3 1 3 sin 3 1 sin 5 5 1 3 sin
More informationInternational Journal of Computer Engineering and Applications, TYPES OF NOISE IN DIGITAL IMAGE PROCESSING
International Journal of Computer Engineering and Applications, Volume XI, Issue IX, September 17, www.ijcea.com ISSN 2321-3469 TYPES OF NOISE IN DIGITAL IMAGE PROCESSING 1 RANU GORAI, 2 PROF. AMIT BHATTCHARJEE
More informationCS 4501: Introduction to Computer Vision. Filtering and Edge Detection
CS 451: Introduction to Computer Vision Filtering and Edge Detection Connelly Barnes Slides from Jason Lawrence, Fei Fei Li, Juan Carlos Niebles, Misha Kazhdan, Allison Klein, Tom Funkhouser, Adam Finkelstein,
More informationAPJIMTC, Jalandhar, India. Keywords---Median filter, mean filter, adaptive filter, salt & pepper noise, Gaussian noise.
Volume 3, Issue 10, October 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Comparative
More informationBlind Single-Image Super Resolution Reconstruction with Defocus Blur
Sensors & Transducers 2014 by IFSA Publishing, S. L. http://www.sensorsportal.com Blind Single-Image Super Resolution Reconstruction with Defocus Blur Fengqing Qin, Lihong Zhu, Lilan Cao, Wanan Yang Institute
More informationRemoval of Salt and Pepper Noise from Satellite Images
Removal of Salt and Pepper Noise from Satellite Images Mr. Yogesh V. Kolhe 1 Research Scholar, Samrat Ashok Technological Institute Vidisha (INDIA) Dr. Yogendra Kumar Jain 2 Guide & Asso.Professor, Samrat
More informationPreparing Remote Sensing Data for Natural Resources Mapping (image enhancement, rectifications )
Preparing Remote Sensing Data for Natural Resources Mapping (image enhancement, rectifications ) Why is this important What are the major approaches Examples of digital image enhancement Follow up exercises
More informationDecision Based Median Filter Algorithm Using Resource Optimized FPGA to Extract Impulse Noise
Journal of Embedded Systems, 2014, Vol. 2, No. 1, 18-22 Available online at http://pubs.sciepub.com/jes/2/1/4 Science and Education Publishing DOI:10.12691/jes-2-1-4 Decision Based Median Filter Algorithm
More informationImage Enhancement contd. An example of low pass filters is:
Image Enhancement contd. An example of low pass filters is: We saw: unsharp masking is just a method to emphasize high spatial frequencies. We get a similar effect using high pass filters (for instance,
More informationInternational Journal of Pharma and Bio Sciences PERFORMANCE ANALYSIS OF BONE IMAGES USING VARIOUS EDGE DETECTION ALGORITHMS AND DENOISING FILTERS
Research Article Bioinformatics International Journal of Pharma and Bio Sciences ISSN 0975-6299 PERFORMANCE ANALYSIS OF BONE IMAGES USING VARIOUS EDGE DETECTION ALGORITHMS AND DENOISING FILTERS S.P.CHOKKALINGAM*¹,
More informationDetail preserving impulsive noise removal
Signal Processing: Image Communication 19 (24) 993 13 www.elsevier.com/locate/image Detail preserving impulsive noise removal Naif Alajlan a,, Mohamed Kamel a, Ed Jernigan b a PAMI Lab, Electrical and
More informationDigital Image Processing. Digital Image Fundamentals II 12 th June, 2017
Digital Image Processing Digital Image Fundamentals II 12 th June, 2017 Image Enhancement Image Enhancement Types of Image Enhancement Operations Neighborhood Operations on Images Spatial Filtering Filtering
More informationAn Efficient Color Image Segmentation using Edge Detection and Thresholding Methods
19 An Efficient Color Image Segmentation using Edge Detection and Thresholding Methods T.Arunachalam* Post Graduate Student, P.G. Dept. of Computer Science, Govt Arts College, Melur - 625 106 Email-Arunac682@gmail.com
More information