Filter

Filter or filtering image data is a standard process used in almost all image processing
system. Filtering is used to remove noise from original digital image while keeping the
details of image preserved. This filtering technique is divided into categories: Linear
filter and nonlinear filter.

Linear filter:
The noise reduction algorithm is applied for all pixels of the image linearly without
knowing about noisy pixel and non-noisy pixel.
Linear filter are used to certain types of noise and it is basically used for denoising for
salt and pepper noise and Gaussian Noise. These filters also tend to blur the sharp edges
and destroy the lines and other fine details in the images.

Gaussian Filter:
Gaussian filter is a non-uniform low pass filter. Gaussian Filter is smoothing filter used in
the 2D convolution operation that is used to blur the image and remove noise and details.
It is considered a most useful filter but it is not faster filter when compared to other filters
and It does not remove salt & pepper noise effectively.
Gaussian Filter is done by convolution each point in the input array with Gaussian kernel
and then summing them all to produce the output array.
Application: it is used in global system mobile communication (GSM) and used in canny
edge detector image processing.
Advantage:
It reduce noise
It has the minimum possible time delay
Sharp edge are removed
Disadvantage:
Time consuming and reduce image details

MEAN FILTER:
It is simple linear filter. In this each pixel value in an image is replaced with the mean
value of its neighbor including itself. The expression is given as:
Mean filter (x1…..xn) = ─ ∑ xi n i=1
Where (x1 ….. xn) is the image pixel range. Generally linear filters are used for noise
suppression
Example: Gaussian Noise
Advantage:
It is easy to implement.
It is used to remove the impulsive noise
Disadvantage:
It does not preserve details of the image. Some of the details are removed using the mean
filters.

Wiener filter:
Wiener filter was proposed by Norbert wiener in 1940 and published in 1949.
The purpose of the wiener filter is to filter out the noise that has the corrupted the signal.
The filter is based on a statistical approach and the goal of Wiener filter is to reduce the
mean square error as much as possible. The expression is given as:

G(x,y) =H*(x,y)|H(x,y)|2 + Pn(x,y)Ps(x,y)

Where
H(x,y) = Degradation function
H*( x,y) = Complex conjugate of degradation function
Pn (x,y) = Power Spectral Density of Noise
Ps (x,y) = Power Spectral Density of un-degraded image
The term Pn /Ps can be interpreted as the reciprocal of the signal to-noise ratio.

Example: Poisson Noise and speckle Noise

Advantages:
Begins to exploit signal
Control output error
Disadvantage:
Resulted image is often blurred.
Can only handle image processing with additive, unimodal noise

Nonlinear filter:
Nonlinear filters are applied on pixels surrounded by noisy pixels. It can be preserved on
edges and very effective at removing impulsive noise. There are more powerful than
linear filters because they are able to reduce noise levels without blurring image, and it
can be difficult to design.

Min Filter:
 Min filter is also known as 0th percentile filter. It replaces the value of pixel by the
minimum intensity level of the neighborhood of that pixel. This filter finds darkest points
in an image. It removes salt noise from an image containing salt and pepper noise due to
its high intensity value. The min filter can be represented by the following equation

𝑓^(𝑥,𝑦)=𝑚𝑖𝑛{𝑔(𝑠,𝑡)} 𝑤ℎ𝑒𝑟𝑒 (𝑠,𝑡)∈𝑆𝑥𝑦

Max Filter:
Max filter is also known as 100th percentile filter. It replaces the value of pixel by the
maximum intensity level of the neighborhood of that pixel. This filter finds brightest
points in an image. It removes pepper noise from an image containing salt and pepper
noise due to its very low intensity value

𝑓^(𝑥,𝑦)=𝑚𝑎𝑥{𝑔(𝑠,𝑡)} 𝑤ℎ𝑒𝑟𝑒 (𝑠,𝑡)∈𝑆𝑥𝑦

Adaptive Filters:
These filters work accordingly the statistical characteristics of image inside the filter
region defined by the mxn rectangular window. They are more complex and gives better
performance than existing spatial filters

Median Filter:
It is a simple and powerful non linear filter and used reducing the amount of intensity
variation between one pixel and the other pixel. In this filter, we replace pixel value with
the median value.
In this filter the median is calculated by the first sorting the entire pixel values into
ascending order and the replace the pixel being calculated with middle pixel value.
Example: Salt and pepper Noise.
Advantage:
It is easy to implement
Used for de-noising different types of noise.
Disadvantage:
Median filter tends to remove image details when the impulse noise percentage is more
than 0.4%.

Wavelets theory
Image has a smooth region interrupt by edges or appropriate changes in contrast. These
appropriate changes are often the most interesting part of the data both perfectly and in term of
the technology that has been provided.
A wavelet is a rapidly decaying wave like oscillation that has zero mean unlike sinusoidal which
extend to infinity. A wavelet exists to a definite duration.
A wavelet is wave like oscillation with amplitude starting from zero and then increase and
decrease then back to zero. It consist a mathematical tool, which can be used to extract
information from different kinds of data. A wavelet is a mathematical function useful in digital
signal processing and image compression.
A wavelet must satisfy the following two conditions:
• It must be oscillatory.
• Its amplitudes are nonzero only during a short interval.
Wavelet transform is often compared with Fourier transform, in which signals are represented as
a sum of sinusoids. Fourier transform is a powerful tool for data analysis; however it does not
represent appropriate changes effectively. Transform can be viewed as a special case of
continuous wavelet transform. The main difference in general is that wavelets are localized in
both time and frequency whereas the standard Fourier transform is only localized in frequency.

Types of wavelet transform

Continuous wavelet transforms (CWT)
Discrete wavelet transforms (DWT)

Continuous wavelets transform (CWT):

It can use to obtain simultaneous time frequency analysis of signal. It is the convolution
of the input data sequence with a set of functions generated by the root wavelet.
The main advantage is while performing image compression as it provides significant
improvement in the picture quality.

Example: Meyer, Morlet, Mexican Hat

Discrete wavelet transforms (DWT):

Discrete wavelet transform (DWT) is an ideal for denoising and compressing signal and
images. It will help in representing a natural occurring signals and image with fiery
coefficient. This enables a partial representation.

In Discrete wavelet transform (DWT) based image fusion, DWT is first applied to source
image to obtain the wavelet coefficients and then appropriate fusion rule is used.
Finally, for reconstruction of fused image inverse DWT is used
 Date:23/11/2017

NO OBJECTION CERTIFICATE

This is to certify that one of our student Mr.MADDI AKHILESH

studying in 1 semester BCA for the academic year 2017-18, wants to

continue NCC in St.Joseph pu college.

We have No objection for the same