SlideShare a Scribd company logo
1 of 8
Download to read offline
World Academy of Science, Engineering and Technology
International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010

Adaptive Non-linear Filtering Technique for
Image Restoration

International Science Index 44, 2010 waset.org/publications/15180

S. K. Satpathy, S. Panda, K. K. Nagwanshi, S. K. Nayak and C. Ardil

Abstract—Removing noise from the any processed images is
very important. Noise should be removed in such a way that
important information of image should be preserved. A decisionbased nonlinear algorithm for elimination of band lines, drop lines,
mark, band lost and impulses in images is presented in this paper.
The algorithm performs two simultaneous operations, namely,
detection of corrupted pixels and evaluation of new pixels for
replacing the corrupted pixels. Removal of these artifacts is achieved
without damaging edges and details. However, the restricted window
size renders median operation less effective whenever noise is
excessive in that case the proposed algorithm automatically switches
to mean filtering. The performance of the algorithm is analyzed in
terms of Mean Square Error [MSE], Peak-Signal-to-Noise Ratio
[PSNR], Signal-to-Noise Ratio Improved [SNRI], Percentage Of
Noise Attenuated [PONA], and Percentage Of Spoiled Pixels
[POSP]. This is compared with standard algorithms already in use
and improved performance of the proposed algorithm is presented.
The advantage of the proposed algorithm is that a single algorithm
can replace several independent algorithms which are required for
removal of different artifacts.
Keywords—Filtering, Decision Based Algorithm, noise, image
restoration.

T

I. INTRODUCTION

HE idea of image restoration is to balance for or unwrap
defects which corrupts an image. Degradation comes in
many forms such as motion blur, noise, and camera misfocus.
In cases like motion blur, it is possible to come up with a very
good estimate of the actual blurring function and undo the blur
to restore the original image. In cases where the image is
corrupted by noise, the best we may hope is to compensate for
the degradation it caused. In this paper, it will introduce and
implement several of the methods used in the image
processing world to restore images. There are two different
domains under which one can go for image restoration: (i)

S.K. Satpathy is with the Department of Computer Science & Engineering,
Rungta College of Engineering & Technology, Bhilai CG 490023 India
(Phone: 922-935-5518; fax: 788-228-6480; e-mail: sks_sarita@yahoo.com).
S. Panda is with the National Institute of Science and Technology (NIST)
Berhampur, OR 760007 India (e-mail: panda_siddhartha@rediffmail.com).
K.K. Nagwanshi is with the Department of Computer Science &
Engineering, Rungta College of Engineering & Technology, Bhilai CG
490023 India (e-mail: kapilkn@gmail.com).
S.K. Nayak is with Department of ECE, Aditya Institute of Technology,
Tekkali, Srikakulam Dt. AP. 532201(e-mail:sknayakbu@rediffmail.com)
C. Ardil is with National Academy of Aviation, AZ1045, Baku,
Azerbaijan, Bina, 25th km, NAA (e-mail: cemalardil@gmail.com)

Spatial Domain and (ii) Frequency Domain. This paper is fully
concentrated on frequency domain method. It will discuss
some existing methods along with proposed approach. It is
well known that linear filters are not quite effective in the
presence of non-Gaussian noise. In the last decade, it has been
shown that nonlinear digital filters can overcome some of the
limitations of linear digital filters [1]. Median filters are a class
of nonlinear filters and have produced good results where
linear filters generally fail [2]. Median filters are known to
remove impulse noise and preserve edges. There are a wide
variety of median filters in the literature. In remote sensing,
artifacts such as strip lines, drop lines, blotches, band missing
occur along with impulse noise. Standard median filters
reported in the literature do not address these artifacts. Strip
lines are caused by unequal responses of elements of a
detector array to the same amount of incoming
electromagnetic energy [3]. This phenomenon causes
heterogeneity in overall brightness of adjacent lines. Drop line
[3] occurs when a detector does not work properly for a short
period. Impulse noise appears when disturbing microwave
energies are present or the sensor/detector is degraded. Band
missing [3] is a serious problem and is caused by corruption of
two or more drop/strip lines continuously. For removal of
these artifacts, generally separate methods are employed. Strip
lines and drop lines are considered as line scratches by Silva
and Corte-Real [4] for image sequences. According to him, a
positive type film suffers from bright scratches and negative
film suffers from dark scratches. Milady has considered only
the dark scratches; if bright scratches exist he inverted them
and used the same algorithm. Silva and Corte-Real [4] gives a
solution for removing the blotches and line scratches in
images. He has considered only vertical lines (which are
narrow) and the blotches as impulsive with constant intensity
having irregular shapes. Kokaram [5] has given a method for
removal of scratches and restoration of missing data in the
image sequences based on temporal filtering. Additionally,
impulse noise is a standard type of degradation in remotely
sensed images. This paper considers application of medianbased algorithms for removal of impulses, strip lines, drop
lines, band missing, and blotches while preserving edges. It
has been shown recently that an adaptive length algorithm
provides a better solution for removal of impulse noise with
better edge and fine detail preservation. Several adaptive
algorithms [6–9] are available for removal of impulse noises.
However, none of these algorithms addressed the problem of
strip lines, drop lines, blotches, and band missing in images.

10
International Science Index 44, 2010 waset.org/publications/15180

World Academy of Science, Engineering and Technology
International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010

The objective of this paper is to propose an adaptive length
median/mean algorithm that can simultaneously remove
impulses, strip lines, drop lines, band missing, and blotches
while preserving edges. The advantage of the proposed
algorithm is that a single algorithm with improved
performance can replace several independent algorithms
required for removal of different artifacts. Blotches are
impulsive-type degradations randomly distributed with
irregular shapes of approximately constant intensity. These
artifacts last for one frame. In the degraded regions, there is no
correlation between successive frames. Blotches are originated
by dust, warping of the substrate or emulsion, mould, dirt, or
other unknown causes. Blotches in film sequences can be
either bright or dark spots. If the blotch is formed on the
positive print of the film, then the result will be a bright spot,
however if it is formed on the negative print, then in the
positive copy, we will see a dark spot.
The paper has been organized in the following manner;
section II describes image noise model, section III proposes
problem formulation and solution methodology, proposed
algorithm is illustrated in section IV, followed by section V
which gives implementation details subsequently section VI
describes the result and discussion, section VII gives
concluding remarks and further works and finally section VIII
incorporates all the references been made for completion of
this work.
II. IMAGE NOISE MODEL
An image usually contains departures from the ideal signal
that would be produced by general model of the signal
production process. Such departures are referred to as noise.
Noise arises as a result of un-modeled processes available on
in the production and capture of the actual signal. It is not part
of the ideal signal and may be caused by a wide range of
sources, e.g. variations 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 noise (e.g.
surface reflectance textures). The characteristics of noise
depend on its source, as does the operator which best reduces
its effects.
Many image processing tools deal with contain 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. Noise can generally be grouped into two
classes: (i) independent noise, and (ii) noise which is
dependent on the image data. Image independent noise can
often be described by an additive noise model, where the
traced image f(x,y) is the sum of the original image s(x,y) and
the noise n(x,y): i.e. f(x,y)=s(x,y)+n(x,y).
In several cases, additive noise is equally distributed over
the frequency domain (i.e. white noise), while an image
contains generally low frequency information. Hence, the
noise is dominant for high frequencies and its effects can be
reduced using some kind of low-pass filter. This can be done
either with a frequency filter or with a spatial filter. (Often a

spatial filter is preferable, as it is computationally less
expensive than a frequency filter.) In the second case of datadependent noise (e.g. arising when monochromatic radiation is
scattered from a surface whose roughness is of the order of a
wavelength, causing wave interference which results in image
speckle), it is possible to model noise with a multiplicative, or
non-linear model. These models are mathematically more
complicated. Hence, the noise can be assumed as data
independent.
Detector Noise is a kind of noise which occurs in all traced
images to a certain extent is detector noise. This kind of noise
is due to the discrete nature of radiation, i.e. the fact that each
imaging system is recording an image by counting photons.
Allowing some assumptions (which are valid for many
applications) this noise can be modeled with an independent,
additive model, where the noise n(x,y) has a zero-mean
Gaussian distribution described by its standard deviation (σ),
or variance. (The 1-D Gaussian distribution has the form
shown in Figure 1.) This means that each pixel in the noisy
image is the sum of the true pixel value and a random,
Gaussian distributed noise value.
Salt and Pepper Noise is another common form of noise is
data drop-out noise (commonly referred to as intensity spikes,
speckle). Here, the noise causes errors in the data
transmission. The corrupted pixels are either set to the
maximum value (which looks like snow in the image) or have
single bits flipped over. In some cases, single pixels are set
alternatively to zero or to the maximum value, giving the
image a salt and pepper like appearance. Unaffected pixels
always remain unchanged. The noise is usually quantified by
the percentage of pixels which are corrupted.

Fig. 1 1-D Gaussian distribution (mean=0 standard deviation=1)

The block diagram (fig. 2) for general degradation model is
where f(x,y) is the corrupted image obtained by passing the
original image s(x,y) through a low pass filter (blurring
function) b(x,y) and adding noise n(x,y) to it.
It is difficult to propose a general mathematical model
for the effect of the abrasion of the film causing the scratches
due to the high number of variables that are involved in the
process. However, it is possible to make some physical and
geometrical considerations regarding the brightness, thickness,

11
World Academy of Science, Engineering and Technology
International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010

n(x,y)
Lowpass
Filter b

s(x,y)

f(x,y)

Fig 2 A general degradation model

International Science Index 44, 2010 waset.org/publications/15180

and vertical extent of the line. Line scratches can be
characterized as follows: (i) they present a considerable higher
or lower luminance than their neighborhoods; (ii) they tend to
extend over most of the vertical length of the image frame and
are not curved; and (iii) they are quite narrow, with widths no
larger than 10  pixels for video images. These features can be
used to define a model. The degraded image model considered
is
a(x,y)=I(x,y)(1-b(x,y))+b(x,y)c(x,y),
(1)
where I(x,y) is the pixel intensity of the uncorrupted signal,
b(x,y) is a detection variable which is set to 1 whenever pixels
are corrupted and 0 otherwise, c(x,y) is the observed intensity
in the corrupted region. This model is applied in this work to
images degraded by impulses, strip lines, drop lines, band
missing, and blotches.
If b(x,y)=0 then
a(x,y)=I(x,y)(1-0)+0.c(x,y)=I(x,y),

(2)

where I(x,y) is the original pixel value (uncorrupted pixel).
If b(x,y)=0 then
a(x,y)=I(x,y)(1-1)+1.c(x,y)=c(x,y),

(3)

where c(x,y) is the original pixel value (uncorrupted pixel).
Assume that each pixel at (x,y) is corrupted by an impulse
with probability p independent of whether other pixels are
corrupted or not. For images corrupted by a negative or
positive impulse, the impulse corrupted pixel e(x,y) takes on
the minimum pixel value smin with probability p, or s(x,y) the
maximum pixel value smax with probability 1-p. The image
corrupted by blotches or scratches (impulsive) can be now
modeled as

sorting in images [10]. General median filters often exhibit
blurring for large window sizes, or insufficient noise
suppression for small window sizes. Adaptive length median
filter overcomes these limitations of general median filters.
Lin and Willson [6] proposed an adaptive window length
median filter algorithm which can achieve a high degree of
noise suppression and still preserve image sharpness;
however, the algorithm performs poorly for mixed impulse
noise consisting of positive and negative impulses. Lin’s
algorithm is modified by Hwang and Haddad [7]. Huang’s
algorithm takes into account both positive and negative
impulses for simultaneous removal; but it acts poorly on the
strip lines, drop lines, and blotches.
Unlike these adaptive algorithms based on edge detection
[6,7], the proposed algorithm is based on artifacts detection.
The positive and negative impulses are removed separately. In
contrast to general adaptive length median filters, the window
size is restricted to a maximum of to minimize blurring.
Restriction of window size renders the median operation less
effective whenever noise is excessive (the output of the
median filter may turn out to be a noisy pixel). In this
situation, the algorithm switches to compute the average of
uncorrupted pixels in the window (the probability of getting
the noisy pixel as filtered output is lower because the
averaging takes only uncorrupted pixels into account). The
proposed algorithm removes the strip lines, drop lines,
blotches along with impulses even at higher noise densities.
Image enhancement in the frequency domain is
straightforward. We simply compute the Fourier transform of
the image to be enhanced, multiply the result by a filter (rather
than convolve in the spatial domain), and take the inverse
transform to produce the enhanced image. The idea of blurring
an image by reducing its high frequency components or
sharpening an image by increasing the magnitude of its high
frequency components is intuitively easy to understand.
However, computationally, it is often more efficient to
implement these operations as convolutions by small spatial
filters in the spatial domain. Understanding frequency domain
concepts is important, and leads to enhancement techniques
that might not have been thought of by restricting attention to
the spatial domain.

III. PROBLEM FORMULATION AND SOLUTION METHODOLOGY

A. Filtering
Low pass filtering involves the elimination of the high
frequency components in the image. It results in blurring of
the image (and thus a reduction in sharp transitions associated
with noise). An ideal low pass filter would retain all the low
frequency components, and eliminate all the high frequency
components. However, ideal filters suffer from two problems:
blurring and ringing. These problems are caused by the shape
of the associated spatial domain filter, which has a large
number of undulations. Smoother transitions in the frequency
domain filter, such as the Butterworth filter, achieve much
better results.

Median filter is a nonlinear filter, which preserves edges
while effectively removing impulse noise. Median operations
are performed by row sorting, column sorting, and diagonal

B. Homomorphic filtering
Images normally consist of light reflected from objects. The
basic nature of the image G(x,y) may be characterized by two

c(x,y)=e(x,y) with p
s(x,y) with 1-p

(4)

This, in fact, is the model that describes impulse noise in the
literature. However, the existing impulse filtering algorithms
do not effectively remove blotches and scratches. In Section 3,
an adaptive length median/mean filter algorithm is developed
that removes blotches, scratches effectively along with
impulse noise.

12
World Academy of Science, Engineering and Technology
International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010

components: (1) the amount of source light incident on the
scene being viewed, and (2) the amount of light reflected by
the objects in the scene. These portions of light are called the
illumination and reflectance components, and are denoted

By letting
i'(x,y)= G-1(H(ω,υ)*I(ω,υ))
and
r’(x,y)=G-1(H(ω,υ)*R(ω,υ))
we get
s(x,y) = i'(x,y) + r'(x,y).

(a)

(b)

International Science Index 44, 2010 waset.org/publications/15180

Fig. 3 Transfer function for an ideal low pass filter (a) Frequency
domain components (b) spatial domain components.

i(x,y) and r(x,y) respectively. The functions i and r combine
multiplicatively to give the image function f(x,y) =
i(x,y)*r(x,y), Where 0< i(x,y) <∞ and 0 < r(x,y) < 1. We
cannot easily use the above product to operate separately on
the frequency components of illumination and reflection
because the Fourier transform of the product of two functions
is not separable; that is G(f(x,y))≠G(i(x,y))*G(r(x,y)) Suppose,
however, that we define z(x,y)is equal to ln f(x,y ) or we may
also say that it is equal to ln i(x,y) + ln r(x,y) Then
G(z(x,y))=G(ln f(x,y)) one can describe it as sum of G(ln i(x,y)
and ln r(x,y))
or
Z(ω,υ)=I(ω,υ)+R(ω,υ),
(5)

(8)

Finally, as z was obtained by taking the logarithm of the
original image G, the inverse yields the desired enhanced
image Ĝ that is
Ĝ(x,y)=exp[s(x,y)]
= exp[i’(x,y)]*exp[r’(x,y)]
=i0(x,y*)r0(x,y)

(9)

Thus, the process of homomorphic filtering can be
summarized by the following diagram:

where Z, I and R are the Fourier transforms of z, ln i and ln r
respectively. The function Z represents the Fourier transform
of the sum of two images: a low frequency illumination image
and a high frequency reflectance image.
Fig. 5 The process of homomorphic filtering

IV. PROPOSED ALGORITHM

Fig. 4 Transfer function for homomorphic filtering.
If we now apply a filter with a transfer function that
suppresses low frequency components and enhances high
frequency components, then we can suppress the illumination
component and enhance the reflectance component. Thus
S(ω,υ)=H(ω,υ)*Z(ω,υ)
= H(ω,υ)*I(ω,υ)+H(ω,υ)*R(ω,υ)

The algorithm consists of two operations: first is the
detection of degraded pixels, and the second operation is the
replacement of faulty pixels with the estimated values.
Let the pixel be represented as P(i,j) and the number of
corrupted pixels in the window W(i,j) be n Let Pmax=255 and
Pmin=0 be the corrupted pixel values and P(i,j) ≠0 or 255
represent uncorrupted pixels.
Case 1: Consider window size 3X3 with typical values of
pixels shown as an array below. If P(i,j) ≠ 0 or 255 , then the
pixels are unaltered. For the array shown, there are no
corrupted pixels in the array; therefore, the pixels are
unaltered.(10)

(6)
111

s(x,y)=G (S(ω,υ))
=G-1(H(ω,υ)*I(ω,υ))+G-1(H(ω,υ)*R(ω,υ))

(7)

106

167

214

123

-1

214

236

where S is the Fourier transform of the result. In the spatial
domain

223

83

(10)

Case 2: If the number of corrupted pixels n in the window
W(i,j) ≤ 4, that is, n≤4, then two- dimensional window of size
3X3
is selected and median operation is performed by

13
World Academy of Science, Engineering and Technology
International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010

column sorting, row sorting, and diagonal sorting. The
corrupted P(i,j) is replaced by the median value. (11)
Row sorting

Corrupted matrix
255

214

123

123

214

255

0

255

214

0

214

255

123

234

0

0

123

234

↓Column sorting

(11)

Diagonal sorting↓

0

123

234

0

123

0

214

255

0

214

123
255

123

214

255

234

214

255

To assess the performance of the proposed filters for
removal of impulse noise and to evaluate their comparative
performance, different standard performance indices have
been used in the thesis. These are defined as follows:
Peak Signal to Noise Ratio (PSNR): It is measured in decibel
(dB) and for gray scale image it is defined as:

Corrupted matrix

Row sorting

123

0

156

255

234

0

123

156

234

255

255

0

214

97

0

0

0

97

214

255

0

234

255

133

191

0

131

191

234

255

199

International Science Index 44, 2010 waset.org/publications/15180

(ii) If all the pixels in 3X3 windows are corrupted (a typical
case is shown as an array below), then perform 5X5 median
filtering. On median filtering, the output may happen to be
noise pixels as in Case 4. Find the average of uncorrupted
pixels in the window and replace the corrupted value by the
average value.

255

234

255

0

0

199

234

255

255

255

167

210

198

178

167

178

198

210

255

(12)
Column sorting ↓

Diagonal sorting

0

0

156

97

0

0

0

98

210

167

123

0

210

133

0

0

123

156

178

255

199

167

214

198

178

0

133

191

234

255

255

234

234

255

234

0

214

198

234

255

255

255

255

255

255

255

199

234

255

255

Case 3: If the number of corrupted pixels n in the window
W(i,j) is between 5 and 12, that is, 5≤n≤12 , then perform
5X5 median filtering and replace the corrupted values by the
median value.
Case 4: (i) If the number of corrupted pixels n in the
window W(i,j) is greater than 13, (a typical case is shown as
an array below) increasing the window size may lead to
blurring; choose 3X3 median filtering. On median filtering
with smaller window sizes, the output may happen to be noise
pixels whenever the noise is excessive. In this case, find the
average of uncorrupted pixels in the window and replace the
corrupted value by the average value. The average of the pixel
value in the window is taken instead of median value, if the
number of uncorrupted pixels in the window is even (it is
convenient to define median for odd number of pixels).
(133 and 123 are the uncorrupted

255

123

255

255
255

i, j

0

0

255

0

255

255

123

255

0

SNRI (dB) = SNR of restored image in dB- SNR of noisy
image in dB
(15)
Where,
SNR of restored image dB=

10 log

0

255

255

133

145

255

123

⎡
⎢
10 log 10 ⎢
⎢∑
⎣ i

0

255

0

255

255

128

167

0

198

178

0

i

∑ (S

2
i, j

j

i, j

)

2

ˆ
− S i, j

j

⎤
⎥
⎥
⎥
⎥
⎦

(16)

∑∑S
∑ (S − X )
2

i, j

i

j

2

i, j

j

i, j

⎤
⎥
⎥
⎥
⎦

(17)

The higher value of SNRI reflects the better visual and
restoration performance.
Percentage of Spoiled Pixels (POSP): It may be defined as
the number of unaffected original pixels replaced with a
different gray value after filtering i.e.

133

255

∑∑S

Where, Xi,j is Noisy image pixel

255

199

10

⎡
⎢
⎢
⎢∑
⎢ i
⎣

SNR of Noisy image in dB =

(13)

↓

i, j

Signal to Noise Ratio Improvement (SNRI): SNRI in dB is
defined as the difference between the Signal to Noise Ratio
(SNR) of the restored image in dB and SNR of restored image
in dB i.e.

0

123

)

respectively. The higher the PSNR in the restored image, the
better is its quality.

133

0

(

255

pixels)

⎡
⎤
255 2
⎢ ∑∑
⎥
i
j
(14)
PSNR (dB) = 10 log10 ⎢
⎥
ˆ 2
⎢ ∑∑ S i , j − S i , j ⎥
⎢ i j
⎥
⎣
⎦
ˆ
Where S and S are the original and restored image pixels

255
0
(133+123)/2=128

14
World Academy of Science, Engineering and Technology
International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010

POSP =
⎡ Number of original pixels change their grayscale ⎤
(18)
⎢
⎥ × 100
Number of non - noisy pixels
⎣
⎦
Percentage of Noise Attenuated (PONA): It may be defined
as the number of pixels getting improved after being filtered.

PONA =

⎡ Number of noisy pixels getting improved ⎤
⎢
⎥ × 100 (19)
Total number of noisy pixels
⎣
⎦

International Science Index 44, 2010 waset.org/publications/15180

This parameter reflects the capability of the impulse noise
detector used prior to filtering. Small value of POSP shows the
improved performance of the detector. High value of POSP
leads to removal of original image properties and. edge jitters
in restored images. The more the percentage the better will be
the attenuation characteristic of the filter filtering. The
proposed algorithm NDB_RESTORE will act accordingly.
Algorithm: NDB_RESTORE

Take 3X3 windows size for image.
Calculate the number of corrupted pixels in the windows.
repeat {
if(n=0)
pixels are unaltered.
else if(n≤4)
perform 3X3 median filtering.
else if(5<n≤12)
perform 5X5 median filtering.
else if(n≥4)
{
perform 3X3 median filtering.

sequences. Motion estimation and compensation techniques
[11] are employed for tracking scratches on frames. Prediction
and interpolation are used to estimate motion vectors for video
de-noising. For fast motion prediction, commonly used
technique is Block Matching (BM) motion estimator. The
motion vector is obtained by minimizing a cost function
measuring the mismatch between a block and each predictor
candidate. The Motion Estimation (ME) gives motion vector
of each pixel or block of pixels which is an essential tool for
determining motion trajectories. Due to motion of objects in
scene (i.e., corresponding regions in an image sequence), the
same region does not occur in the same place in the previous
frame as in current one. ARPS [11] algorithm makes use of
the fact that the general motion in a frame is usually coherent,
that is, if the macro blocks around the current macro block
moved in a particular direction, then there is a high probability
that the current macro block will also have a similar motion
vector. ARPS algorithm uses the motion vector of the macro
block to its immediate left to predict its own motion vector.
The rood pattern search directly puts the search in an area
where there is a high probability of finding a good matching
block. The point that has the least weight becomes the origin
for subsequent search steps, and the search pattern is changed
to Small Diamond Search Pattern (SDSP). SDSP is repeated
until least weighted point is found to be at the center of the
SDSP. The main advantage of this algorithm over diamond
search (DS) is that if the predicted motion vector is (0, 0), it
does not waste computational time in carrying out Large
Diamond Search Pattern (LDSP); it rather directly starts using
SDSP.
The temporal median filter smoothes out sharp transitions in
intensity at each pixel position; it not only de-noises the whole
frame and removes blotches but also helps in stabilizing the
illuminating fluctuations. Temporal median filtering removes
the temporal noise in the form of small dots and streaks found
in some videos. In this approach, dirt is viewed as a temporal
impulse (single-frame incident) and hence treated by interframe processing by taking into account at least three
consecutive frames.

if all the pixels in 3X3 windows is corrupted
assume 5X5 windows size.
else
Replace the processed pixel by average of
uncorrupted pixel.
} until next window.
Stop.
V. IMPLEMENTATION
The proposed adaptive median/mean algorithm is applied to
video sequences degraded by scratches, blotches, and
impulses. Adaptive rood pattern search block matching
algorithm [11] is used for motion estimation of the image

VI. RESULTS
The algorithm is tested with different types of degradations,
namely, strip lines, drop lines, band missing, blotches, and
impulse noise. The results are compared with those of general
median filter, Lin’s adaptive length median filter, Gonzalez
adaptive length median filter and decision-based median filter.
The median filter and Lin’s algorithm cause blur in the
images and do not remove the degradations (Figures 6(c) and
6(d)). The Gonzalez adaptive algorithm removes the strip lines
and drop lines but the edges are not preserved properly
(Figures 6(d) and 7(d)) and this algorithm acts very poorly on
the blotches and band noises. The proposed algorithm removes
all these degradations more effectively with reduced blurring
and edge preservation. The results of the removal of noise at
different densities along with degradations.

15
World Academy of Science, Engineering and Technology
International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010

(a)

(b)

(e)

(f)

TABLE I
PSNR OF LENA AND GOLDHILL IMAGE CORRUPTED BY 20% OF IMPULSE
NOISE AND THE PROPOSED ALGORITHM CORRUPTED BY 20% NOISE +
DEGRADATIONS.
Filter
(c)

(d)

Lena

Goldhill

SMF

31.42

29.60

30.39

29.87

DBMF [13]

35.12

33.31

TSMF [14]

International Science Index 44, 2010 waset.org/publications/15180

CWMF [12]

31.84

31.53

ACWMF [8]

36.54

34.42

PF (noise + degradations)

35.15

35.05

VII. CONCLUSION
(e)

(f)

Fig. 6: Drop lines removal. (a) Original image. (b) Corrupted by drop
lines. (c) Median filtered image. (d) Lin’s adaptive length filter. (e)
Gonzalez adaptive length filter. (f) Proposed algorithm.

(a)

(b)

An adaptive length median/mean algorithm for removal of
drops lines, strip lines, white bands, black bands, blotches, and
impulses with minimum of blurring is developed. The
performance is evaluated in terms of PSNR. The performance
is compared with Lin’s adaptive median filter, Gonzalez
adaptive median filter, weighted median filter, decision-based
median filter and adaptive center weighted median filter. The
results show that the algorithm is more effective in the
removal of drop lines, strip lines, white bands, black bands,
and blotches along with impulse noise varying upto 70%. The
advantage of the proposed algorithm is that a single algorithm
with improved performance can replace several independent
algorithms required for removal of different artifacts.
Application of the proposed algorithm to black and color
video sequences is also illustrated.
ACKNOWLEDGMENT
The authors wish thanks to Dr. A. Jagadeesh, Director,
RCET-Bhilai for his kind support. We would also especially
grateful to Mr. Saurabh Rungta for providing necessary
facilities to incorporate this research work.
REFERENCES

(c)

(d)

[1]
[2]

Fig. 7: Strip lines removal. (a) Original Image. (b) Corrupted by
strip lines. (c) Median filtered image. (d) Lin’s adaptive length filter.
(e) Gonzalez adaptive length filter. (f) Proposed algorithm..

[3]

16

J. Astola and P. Kuosmanen, Fundamentals of Nonlinear Digital
Filtering, CRC Press, New York, NY, USA, 1977.
I. Pitas and A. N. Venetsanopoulos, Nonlinear Digital Filters: Principles
and Applications, Kluwer Academic Publishers, Boston, Mass, USA,
1990.
S. M. Shahrokhy, “Visual and statistical quality assessment and
improvement of remotely sensed images,” in Proceedings of the 20th
Congress of the International Society for Photogrammetry and Remote
Sensing (ISPRS '04), pp. 1–5, Istanbul, Turkey, July 2004.
World Academy of Science, Engineering and Technology
International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010

[4]

[5]

[6]
[7]
[8]
[9]
[10]
[11]

International Science Index 44, 2010 waset.org/publications/15180

[12]
[13]

[14]
[15]

A. U. Silva and L. Corte-Real, “Removal of blotches and line scratches
from film and video sequences using a digital restoration chain,” in
Proceedings of the IEEE-EURASIP Workshop on Nonlinear Signal and
Image Processing (NSIP '99), pp. 826–829, Antalya, Turkey, June 1999.
A. Kokaram, “Detection and removal of line scratches in degraded
motion picture sequences,” in Proceedings of the 8th European Signal
Processing Conference (EUSIPCO '96), vol. 1, pp. 5–8, Trieste, Italy,
September 1996.
H.-M. Lin and A. N. Willson, Jr., “Median filters with adaptive length,”
IEEE Transactions on Circuits and Systems, vol. 35, no. 6, pp. 675–690,
1988.
H. Hwang and R. A. Haddad, “Adaptive median filters: new algorithms
and results,” Transactions on Image Processing, vol. 4, no. 4, pp. 499–
502, 1995.
T. Chen and H. R. Wu, “Adaptive impulse detection using centerweighted median filters,” IEEE Signal Processing Letters, vol. 8, no. 1,
pp. 1–3, 2001.
W. Luo, “An efficient detail-preserving approach for removing impulse
noise in images,” IEEE Signal Processing Letters, vol. 13, no. 7, pp.
413–416, 2006.
K. S. Srinivasan and D. Ebenezer, “A new fast and efficient decisionbased algorithm for removal of high-density impulse noises,” IEEE
Signal Processing Letters, vol. 14, no. 3, pp. 189–192, 2007.
Y. Nie and K.-K. Ma, “Adaptive rood pattern search for fast blockmatching motion estimation,” IEEE Transactions on Image Processing,
vol. 11, no. 12, pp. 1442–1449, 2002.
S.-J. Ko and Y. H. Lee, “Center weighted median filters and their
applications to image enhancement,” IEEE Transactions on Circuits and
Systems, vol. 38, no. 9, pp. 984–993, 1991.
D. A. F. Florencio and R. W. Schafer, “Decision-based median filter
using local signal statistics,” in Visual Communications and Image
Processing '94, vol. 2308 of Proceedings of SPIE, pp. 268–275, Chicago,
Ill, USA, September 1994.
T. Chen, K.-K. Ma, and L.-H. Chen, “Tri-state median filter for image
denoising,” IEEE Transactions on Image Processing, vol. 8, no. 12, pp.
1834–1838, 1999.
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.
1012–1025, 1996.

Santanu K. Nayak is working as Professor at Aditya Institute of Technology
and Management (after taking lien from Berhampur University, Orissa). He
completed his M.Tech. degree from Indian Institute of Science, Bangalore in
Instrumentation in the year 1990 and joined as faculty member in the
Department of Electronics(Berhampur University) in the year 1991. He
received his Ph.D. degree in Electronics in the year 1996 from Berhampur
University. He is member of IEEE, member and life member of different
national professional bodies. He has published many papers in various
national, international journals and conferences. He is also reviewer of EIS
(Elsevier). His present area of research includes signal processing, image
processing, fuzzy logic, instrumentation and embedded systems.
C. Ardil is with National Academy of Aviation, AZ1045, Baku, Azerbaijan,
Bina, 25th km, NAA

Susanta K. Satpathy (M’08) is working as a professor at Rungta College of
Engineering and Technology,Bhilai, Chhattisgarh. He received the M. Tech
degree in Computer Science and Engineering from NIT, Rourkela in 2003 and
B.Tech. dgree in Computer Science and Engineering in 1995. He has
published above 10 papers in various Journals and conferences. He is life
time member of CSI and ISTE since 2008. He worked in various other
engineering colleges for about 14 years. His area of reasearch includes Signal
processing, image processing and information system and security.
Sidhartha Panda is working as a Professor at National Institute of Science
and Technology (NIST), Berhampur, Orissa, India. He received the Ph.D.
degree from Indian Institute of Technology, Roorkee, India in 2008, M.E.
degree in Power Systems Engineering from UCE, Burla in 2001 and B.E.
degree in Electrical Engineering in 1991. Earlier, he worked as an Associate
Professor in KIIT Deemed University and also in various other engineering
colleges for about 15 years. He has published above 50 papers in various
International Journals and acting as a reviewer for some IEEE and Elsevier
Journals. His biography has been included in Marquis' “Who's Who in the
World” USA, for 2010 edition. His areas of research include power system
transient stability, power system dynamic stability, FACTS, optimization
techniques, model order reduction, distributed generation, image processing
and wind energy.
Kapil K. Nagwanshi (M’09) was born in August 1978 in Chhindwara
district, Madhya Pradesh, India. He is graduated from GG University,
Bilaspur, a Central University of Chhattisgarh State, India, in Computer
Science & Engineering in the year 2001 and later did his post graduation in
Computer Technology & Application from Chhattisgarh Swami Vivekanand
Technical University, Bhilai, India. He is life time member of International
Association of Computer Science & Information Technology since
2009.Currently he is working as a Reader in RCET Bhilai, and he has
published more than 28 research papers in reputed journals, national and
international conferences. His research area includes, signal processing, and
image processing, and information systems and security.

17

More Related Content

What's hot

Improvement of Weld Images using MATLAB –A Review
Improvement of Weld Images using MATLAB –A ReviewImprovement of Weld Images using MATLAB –A Review
Improvement of Weld Images using MATLAB –A Reviewinventy
 
Image Filtering Based on GMSK
Image Filtering Based on GMSKImage Filtering Based on GMSK
Image Filtering Based on GMSKijtsrd
 
Whitepaper: Image Quality Impact of SmartGrid Processing in Bedside Chest Ima...
Whitepaper: Image Quality Impact of SmartGrid Processing in Bedside Chest Ima...Whitepaper: Image Quality Impact of SmartGrid Processing in Bedside Chest Ima...
Whitepaper: Image Quality Impact of SmartGrid Processing in Bedside Chest Ima...Carestream
 
Performance of Various Order Statistics Filters in Impulse and Mixed Noise Re...
Performance of Various Order Statistics Filters in Impulse and Mixed Noise Re...Performance of Various Order Statistics Filters in Impulse and Mixed Noise Re...
Performance of Various Order Statistics Filters in Impulse and Mixed Noise Re...sipij
 
IRJET- Removal of Gaussian Impulsive Noise from Computed Tomography
IRJET- Removal of Gaussian Impulsive Noise from Computed TomographyIRJET- Removal of Gaussian Impulsive Noise from Computed Tomography
IRJET- Removal of Gaussian Impulsive Noise from Computed TomographyIRJET Journal
 
Fcv learn sudderth
Fcv learn sudderthFcv learn sudderth
Fcv learn sudderthzukun
 
International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)IJERD Editor
 
survey paper for image denoising
survey paper for image denoisingsurvey paper for image denoising
survey paper for image denoisingArti Singh
 
IRJET - Simulation of Colour Image Processing Techniques on VHDL
IRJET - Simulation of Colour Image Processing Techniques on VHDLIRJET - Simulation of Colour Image Processing Techniques on VHDL
IRJET - Simulation of Colour Image Processing Techniques on VHDLIRJET Journal
 
PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...
PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...
PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...ijistjournal
 
Deblurring Image and Removing Noise from Medical Images for Cancerous Disease...
Deblurring Image and Removing Noise from Medical Images for Cancerous Disease...Deblurring Image and Removing Noise from Medical Images for Cancerous Disease...
Deblurring Image and Removing Noise from Medical Images for Cancerous Disease...IRJET Journal
 
Survey on Image Integration of Misaligned Images
Survey on Image Integration of Misaligned ImagesSurvey on Image Integration of Misaligned Images
Survey on Image Integration of Misaligned ImagesIRJET Journal
 
A Decision tree and Conditional Median Filter Based Denoising for impulse noi...
A Decision tree and Conditional Median Filter Based Denoising for impulse noi...A Decision tree and Conditional Median Filter Based Denoising for impulse noi...
A Decision tree and Conditional Median Filter Based Denoising for impulse noi...IJERA Editor
 
Noise Reduction Technique using Bilateral Based Filter
Noise Reduction Technique using Bilateral Based FilterNoise Reduction Technique using Bilateral Based Filter
Noise Reduction Technique using Bilateral Based FilterIRJET Journal
 
Computationally Efficient Methods for Sonar Image Denoising using Fractional ...
Computationally Efficient Methods for Sonar Image Denoising using Fractional ...Computationally Efficient Methods for Sonar Image Denoising using Fractional ...
Computationally Efficient Methods for Sonar Image Denoising using Fractional ...CSCJournals
 

What's hot (20)

L010427275
L010427275L010427275
L010427275
 
Improvement of Weld Images using MATLAB –A Review
Improvement of Weld Images using MATLAB –A ReviewImprovement of Weld Images using MATLAB –A Review
Improvement of Weld Images using MATLAB –A Review
 
Image Filtering Based on GMSK
Image Filtering Based on GMSKImage Filtering Based on GMSK
Image Filtering Based on GMSK
 
Ijetcas14 479
Ijetcas14 479Ijetcas14 479
Ijetcas14 479
 
Whitepaper: Image Quality Impact of SmartGrid Processing in Bedside Chest Ima...
Whitepaper: Image Quality Impact of SmartGrid Processing in Bedside Chest Ima...Whitepaper: Image Quality Impact of SmartGrid Processing in Bedside Chest Ima...
Whitepaper: Image Quality Impact of SmartGrid Processing in Bedside Chest Ima...
 
Performance of Various Order Statistics Filters in Impulse and Mixed Noise Re...
Performance of Various Order Statistics Filters in Impulse and Mixed Noise Re...Performance of Various Order Statistics Filters in Impulse and Mixed Noise Re...
Performance of Various Order Statistics Filters in Impulse and Mixed Noise Re...
 
IRJET- Removal of Gaussian Impulsive Noise from Computed Tomography
IRJET- Removal of Gaussian Impulsive Noise from Computed TomographyIRJET- Removal of Gaussian Impulsive Noise from Computed Tomography
IRJET- Removal of Gaussian Impulsive Noise from Computed Tomography
 
Fcv learn sudderth
Fcv learn sudderthFcv learn sudderth
Fcv learn sudderth
 
International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)
 
survey paper for image denoising
survey paper for image denoisingsurvey paper for image denoising
survey paper for image denoising
 
IRJET - Simulation of Colour Image Processing Techniques on VHDL
IRJET - Simulation of Colour Image Processing Techniques on VHDLIRJET - Simulation of Colour Image Processing Techniques on VHDL
IRJET - Simulation of Colour Image Processing Techniques on VHDL
 
PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...
PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...
PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...
 
Confer
ConferConfer
Confer
 
Deblurring Image and Removing Noise from Medical Images for Cancerous Disease...
Deblurring Image and Removing Noise from Medical Images for Cancerous Disease...Deblurring Image and Removing Noise from Medical Images for Cancerous Disease...
Deblurring Image and Removing Noise from Medical Images for Cancerous Disease...
 
Survey on Image Integration of Misaligned Images
Survey on Image Integration of Misaligned ImagesSurvey on Image Integration of Misaligned Images
Survey on Image Integration of Misaligned Images
 
A Decision tree and Conditional Median Filter Based Denoising for impulse noi...
A Decision tree and Conditional Median Filter Based Denoising for impulse noi...A Decision tree and Conditional Median Filter Based Denoising for impulse noi...
A Decision tree and Conditional Median Filter Based Denoising for impulse noi...
 
J010245458
J010245458J010245458
J010245458
 
Noise Reduction Technique using Bilateral Based Filter
Noise Reduction Technique using Bilateral Based FilterNoise Reduction Technique using Bilateral Based Filter
Noise Reduction Technique using Bilateral Based Filter
 
Computationally Efficient Methods for Sonar Image Denoising using Fractional ...
Computationally Efficient Methods for Sonar Image Denoising using Fractional ...Computationally Efficient Methods for Sonar Image Denoising using Fractional ...
Computationally Efficient Methods for Sonar Image Denoising using Fractional ...
 
W6P3622650776P65
W6P3622650776P65W6P3622650776P65
W6P3622650776P65
 

Viewers also liked

E collaborative-learning-circles
E collaborative-learning-circlesE collaborative-learning-circles
E collaborative-learning-circlesCemal Ardil
 
Application of-computational-intelligence-techniques-for-economic-load-dispatch
Application of-computational-intelligence-techniques-for-economic-load-dispatchApplication of-computational-intelligence-techniques-for-economic-load-dispatch
Application of-computational-intelligence-techniques-for-economic-load-dispatchCemal Ardil
 
Aircraft gas-turbine-engines-technical-condition-identification-system
Aircraft gas-turbine-engines-technical-condition-identification-systemAircraft gas-turbine-engines-technical-condition-identification-system
Aircraft gas-turbine-engines-technical-condition-identification-systemCemal Ardil
 
Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-
Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-
Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-Cemal Ardil
 
Mimo system-order-reduction-using-real-coded-genetic-algorithm
Mimo system-order-reduction-using-real-coded-genetic-algorithmMimo system-order-reduction-using-real-coded-genetic-algorithm
Mimo system-order-reduction-using-real-coded-genetic-algorithmCemal Ardil
 
A simplified-single-correlator-rake-receiver-for-cdma-communications
A simplified-single-correlator-rake-receiver-for-cdma-communicationsA simplified-single-correlator-rake-receiver-for-cdma-communications
A simplified-single-correlator-rake-receiver-for-cdma-communicationsCemal Ardil
 
Design development-and-implementation-of-a temperature-sensor-using-zigbee-co...
Design development-and-implementation-of-a temperature-sensor-using-zigbee-co...Design development-and-implementation-of-a temperature-sensor-using-zigbee-co...
Design development-and-implementation-of-a temperature-sensor-using-zigbee-co...Cemal Ardil
 
Approximate bounded-knowledge-extractionusing-type-i-fuzzy-logic
Approximate bounded-knowledge-extractionusing-type-i-fuzzy-logicApproximate bounded-knowledge-extractionusing-type-i-fuzzy-logic
Approximate bounded-knowledge-extractionusing-type-i-fuzzy-logicCemal Ardil
 
Development of-new-control-techniques-for-vibration-isolation-of-structures-u...
Development of-new-control-techniques-for-vibration-isolation-of-structures-u...Development of-new-control-techniques-for-vibration-isolation-of-structures-u...
Development of-new-control-techniques-for-vibration-isolation-of-structures-u...Cemal Ardil
 

Viewers also liked (9)

E collaborative-learning-circles
E collaborative-learning-circlesE collaborative-learning-circles
E collaborative-learning-circles
 
Application of-computational-intelligence-techniques-for-economic-load-dispatch
Application of-computational-intelligence-techniques-for-economic-load-dispatchApplication of-computational-intelligence-techniques-for-economic-load-dispatch
Application of-computational-intelligence-techniques-for-economic-load-dispatch
 
Aircraft gas-turbine-engines-technical-condition-identification-system
Aircraft gas-turbine-engines-technical-condition-identification-systemAircraft gas-turbine-engines-technical-condition-identification-system
Aircraft gas-turbine-engines-technical-condition-identification-system
 
Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-
Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-
Compact binary-tree-representation-of-logic-function-with-enhanced-throughput-
 
Mimo system-order-reduction-using-real-coded-genetic-algorithm
Mimo system-order-reduction-using-real-coded-genetic-algorithmMimo system-order-reduction-using-real-coded-genetic-algorithm
Mimo system-order-reduction-using-real-coded-genetic-algorithm
 
A simplified-single-correlator-rake-receiver-for-cdma-communications
A simplified-single-correlator-rake-receiver-for-cdma-communicationsA simplified-single-correlator-rake-receiver-for-cdma-communications
A simplified-single-correlator-rake-receiver-for-cdma-communications
 
Design development-and-implementation-of-a temperature-sensor-using-zigbee-co...
Design development-and-implementation-of-a temperature-sensor-using-zigbee-co...Design development-and-implementation-of-a temperature-sensor-using-zigbee-co...
Design development-and-implementation-of-a temperature-sensor-using-zigbee-co...
 
Approximate bounded-knowledge-extractionusing-type-i-fuzzy-logic
Approximate bounded-knowledge-extractionusing-type-i-fuzzy-logicApproximate bounded-knowledge-extractionusing-type-i-fuzzy-logic
Approximate bounded-knowledge-extractionusing-type-i-fuzzy-logic
 
Development of-new-control-techniques-for-vibration-isolation-of-structures-u...
Development of-new-control-techniques-for-vibration-isolation-of-structures-u...Development of-new-control-techniques-for-vibration-isolation-of-structures-u...
Development of-new-control-techniques-for-vibration-isolation-of-structures-u...
 

Similar to Adaptive non-linear-filtering-technique-for-image-restoration

Numerical simulation of flow modeling in ducted axial fan using simpson’s 13r...
Numerical simulation of flow modeling in ducted axial fan using simpson’s 13r...Numerical simulation of flow modeling in ducted axial fan using simpson’s 13r...
Numerical simulation of flow modeling in ducted axial fan using simpson’s 13r...iaemedu
 
A new tristate switching median filtering technique for image enhancement
A new tristate switching median filtering technique for image enhancementA new tristate switching median filtering technique for image enhancement
A new tristate switching median filtering technique for image enhancementiaemedu
 
An Efficient Image Denoising Approach for the Recovery of Impulse Noise
An Efficient Image Denoising Approach for the Recovery of Impulse NoiseAn Efficient Image Denoising Approach for the Recovery of Impulse Noise
An Efficient Image Denoising Approach for the Recovery of Impulse NoisejournalBEEI
 
A SURVEY : On Image Denoising and its Various Techniques
A SURVEY :  On Image Denoising and its Various TechniquesA SURVEY :  On Image Denoising and its Various Techniques
A SURVEY : On Image Denoising and its Various TechniquesIRJET Journal
 
A Novel Framework For Preprocessing Of Breast Ultra Sound Images By Combining...
A Novel Framework For Preprocessing Of Breast Ultra Sound Images By Combining...A Novel Framework For Preprocessing Of Breast Ultra Sound Images By Combining...
A Novel Framework For Preprocessing Of Breast Ultra Sound Images By Combining...IRJET Journal
 
PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...
PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...
PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...ijistjournal
 
Adaptive denoising technique for colour images
Adaptive denoising technique for colour imagesAdaptive denoising technique for colour images
Adaptive denoising technique for colour imageseSAT Journals
 
Parameterized Image Filtering Using fuzzy Logic
Parameterized Image Filtering Using fuzzy LogicParameterized Image Filtering Using fuzzy Logic
Parameterized Image Filtering Using fuzzy LogicEditor IJCATR
 
Random Valued Impulse Noise Elimination using Neural Filter
Random Valued Impulse Noise Elimination using Neural FilterRandom Valued Impulse Noise Elimination using Neural Filter
Random Valued Impulse Noise Elimination using Neural FilterEditor IJCATR
 
Authentication Using Hand Vein Pattern
Authentication Using Hand Vein PatternAuthentication Using Hand Vein Pattern
Authentication Using Hand Vein PatternIJTET Journal
 
Nonlinear Transformation Based Detection And Directional Mean Filter to Remo...
Nonlinear Transformation Based Detection And Directional  Mean Filter to Remo...Nonlinear Transformation Based Detection And Directional  Mean Filter to Remo...
Nonlinear Transformation Based Detection And Directional Mean Filter to Remo...IJMER
 
Pattern Approximation Based Generalized Image Noise Reduction Using Adaptive ...
Pattern Approximation Based Generalized Image Noise Reduction Using Adaptive ...Pattern Approximation Based Generalized Image Noise Reduction Using Adaptive ...
Pattern Approximation Based Generalized Image Noise Reduction Using Adaptive ...IJECEIAES
 
Adapter Wavelet Thresholding for Image Denoising Using Various Shrinkage Unde...
Adapter Wavelet Thresholding for Image Denoising Using Various Shrinkage Unde...Adapter Wavelet Thresholding for Image Denoising Using Various Shrinkage Unde...
Adapter Wavelet Thresholding for Image Denoising Using Various Shrinkage Unde...muhammed jassim k
 
Strengthen Fuzzy Pronouncement for Impulse Noise Riddance Method for Images B...
Strengthen Fuzzy Pronouncement for Impulse Noise Riddance Method for Images B...Strengthen Fuzzy Pronouncement for Impulse Noise Riddance Method for Images B...
Strengthen Fuzzy Pronouncement for Impulse Noise Riddance Method for Images B...IRJET Journal
 
A Hybrid Filtering Technique for Random Valued Impulse Noise Elimination on D...
A Hybrid Filtering Technique for Random Valued Impulse Noise Elimination on D...A Hybrid Filtering Technique for Random Valued Impulse Noise Elimination on D...
A Hybrid Filtering Technique for Random Valued Impulse Noise Elimination on D...IDES Editor
 
An Application of Second Generation Wavelets for Image Denoising using Dual T...
An Application of Second Generation Wavelets for Image Denoising using Dual T...An Application of Second Generation Wavelets for Image Denoising using Dual T...
An Application of Second Generation Wavelets for Image Denoising using Dual T...IDES Editor
 

Similar to Adaptive non-linear-filtering-technique-for-image-restoration (20)

Numerical simulation of flow modeling in ducted axial fan using simpson’s 13r...
Numerical simulation of flow modeling in ducted axial fan using simpson’s 13r...Numerical simulation of flow modeling in ducted axial fan using simpson’s 13r...
Numerical simulation of flow modeling in ducted axial fan using simpson’s 13r...
 
A new tristate switching median filtering technique for image enhancement
A new tristate switching median filtering technique for image enhancementA new tristate switching median filtering technique for image enhancement
A new tristate switching median filtering technique for image enhancement
 
An Efficient Image Denoising Approach for the Recovery of Impulse Noise
An Efficient Image Denoising Approach for the Recovery of Impulse NoiseAn Efficient Image Denoising Approach for the Recovery of Impulse Noise
An Efficient Image Denoising Approach for the Recovery of Impulse Noise
 
A SURVEY : On Image Denoising and its Various Techniques
A SURVEY :  On Image Denoising and its Various TechniquesA SURVEY :  On Image Denoising and its Various Techniques
A SURVEY : On Image Denoising and its Various Techniques
 
A Novel Framework For Preprocessing Of Breast Ultra Sound Images By Combining...
A Novel Framework For Preprocessing Of Breast Ultra Sound Images By Combining...A Novel Framework For Preprocessing Of Breast Ultra Sound Images By Combining...
A Novel Framework For Preprocessing Of Breast Ultra Sound Images By Combining...
 
PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...
PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...
PERFORMANCE ANALYSIS OF UNSYMMETRICAL TRIMMED MEDIAN AS DETECTOR ON IMAGE NOI...
 
A Proposed Framework to De-noise Medical Images Based on Convolution Neural N...
A Proposed Framework to De-noise Medical Images Based on Convolution Neural N...A Proposed Framework to De-noise Medical Images Based on Convolution Neural N...
A Proposed Framework to De-noise Medical Images Based on Convolution Neural N...
 
Co33548550
Co33548550Co33548550
Co33548550
 
Co33548550
Co33548550Co33548550
Co33548550
 
Adaptive denoising technique for colour images
Adaptive denoising technique for colour imagesAdaptive denoising technique for colour images
Adaptive denoising technique for colour images
 
Parameterized Image Filtering Using fuzzy Logic
Parameterized Image Filtering Using fuzzy LogicParameterized Image Filtering Using fuzzy Logic
Parameterized Image Filtering Using fuzzy Logic
 
Random Valued Impulse Noise Elimination using Neural Filter
Random Valued Impulse Noise Elimination using Neural FilterRandom Valued Impulse Noise Elimination using Neural Filter
Random Valued Impulse Noise Elimination using Neural Filter
 
Authentication Using Hand Vein Pattern
Authentication Using Hand Vein PatternAuthentication Using Hand Vein Pattern
Authentication Using Hand Vein Pattern
 
Nonlinear Transformation Based Detection And Directional Mean Filter to Remo...
Nonlinear Transformation Based Detection And Directional  Mean Filter to Remo...Nonlinear Transformation Based Detection And Directional  Mean Filter to Remo...
Nonlinear Transformation Based Detection And Directional Mean Filter to Remo...
 
Pattern Approximation Based Generalized Image Noise Reduction Using Adaptive ...
Pattern Approximation Based Generalized Image Noise Reduction Using Adaptive ...Pattern Approximation Based Generalized Image Noise Reduction Using Adaptive ...
Pattern Approximation Based Generalized Image Noise Reduction Using Adaptive ...
 
Adapter Wavelet Thresholding for Image Denoising Using Various Shrinkage Unde...
Adapter Wavelet Thresholding for Image Denoising Using Various Shrinkage Unde...Adapter Wavelet Thresholding for Image Denoising Using Various Shrinkage Unde...
Adapter Wavelet Thresholding for Image Denoising Using Various Shrinkage Unde...
 
Strengthen Fuzzy Pronouncement for Impulse Noise Riddance Method for Images B...
Strengthen Fuzzy Pronouncement for Impulse Noise Riddance Method for Images B...Strengthen Fuzzy Pronouncement for Impulse Noise Riddance Method for Images B...
Strengthen Fuzzy Pronouncement for Impulse Noise Riddance Method for Images B...
 
Ijmet 09 11_013
Ijmet 09 11_013Ijmet 09 11_013
Ijmet 09 11_013
 
A Hybrid Filtering Technique for Random Valued Impulse Noise Elimination on D...
A Hybrid Filtering Technique for Random Valued Impulse Noise Elimination on D...A Hybrid Filtering Technique for Random Valued Impulse Noise Elimination on D...
A Hybrid Filtering Technique for Random Valued Impulse Noise Elimination on D...
 
An Application of Second Generation Wavelets for Image Denoising using Dual T...
An Application of Second Generation Wavelets for Image Denoising using Dual T...An Application of Second Generation Wavelets for Image Denoising using Dual T...
An Application of Second Generation Wavelets for Image Denoising using Dual T...
 

More from Cemal Ardil

Upfc supplementary-controller-design-using-real-coded-genetic-algorithm-for-d...
Upfc supplementary-controller-design-using-real-coded-genetic-algorithm-for-d...Upfc supplementary-controller-design-using-real-coded-genetic-algorithm-for-d...
Upfc supplementary-controller-design-using-real-coded-genetic-algorithm-for-d...Cemal Ardil
 
The main-principles-of-text-to-speech-synthesis-system
The main-principles-of-text-to-speech-synthesis-systemThe main-principles-of-text-to-speech-synthesis-system
The main-principles-of-text-to-speech-synthesis-systemCemal Ardil
 
The feedback-control-for-distributed-systems
The feedback-control-for-distributed-systemsThe feedback-control-for-distributed-systems
The feedback-control-for-distributed-systemsCemal Ardil
 
System overflow blocking-transients-for-queues-with-batch-arrivals-using-a-fa...
System overflow blocking-transients-for-queues-with-batch-arrivals-using-a-fa...System overflow blocking-transients-for-queues-with-batch-arrivals-using-a-fa...
System overflow blocking-transients-for-queues-with-batch-arrivals-using-a-fa...Cemal Ardil
 
Sonic localization-cues-for-classrooms-a-structural-model-proposal
Sonic localization-cues-for-classrooms-a-structural-model-proposalSonic localization-cues-for-classrooms-a-structural-model-proposal
Sonic localization-cues-for-classrooms-a-structural-model-proposalCemal Ardil
 
Robust fuzzy-observer-design-for-nonlinear-systems
Robust fuzzy-observer-design-for-nonlinear-systemsRobust fuzzy-observer-design-for-nonlinear-systems
Robust fuzzy-observer-design-for-nonlinear-systemsCemal Ardil
 
Response quality-evaluation-in-heterogeneous-question-answering-system-a-blac...
Response quality-evaluation-in-heterogeneous-question-answering-system-a-blac...Response quality-evaluation-in-heterogeneous-question-answering-system-a-blac...
Response quality-evaluation-in-heterogeneous-question-answering-system-a-blac...Cemal Ardil
 
Reduction of-linear-time-invariant-systems-using-routh-approximation-and-pso
Reduction of-linear-time-invariant-systems-using-routh-approximation-and-psoReduction of-linear-time-invariant-systems-using-routh-approximation-and-pso
Reduction of-linear-time-invariant-systems-using-routh-approximation-and-psoCemal Ardil
 
Real coded-genetic-algorithm-for-robust-power-system-stabilizer-design
Real coded-genetic-algorithm-for-robust-power-system-stabilizer-designReal coded-genetic-algorithm-for-robust-power-system-stabilizer-design
Real coded-genetic-algorithm-for-robust-power-system-stabilizer-designCemal Ardil
 
Performance of-block-codes-using-the-eigenstructure-of-the-code-correlation-m...
Performance of-block-codes-using-the-eigenstructure-of-the-code-correlation-m...Performance of-block-codes-using-the-eigenstructure-of-the-code-correlation-m...
Performance of-block-codes-using-the-eigenstructure-of-the-code-correlation-m...Cemal Ardil
 
Optimal supplementary-damping-controller-design-for-tcsc-employing-rcga
Optimal supplementary-damping-controller-design-for-tcsc-employing-rcgaOptimal supplementary-damping-controller-design-for-tcsc-employing-rcga
Optimal supplementary-damping-controller-design-for-tcsc-employing-rcgaCemal Ardil
 
Optimal straight-line-trajectory-generation-in-3 d-space-using-deviation-algo...
Optimal straight-line-trajectory-generation-in-3 d-space-using-deviation-algo...Optimal straight-line-trajectory-generation-in-3 d-space-using-deviation-algo...
Optimal straight-line-trajectory-generation-in-3 d-space-using-deviation-algo...Cemal Ardil
 
On the-optimal-number-of-smart-dust-particles
On the-optimal-number-of-smart-dust-particlesOn the-optimal-number-of-smart-dust-particles
On the-optimal-number-of-smart-dust-particlesCemal Ardil
 
On the-joint-optimization-of-performance-and-power-consumption-in-data-centers
On the-joint-optimization-of-performance-and-power-consumption-in-data-centersOn the-joint-optimization-of-performance-and-power-consumption-in-data-centers
On the-joint-optimization-of-performance-and-power-consumption-in-data-centersCemal Ardil
 
On the-approximate-solution-of-a-nonlinear-singular-integral-equation
On the-approximate-solution-of-a-nonlinear-singular-integral-equationOn the-approximate-solution-of-a-nonlinear-singular-integral-equation
On the-approximate-solution-of-a-nonlinear-singular-integral-equationCemal Ardil
 
On problem-of-parameters-identification-of-dynamic-object
On problem-of-parameters-identification-of-dynamic-objectOn problem-of-parameters-identification-of-dynamic-object
On problem-of-parameters-identification-of-dynamic-objectCemal Ardil
 
Numerical modeling-of-gas-turbine-engines
Numerical modeling-of-gas-turbine-enginesNumerical modeling-of-gas-turbine-engines
Numerical modeling-of-gas-turbine-enginesCemal Ardil
 
New technologies-for-modeling-of-gas-turbine-cooled-blades
New technologies-for-modeling-of-gas-turbine-cooled-bladesNew technologies-for-modeling-of-gas-turbine-cooled-blades
New technologies-for-modeling-of-gas-turbine-cooled-bladesCemal Ardil
 
Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...
Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...
Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...Cemal Ardil
 
Multivariate high-order-fuzzy-time-series-forecasting-for-car-road-accidents
Multivariate high-order-fuzzy-time-series-forecasting-for-car-road-accidentsMultivariate high-order-fuzzy-time-series-forecasting-for-car-road-accidents
Multivariate high-order-fuzzy-time-series-forecasting-for-car-road-accidentsCemal Ardil
 

More from Cemal Ardil (20)

Upfc supplementary-controller-design-using-real-coded-genetic-algorithm-for-d...
Upfc supplementary-controller-design-using-real-coded-genetic-algorithm-for-d...Upfc supplementary-controller-design-using-real-coded-genetic-algorithm-for-d...
Upfc supplementary-controller-design-using-real-coded-genetic-algorithm-for-d...
 
The main-principles-of-text-to-speech-synthesis-system
The main-principles-of-text-to-speech-synthesis-systemThe main-principles-of-text-to-speech-synthesis-system
The main-principles-of-text-to-speech-synthesis-system
 
The feedback-control-for-distributed-systems
The feedback-control-for-distributed-systemsThe feedback-control-for-distributed-systems
The feedback-control-for-distributed-systems
 
System overflow blocking-transients-for-queues-with-batch-arrivals-using-a-fa...
System overflow blocking-transients-for-queues-with-batch-arrivals-using-a-fa...System overflow blocking-transients-for-queues-with-batch-arrivals-using-a-fa...
System overflow blocking-transients-for-queues-with-batch-arrivals-using-a-fa...
 
Sonic localization-cues-for-classrooms-a-structural-model-proposal
Sonic localization-cues-for-classrooms-a-structural-model-proposalSonic localization-cues-for-classrooms-a-structural-model-proposal
Sonic localization-cues-for-classrooms-a-structural-model-proposal
 
Robust fuzzy-observer-design-for-nonlinear-systems
Robust fuzzy-observer-design-for-nonlinear-systemsRobust fuzzy-observer-design-for-nonlinear-systems
Robust fuzzy-observer-design-for-nonlinear-systems
 
Response quality-evaluation-in-heterogeneous-question-answering-system-a-blac...
Response quality-evaluation-in-heterogeneous-question-answering-system-a-blac...Response quality-evaluation-in-heterogeneous-question-answering-system-a-blac...
Response quality-evaluation-in-heterogeneous-question-answering-system-a-blac...
 
Reduction of-linear-time-invariant-systems-using-routh-approximation-and-pso
Reduction of-linear-time-invariant-systems-using-routh-approximation-and-psoReduction of-linear-time-invariant-systems-using-routh-approximation-and-pso
Reduction of-linear-time-invariant-systems-using-routh-approximation-and-pso
 
Real coded-genetic-algorithm-for-robust-power-system-stabilizer-design
Real coded-genetic-algorithm-for-robust-power-system-stabilizer-designReal coded-genetic-algorithm-for-robust-power-system-stabilizer-design
Real coded-genetic-algorithm-for-robust-power-system-stabilizer-design
 
Performance of-block-codes-using-the-eigenstructure-of-the-code-correlation-m...
Performance of-block-codes-using-the-eigenstructure-of-the-code-correlation-m...Performance of-block-codes-using-the-eigenstructure-of-the-code-correlation-m...
Performance of-block-codes-using-the-eigenstructure-of-the-code-correlation-m...
 
Optimal supplementary-damping-controller-design-for-tcsc-employing-rcga
Optimal supplementary-damping-controller-design-for-tcsc-employing-rcgaOptimal supplementary-damping-controller-design-for-tcsc-employing-rcga
Optimal supplementary-damping-controller-design-for-tcsc-employing-rcga
 
Optimal straight-line-trajectory-generation-in-3 d-space-using-deviation-algo...
Optimal straight-line-trajectory-generation-in-3 d-space-using-deviation-algo...Optimal straight-line-trajectory-generation-in-3 d-space-using-deviation-algo...
Optimal straight-line-trajectory-generation-in-3 d-space-using-deviation-algo...
 
On the-optimal-number-of-smart-dust-particles
On the-optimal-number-of-smart-dust-particlesOn the-optimal-number-of-smart-dust-particles
On the-optimal-number-of-smart-dust-particles
 
On the-joint-optimization-of-performance-and-power-consumption-in-data-centers
On the-joint-optimization-of-performance-and-power-consumption-in-data-centersOn the-joint-optimization-of-performance-and-power-consumption-in-data-centers
On the-joint-optimization-of-performance-and-power-consumption-in-data-centers
 
On the-approximate-solution-of-a-nonlinear-singular-integral-equation
On the-approximate-solution-of-a-nonlinear-singular-integral-equationOn the-approximate-solution-of-a-nonlinear-singular-integral-equation
On the-approximate-solution-of-a-nonlinear-singular-integral-equation
 
On problem-of-parameters-identification-of-dynamic-object
On problem-of-parameters-identification-of-dynamic-objectOn problem-of-parameters-identification-of-dynamic-object
On problem-of-parameters-identification-of-dynamic-object
 
Numerical modeling-of-gas-turbine-engines
Numerical modeling-of-gas-turbine-enginesNumerical modeling-of-gas-turbine-engines
Numerical modeling-of-gas-turbine-engines
 
New technologies-for-modeling-of-gas-turbine-cooled-blades
New technologies-for-modeling-of-gas-turbine-cooled-bladesNew technologies-for-modeling-of-gas-turbine-cooled-blades
New technologies-for-modeling-of-gas-turbine-cooled-blades
 
Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...
Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...
Neuro -fuzzy-networks-for-identification-of-mathematical-model-parameters-of-...
 
Multivariate high-order-fuzzy-time-series-forecasting-for-car-road-accidents
Multivariate high-order-fuzzy-time-series-forecasting-for-car-road-accidentsMultivariate high-order-fuzzy-time-series-forecasting-for-car-road-accidents
Multivariate high-order-fuzzy-time-series-forecasting-for-car-road-accidents
 

Recently uploaded

Flow Control | Block Size | ST Min | First Frame
Flow Control | Block Size | ST Min | First FrameFlow Control | Block Size | ST Min | First Frame
Flow Control | Block Size | ST Min | First FrameKapil Thakar
 
Explore the UiPath Community and ways you can benefit on your journey to auto...
Explore the UiPath Community and ways you can benefit on your journey to auto...Explore the UiPath Community and ways you can benefit on your journey to auto...
Explore the UiPath Community and ways you can benefit on your journey to auto...DianaGray10
 
UiPath Studio Web workshop series - Day 2
UiPath Studio Web workshop series - Day 2UiPath Studio Web workshop series - Day 2
UiPath Studio Web workshop series - Day 2DianaGray10
 
Where developers are challenged, what developers want and where DevEx is going
Where developers are challenged, what developers want and where DevEx is goingWhere developers are challenged, what developers want and where DevEx is going
Where developers are challenged, what developers want and where DevEx is goingFrancesco Corti
 
Emil Eifrem at GraphSummit Copenhagen 2024 - The Art of the Possible.pptx
Emil Eifrem at GraphSummit Copenhagen 2024 - The Art of the Possible.pptxEmil Eifrem at GraphSummit Copenhagen 2024 - The Art of the Possible.pptx
Emil Eifrem at GraphSummit Copenhagen 2024 - The Art of the Possible.pptxNeo4j
 
From the origin to the future of Open Source model and business
From the origin to the future of  Open Source model and businessFrom the origin to the future of  Open Source model and business
From the origin to the future of Open Source model and businessFrancesco Corti
 
GraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptx
GraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptxGraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptx
GraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptxNeo4j
 
2024.03.12 Cost drivers of cultivated meat production.pdf
2024.03.12 Cost drivers of cultivated meat production.pdf2024.03.12 Cost drivers of cultivated meat production.pdf
2024.03.12 Cost drivers of cultivated meat production.pdfThe Good Food Institute
 
Technical SEO for Improved Accessibility WTS FEST
Technical SEO for Improved Accessibility  WTS FESTTechnical SEO for Improved Accessibility  WTS FEST
Technical SEO for Improved Accessibility WTS FESTBillieHyde
 
Key Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdfKey Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
 
IT Service Management (ITSM) Best Practices for Advanced Computing
IT Service Management (ITSM) Best Practices for Advanced ComputingIT Service Management (ITSM) Best Practices for Advanced Computing
IT Service Management (ITSM) Best Practices for Advanced ComputingMAGNIntelligence
 
LF Energy Webinar - Unveiling OpenEEMeter 4.0
LF Energy Webinar - Unveiling OpenEEMeter 4.0LF Energy Webinar - Unveiling OpenEEMeter 4.0
LF Energy Webinar - Unveiling OpenEEMeter 4.0DanBrown980551
 
UiPath Studio Web workshop Series - Day 3
UiPath Studio Web workshop Series - Day 3UiPath Studio Web workshop Series - Day 3
UiPath Studio Web workshop Series - Day 3DianaGray10
 
Q4 2023 Quarterly Investor Presentation - FINAL - v1.pdf
Q4 2023 Quarterly Investor Presentation - FINAL - v1.pdfQ4 2023 Quarterly Investor Presentation - FINAL - v1.pdf
Q4 2023 Quarterly Investor Presentation - FINAL - v1.pdfTejal81
 
TrustArc Webinar - How to Live in a Post Third-Party Cookie World
TrustArc Webinar - How to Live in a Post Third-Party Cookie WorldTrustArc Webinar - How to Live in a Post Third-Party Cookie World
TrustArc Webinar - How to Live in a Post Third-Party Cookie WorldTrustArc
 
Webinar: The Art of Prioritizing Your Product Roadmap by AWS Sr PM - Tech
Webinar: The Art of Prioritizing Your Product Roadmap by AWS Sr PM - TechWebinar: The Art of Prioritizing Your Product Roadmap by AWS Sr PM - Tech
Webinar: The Art of Prioritizing Your Product Roadmap by AWS Sr PM - TechProduct School
 
Novo Nordisk's journey in developing an open-source application on Neo4j
Novo Nordisk's journey in developing an open-source application on Neo4jNovo Nordisk's journey in developing an open-source application on Neo4j
Novo Nordisk's journey in developing an open-source application on Neo4jNeo4j
 
My key hands-on projects in Quantum, and QAI
My key hands-on projects in Quantum, and QAIMy key hands-on projects in Quantum, and QAI
My key hands-on projects in Quantum, and QAIVijayananda Mohire
 
Graphene Quantum Dots-Based Composites for Biomedical Applications
Graphene Quantum Dots-Based Composites for  Biomedical ApplicationsGraphene Quantum Dots-Based Composites for  Biomedical Applications
Graphene Quantum Dots-Based Composites for Biomedical Applicationsnooralam814309
 
.NET 8 ChatBot with Azure OpenAI Services.pptx
.NET 8 ChatBot with Azure OpenAI Services.pptx.NET 8 ChatBot with Azure OpenAI Services.pptx
.NET 8 ChatBot with Azure OpenAI Services.pptxHansamali Gamage
 

Recently uploaded (20)

Flow Control | Block Size | ST Min | First Frame
Flow Control | Block Size | ST Min | First FrameFlow Control | Block Size | ST Min | First Frame
Flow Control | Block Size | ST Min | First Frame
 
Explore the UiPath Community and ways you can benefit on your journey to auto...
Explore the UiPath Community and ways you can benefit on your journey to auto...Explore the UiPath Community and ways you can benefit on your journey to auto...
Explore the UiPath Community and ways you can benefit on your journey to auto...
 
UiPath Studio Web workshop series - Day 2
UiPath Studio Web workshop series - Day 2UiPath Studio Web workshop series - Day 2
UiPath Studio Web workshop series - Day 2
 
Where developers are challenged, what developers want and where DevEx is going
Where developers are challenged, what developers want and where DevEx is goingWhere developers are challenged, what developers want and where DevEx is going
Where developers are challenged, what developers want and where DevEx is going
 
Emil Eifrem at GraphSummit Copenhagen 2024 - The Art of the Possible.pptx
Emil Eifrem at GraphSummit Copenhagen 2024 - The Art of the Possible.pptxEmil Eifrem at GraphSummit Copenhagen 2024 - The Art of the Possible.pptx
Emil Eifrem at GraphSummit Copenhagen 2024 - The Art of the Possible.pptx
 
From the origin to the future of Open Source model and business
From the origin to the future of  Open Source model and businessFrom the origin to the future of  Open Source model and business
From the origin to the future of Open Source model and business
 
GraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptx
GraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptxGraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptx
GraphSummit Copenhagen 2024 - Neo4j Vision and Roadmap.pptx
 
2024.03.12 Cost drivers of cultivated meat production.pdf
2024.03.12 Cost drivers of cultivated meat production.pdf2024.03.12 Cost drivers of cultivated meat production.pdf
2024.03.12 Cost drivers of cultivated meat production.pdf
 
Technical SEO for Improved Accessibility WTS FEST
Technical SEO for Improved Accessibility  WTS FESTTechnical SEO for Improved Accessibility  WTS FEST
Technical SEO for Improved Accessibility WTS FEST
 
Key Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdfKey Trends Shaping the Future of Infrastructure.pdf
Key Trends Shaping the Future of Infrastructure.pdf
 
IT Service Management (ITSM) Best Practices for Advanced Computing
IT Service Management (ITSM) Best Practices for Advanced ComputingIT Service Management (ITSM) Best Practices for Advanced Computing
IT Service Management (ITSM) Best Practices for Advanced Computing
 
LF Energy Webinar - Unveiling OpenEEMeter 4.0
LF Energy Webinar - Unveiling OpenEEMeter 4.0LF Energy Webinar - Unveiling OpenEEMeter 4.0
LF Energy Webinar - Unveiling OpenEEMeter 4.0
 
UiPath Studio Web workshop Series - Day 3
UiPath Studio Web workshop Series - Day 3UiPath Studio Web workshop Series - Day 3
UiPath Studio Web workshop Series - Day 3
 
Q4 2023 Quarterly Investor Presentation - FINAL - v1.pdf
Q4 2023 Quarterly Investor Presentation - FINAL - v1.pdfQ4 2023 Quarterly Investor Presentation - FINAL - v1.pdf
Q4 2023 Quarterly Investor Presentation - FINAL - v1.pdf
 
TrustArc Webinar - How to Live in a Post Third-Party Cookie World
TrustArc Webinar - How to Live in a Post Third-Party Cookie WorldTrustArc Webinar - How to Live in a Post Third-Party Cookie World
TrustArc Webinar - How to Live in a Post Third-Party Cookie World
 
Webinar: The Art of Prioritizing Your Product Roadmap by AWS Sr PM - Tech
Webinar: The Art of Prioritizing Your Product Roadmap by AWS Sr PM - TechWebinar: The Art of Prioritizing Your Product Roadmap by AWS Sr PM - Tech
Webinar: The Art of Prioritizing Your Product Roadmap by AWS Sr PM - Tech
 
Novo Nordisk's journey in developing an open-source application on Neo4j
Novo Nordisk's journey in developing an open-source application on Neo4jNovo Nordisk's journey in developing an open-source application on Neo4j
Novo Nordisk's journey in developing an open-source application on Neo4j
 
My key hands-on projects in Quantum, and QAI
My key hands-on projects in Quantum, and QAIMy key hands-on projects in Quantum, and QAI
My key hands-on projects in Quantum, and QAI
 
Graphene Quantum Dots-Based Composites for Biomedical Applications
Graphene Quantum Dots-Based Composites for  Biomedical ApplicationsGraphene Quantum Dots-Based Composites for  Biomedical Applications
Graphene Quantum Dots-Based Composites for Biomedical Applications
 
.NET 8 ChatBot with Azure OpenAI Services.pptx
.NET 8 ChatBot with Azure OpenAI Services.pptx.NET 8 ChatBot with Azure OpenAI Services.pptx
.NET 8 ChatBot with Azure OpenAI Services.pptx
 

Adaptive non-linear-filtering-technique-for-image-restoration

  • 1. World Academy of Science, Engineering and Technology International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010 Adaptive Non-linear Filtering Technique for Image Restoration International Science Index 44, 2010 waset.org/publications/15180 S. K. Satpathy, S. Panda, K. K. Nagwanshi, S. K. Nayak and C. Ardil Abstract—Removing noise from the any processed images is very important. Noise should be removed in such a way that important information of image should be preserved. A decisionbased nonlinear algorithm for elimination of band lines, drop lines, mark, band lost and impulses in images is presented in this paper. The algorithm performs two simultaneous operations, namely, detection of corrupted pixels and evaluation of new pixels for replacing the corrupted pixels. Removal of these artifacts is achieved without damaging edges and details. However, the restricted window size renders median operation less effective whenever noise is excessive in that case the proposed algorithm automatically switches to mean filtering. The performance of the algorithm is analyzed in terms of Mean Square Error [MSE], Peak-Signal-to-Noise Ratio [PSNR], Signal-to-Noise Ratio Improved [SNRI], Percentage Of Noise Attenuated [PONA], and Percentage Of Spoiled Pixels [POSP]. This is compared with standard algorithms already in use and improved performance of the proposed algorithm is presented. The advantage of the proposed algorithm is that a single algorithm can replace several independent algorithms which are required for removal of different artifacts. Keywords—Filtering, Decision Based Algorithm, noise, image restoration. T I. INTRODUCTION HE idea of image restoration is to balance for or unwrap defects which corrupts an image. Degradation comes in many forms such as motion blur, noise, and camera misfocus. In cases like motion blur, it is possible to come up with a very good estimate of the actual blurring function and undo the blur to restore the original image. In cases where the image is corrupted by noise, the best we may hope is to compensate for the degradation it caused. In this paper, it will introduce and implement several of the methods used in the image processing world to restore images. There are two different domains under which one can go for image restoration: (i) S.K. Satpathy is with the Department of Computer Science & Engineering, Rungta College of Engineering & Technology, Bhilai CG 490023 India (Phone: 922-935-5518; fax: 788-228-6480; e-mail: sks_sarita@yahoo.com). S. Panda is with the National Institute of Science and Technology (NIST) Berhampur, OR 760007 India (e-mail: panda_siddhartha@rediffmail.com). K.K. Nagwanshi is with the Department of Computer Science & Engineering, Rungta College of Engineering & Technology, Bhilai CG 490023 India (e-mail: kapilkn@gmail.com). S.K. Nayak is with Department of ECE, Aditya Institute of Technology, Tekkali, Srikakulam Dt. AP. 532201(e-mail:sknayakbu@rediffmail.com) C. Ardil is with National Academy of Aviation, AZ1045, Baku, Azerbaijan, Bina, 25th km, NAA (e-mail: cemalardil@gmail.com) Spatial Domain and (ii) Frequency Domain. This paper is fully concentrated on frequency domain method. It will discuss some existing methods along with proposed approach. It is well known that linear filters are not quite effective in the presence of non-Gaussian noise. In the last decade, it has been shown that nonlinear digital filters can overcome some of the limitations of linear digital filters [1]. Median filters are a class of nonlinear filters and have produced good results where linear filters generally fail [2]. Median filters are known to remove impulse noise and preserve edges. There are a wide variety of median filters in the literature. In remote sensing, artifacts such as strip lines, drop lines, blotches, band missing occur along with impulse noise. Standard median filters reported in the literature do not address these artifacts. Strip lines are caused by unequal responses of elements of a detector array to the same amount of incoming electromagnetic energy [3]. This phenomenon causes heterogeneity in overall brightness of adjacent lines. Drop line [3] occurs when a detector does not work properly for a short period. Impulse noise appears when disturbing microwave energies are present or the sensor/detector is degraded. Band missing [3] is a serious problem and is caused by corruption of two or more drop/strip lines continuously. For removal of these artifacts, generally separate methods are employed. Strip lines and drop lines are considered as line scratches by Silva and Corte-Real [4] for image sequences. According to him, a positive type film suffers from bright scratches and negative film suffers from dark scratches. Milady has considered only the dark scratches; if bright scratches exist he inverted them and used the same algorithm. Silva and Corte-Real [4] gives a solution for removing the blotches and line scratches in images. He has considered only vertical lines (which are narrow) and the blotches as impulsive with constant intensity having irregular shapes. Kokaram [5] has given a method for removal of scratches and restoration of missing data in the image sequences based on temporal filtering. Additionally, impulse noise is a standard type of degradation in remotely sensed images. This paper considers application of medianbased algorithms for removal of impulses, strip lines, drop lines, band missing, and blotches while preserving edges. It has been shown recently that an adaptive length algorithm provides a better solution for removal of impulse noise with better edge and fine detail preservation. Several adaptive algorithms [6–9] are available for removal of impulse noises. However, none of these algorithms addressed the problem of strip lines, drop lines, blotches, and band missing in images. 10
  • 2. International Science Index 44, 2010 waset.org/publications/15180 World Academy of Science, Engineering and Technology International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010 The objective of this paper is to propose an adaptive length median/mean algorithm that can simultaneously remove impulses, strip lines, drop lines, band missing, and blotches while preserving edges. The advantage of the proposed algorithm is that a single algorithm with improved performance can replace several independent algorithms required for removal of different artifacts. Blotches are impulsive-type degradations randomly distributed with irregular shapes of approximately constant intensity. These artifacts last for one frame. In the degraded regions, there is no correlation between successive frames. Blotches are originated by dust, warping of the substrate or emulsion, mould, dirt, or other unknown causes. Blotches in film sequences can be either bright or dark spots. If the blotch is formed on the positive print of the film, then the result will be a bright spot, however if it is formed on the negative print, then in the positive copy, we will see a dark spot. The paper has been organized in the following manner; section II describes image noise model, section III proposes problem formulation and solution methodology, proposed algorithm is illustrated in section IV, followed by section V which gives implementation details subsequently section VI describes the result and discussion, section VII gives concluding remarks and further works and finally section VIII incorporates all the references been made for completion of this work. II. IMAGE NOISE MODEL An image usually contains departures from the ideal signal that would be produced by general model of the signal production process. Such departures are referred to as noise. Noise arises as a result of un-modeled processes available on in the production and capture of the actual signal. It is not part of the ideal signal and may be caused by a wide range of sources, e.g. variations 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 noise (e.g. surface reflectance textures). The characteristics of noise depend on its source, as does the operator which best reduces its effects. Many image processing tools deal with contain 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. Noise can generally be grouped into two classes: (i) independent noise, and (ii) noise which is dependent on the image data. Image independent noise can often be described by an additive noise model, where the traced image f(x,y) is the sum of the original image s(x,y) and the noise n(x,y): i.e. f(x,y)=s(x,y)+n(x,y). In several cases, additive noise is equally distributed over the frequency domain (i.e. white noise), while an image contains generally low frequency information. Hence, the noise is dominant for high frequencies and its effects can be reduced using some kind of low-pass filter. This can be done either with a frequency filter or with a spatial filter. (Often a spatial filter is preferable, as it is computationally less expensive than a frequency filter.) In the second case of datadependent noise (e.g. arising when monochromatic radiation is scattered from a surface whose roughness is of the order of a wavelength, causing wave interference which results in image speckle), it is possible to model noise with a multiplicative, or non-linear model. These models are mathematically more complicated. Hence, the noise can be assumed as data independent. Detector Noise is a kind of noise which occurs in all traced images to a certain extent is detector noise. This kind of noise is due to the discrete nature of radiation, i.e. the fact that each imaging system is recording an image by counting photons. Allowing some assumptions (which are valid for many applications) this noise can be modeled with an independent, additive model, where the noise n(x,y) has a zero-mean Gaussian distribution described by its standard deviation (σ), or variance. (The 1-D Gaussian distribution has the form shown in Figure 1.) This means that each pixel in the noisy image is the sum of the true pixel value and a random, Gaussian distributed noise value. Salt and Pepper Noise is another common form of noise is data drop-out noise (commonly referred to as intensity spikes, speckle). Here, the noise causes errors in the data transmission. The corrupted pixels are either set to the maximum value (which looks like snow in the image) or have single bits flipped over. In some cases, single pixels are set alternatively to zero or to the maximum value, giving the image a salt and pepper like appearance. Unaffected pixels always remain unchanged. The noise is usually quantified by the percentage of pixels which are corrupted. Fig. 1 1-D Gaussian distribution (mean=0 standard deviation=1) The block diagram (fig. 2) for general degradation model is where f(x,y) is the corrupted image obtained by passing the original image s(x,y) through a low pass filter (blurring function) b(x,y) and adding noise n(x,y) to it. It is difficult to propose a general mathematical model for the effect of the abrasion of the film causing the scratches due to the high number of variables that are involved in the process. However, it is possible to make some physical and geometrical considerations regarding the brightness, thickness, 11
  • 3. World Academy of Science, Engineering and Technology International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010 n(x,y) Lowpass Filter b s(x,y) f(x,y) Fig 2 A general degradation model International Science Index 44, 2010 waset.org/publications/15180 and vertical extent of the line. Line scratches can be characterized as follows: (i) they present a considerable higher or lower luminance than their neighborhoods; (ii) they tend to extend over most of the vertical length of the image frame and are not curved; and (iii) they are quite narrow, with widths no larger than 10  pixels for video images. These features can be used to define a model. The degraded image model considered is a(x,y)=I(x,y)(1-b(x,y))+b(x,y)c(x,y), (1) where I(x,y) is the pixel intensity of the uncorrupted signal, b(x,y) is a detection variable which is set to 1 whenever pixels are corrupted and 0 otherwise, c(x,y) is the observed intensity in the corrupted region. This model is applied in this work to images degraded by impulses, strip lines, drop lines, band missing, and blotches. If b(x,y)=0 then a(x,y)=I(x,y)(1-0)+0.c(x,y)=I(x,y), (2) where I(x,y) is the original pixel value (uncorrupted pixel). If b(x,y)=0 then a(x,y)=I(x,y)(1-1)+1.c(x,y)=c(x,y), (3) where c(x,y) is the original pixel value (uncorrupted pixel). Assume that each pixel at (x,y) is corrupted by an impulse with probability p independent of whether other pixels are corrupted or not. For images corrupted by a negative or positive impulse, the impulse corrupted pixel e(x,y) takes on the minimum pixel value smin with probability p, or s(x,y) the maximum pixel value smax with probability 1-p. The image corrupted by blotches or scratches (impulsive) can be now modeled as sorting in images [10]. General median filters often exhibit blurring for large window sizes, or insufficient noise suppression for small window sizes. Adaptive length median filter overcomes these limitations of general median filters. Lin and Willson [6] proposed an adaptive window length median filter algorithm which can achieve a high degree of noise suppression and still preserve image sharpness; however, the algorithm performs poorly for mixed impulse noise consisting of positive and negative impulses. Lin’s algorithm is modified by Hwang and Haddad [7]. Huang’s algorithm takes into account both positive and negative impulses for simultaneous removal; but it acts poorly on the strip lines, drop lines, and blotches. Unlike these adaptive algorithms based on edge detection [6,7], the proposed algorithm is based on artifacts detection. The positive and negative impulses are removed separately. In contrast to general adaptive length median filters, the window size is restricted to a maximum of to minimize blurring. Restriction of window size renders the median operation less effective whenever noise is excessive (the output of the median filter may turn out to be a noisy pixel). In this situation, the algorithm switches to compute the average of uncorrupted pixels in the window (the probability of getting the noisy pixel as filtered output is lower because the averaging takes only uncorrupted pixels into account). The proposed algorithm removes the strip lines, drop lines, blotches along with impulses even at higher noise densities. Image enhancement in the frequency domain is straightforward. We simply compute the Fourier transform of the image to be enhanced, multiply the result by a filter (rather than convolve in the spatial domain), and take the inverse transform to produce the enhanced image. The idea of blurring an image by reducing its high frequency components or sharpening an image by increasing the magnitude of its high frequency components is intuitively easy to understand. However, computationally, it is often more efficient to implement these operations as convolutions by small spatial filters in the spatial domain. Understanding frequency domain concepts is important, and leads to enhancement techniques that might not have been thought of by restricting attention to the spatial domain. III. PROBLEM FORMULATION AND SOLUTION METHODOLOGY A. Filtering Low pass filtering involves the elimination of the high frequency components in the image. It results in blurring of the image (and thus a reduction in sharp transitions associated with noise). An ideal low pass filter would retain all the low frequency components, and eliminate all the high frequency components. However, ideal filters suffer from two problems: blurring and ringing. These problems are caused by the shape of the associated spatial domain filter, which has a large number of undulations. Smoother transitions in the frequency domain filter, such as the Butterworth filter, achieve much better results. Median filter is a nonlinear filter, which preserves edges while effectively removing impulse noise. Median operations are performed by row sorting, column sorting, and diagonal B. Homomorphic filtering Images normally consist of light reflected from objects. The basic nature of the image G(x,y) may be characterized by two c(x,y)=e(x,y) with p s(x,y) with 1-p (4) This, in fact, is the model that describes impulse noise in the literature. However, the existing impulse filtering algorithms do not effectively remove blotches and scratches. In Section 3, an adaptive length median/mean filter algorithm is developed that removes blotches, scratches effectively along with impulse noise. 12
  • 4. World Academy of Science, Engineering and Technology International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010 components: (1) the amount of source light incident on the scene being viewed, and (2) the amount of light reflected by the objects in the scene. These portions of light are called the illumination and reflectance components, and are denoted By letting i'(x,y)= G-1(H(ω,υ)*I(ω,υ)) and r’(x,y)=G-1(H(ω,υ)*R(ω,υ)) we get s(x,y) = i'(x,y) + r'(x,y). (a) (b) International Science Index 44, 2010 waset.org/publications/15180 Fig. 3 Transfer function for an ideal low pass filter (a) Frequency domain components (b) spatial domain components. i(x,y) and r(x,y) respectively. The functions i and r combine multiplicatively to give the image function f(x,y) = i(x,y)*r(x,y), Where 0< i(x,y) <∞ and 0 < r(x,y) < 1. We cannot easily use the above product to operate separately on the frequency components of illumination and reflection because the Fourier transform of the product of two functions is not separable; that is G(f(x,y))≠G(i(x,y))*G(r(x,y)) Suppose, however, that we define z(x,y)is equal to ln f(x,y ) or we may also say that it is equal to ln i(x,y) + ln r(x,y) Then G(z(x,y))=G(ln f(x,y)) one can describe it as sum of G(ln i(x,y) and ln r(x,y)) or Z(ω,υ)=I(ω,υ)+R(ω,υ), (5) (8) Finally, as z was obtained by taking the logarithm of the original image G, the inverse yields the desired enhanced image Ĝ that is Ĝ(x,y)=exp[s(x,y)] = exp[i’(x,y)]*exp[r’(x,y)] =i0(x,y*)r0(x,y) (9) Thus, the process of homomorphic filtering can be summarized by the following diagram: where Z, I and R are the Fourier transforms of z, ln i and ln r respectively. The function Z represents the Fourier transform of the sum of two images: a low frequency illumination image and a high frequency reflectance image. Fig. 5 The process of homomorphic filtering IV. PROPOSED ALGORITHM Fig. 4 Transfer function for homomorphic filtering. If we now apply a filter with a transfer function that suppresses low frequency components and enhances high frequency components, then we can suppress the illumination component and enhance the reflectance component. Thus S(ω,υ)=H(ω,υ)*Z(ω,υ) = H(ω,υ)*I(ω,υ)+H(ω,υ)*R(ω,υ) The algorithm consists of two operations: first is the detection of degraded pixels, and the second operation is the replacement of faulty pixels with the estimated values. Let the pixel be represented as P(i,j) and the number of corrupted pixels in the window W(i,j) be n Let Pmax=255 and Pmin=0 be the corrupted pixel values and P(i,j) ≠0 or 255 represent uncorrupted pixels. Case 1: Consider window size 3X3 with typical values of pixels shown as an array below. If P(i,j) ≠ 0 or 255 , then the pixels are unaltered. For the array shown, there are no corrupted pixels in the array; therefore, the pixels are unaltered.(10) (6) 111 s(x,y)=G (S(ω,υ)) =G-1(H(ω,υ)*I(ω,υ))+G-1(H(ω,υ)*R(ω,υ)) (7) 106 167 214 123 -1 214 236 where S is the Fourier transform of the result. In the spatial domain 223 83 (10) Case 2: If the number of corrupted pixels n in the window W(i,j) ≤ 4, that is, n≤4, then two- dimensional window of size 3X3 is selected and median operation is performed by 13
  • 5. World Academy of Science, Engineering and Technology International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010 column sorting, row sorting, and diagonal sorting. The corrupted P(i,j) is replaced by the median value. (11) Row sorting Corrupted matrix 255 214 123 123 214 255 0 255 214 0 214 255 123 234 0 0 123 234 ↓Column sorting (11) Diagonal sorting↓ 0 123 234 0 123 0 214 255 0 214 123 255 123 214 255 234 214 255 To assess the performance of the proposed filters for removal of impulse noise and to evaluate their comparative performance, different standard performance indices have been used in the thesis. These are defined as follows: Peak Signal to Noise Ratio (PSNR): It is measured in decibel (dB) and for gray scale image it is defined as: Corrupted matrix Row sorting 123 0 156 255 234 0 123 156 234 255 255 0 214 97 0 0 0 97 214 255 0 234 255 133 191 0 131 191 234 255 199 International Science Index 44, 2010 waset.org/publications/15180 (ii) If all the pixels in 3X3 windows are corrupted (a typical case is shown as an array below), then perform 5X5 median filtering. On median filtering, the output may happen to be noise pixels as in Case 4. Find the average of uncorrupted pixels in the window and replace the corrupted value by the average value. 255 234 255 0 0 199 234 255 255 255 167 210 198 178 167 178 198 210 255 (12) Column sorting ↓ Diagonal sorting 0 0 156 97 0 0 0 98 210 167 123 0 210 133 0 0 123 156 178 255 199 167 214 198 178 0 133 191 234 255 255 234 234 255 234 0 214 198 234 255 255 255 255 255 255 255 199 234 255 255 Case 3: If the number of corrupted pixels n in the window W(i,j) is between 5 and 12, that is, 5≤n≤12 , then perform 5X5 median filtering and replace the corrupted values by the median value. Case 4: (i) If the number of corrupted pixels n in the window W(i,j) is greater than 13, (a typical case is shown as an array below) increasing the window size may lead to blurring; choose 3X3 median filtering. On median filtering with smaller window sizes, the output may happen to be noise pixels whenever the noise is excessive. In this case, find the average of uncorrupted pixels in the window and replace the corrupted value by the average value. The average of the pixel value in the window is taken instead of median value, if the number of uncorrupted pixels in the window is even (it is convenient to define median for odd number of pixels). (133 and 123 are the uncorrupted 255 123 255 255 255 i, j 0 0 255 0 255 255 123 255 0 SNRI (dB) = SNR of restored image in dB- SNR of noisy image in dB (15) Where, SNR of restored image dB= 10 log 0 255 255 133 145 255 123 ⎡ ⎢ 10 log 10 ⎢ ⎢∑ ⎣ i 0 255 0 255 255 128 167 0 198 178 0 i ∑ (S 2 i, j j i, j ) 2 ˆ − S i, j j ⎤ ⎥ ⎥ ⎥ ⎥ ⎦ (16) ∑∑S ∑ (S − X ) 2 i, j i j 2 i, j j i, j ⎤ ⎥ ⎥ ⎥ ⎦ (17) The higher value of SNRI reflects the better visual and restoration performance. Percentage of Spoiled Pixels (POSP): It may be defined as the number of unaffected original pixels replaced with a different gray value after filtering i.e. 133 255 ∑∑S Where, Xi,j is Noisy image pixel 255 199 10 ⎡ ⎢ ⎢ ⎢∑ ⎢ i ⎣ SNR of Noisy image in dB = (13) ↓ i, j Signal to Noise Ratio Improvement (SNRI): SNRI in dB is defined as the difference between the Signal to Noise Ratio (SNR) of the restored image in dB and SNR of restored image in dB i.e. 0 123 ) respectively. The higher the PSNR in the restored image, the better is its quality. 133 0 ( 255 pixels) ⎡ ⎤ 255 2 ⎢ ∑∑ ⎥ i j (14) PSNR (dB) = 10 log10 ⎢ ⎥ ˆ 2 ⎢ ∑∑ S i , j − S i , j ⎥ ⎢ i j ⎥ ⎣ ⎦ ˆ Where S and S are the original and restored image pixels 255 0 (133+123)/2=128 14
  • 6. World Academy of Science, Engineering and Technology International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010 POSP = ⎡ Number of original pixels change their grayscale ⎤ (18) ⎢ ⎥ × 100 Number of non - noisy pixels ⎣ ⎦ Percentage of Noise Attenuated (PONA): It may be defined as the number of pixels getting improved after being filtered. PONA = ⎡ Number of noisy pixels getting improved ⎤ ⎢ ⎥ × 100 (19) Total number of noisy pixels ⎣ ⎦ International Science Index 44, 2010 waset.org/publications/15180 This parameter reflects the capability of the impulse noise detector used prior to filtering. Small value of POSP shows the improved performance of the detector. High value of POSP leads to removal of original image properties and. edge jitters in restored images. The more the percentage the better will be the attenuation characteristic of the filter filtering. The proposed algorithm NDB_RESTORE will act accordingly. Algorithm: NDB_RESTORE Take 3X3 windows size for image. Calculate the number of corrupted pixels in the windows. repeat { if(n=0) pixels are unaltered. else if(n≤4) perform 3X3 median filtering. else if(5<n≤12) perform 5X5 median filtering. else if(n≥4) { perform 3X3 median filtering. sequences. Motion estimation and compensation techniques [11] are employed for tracking scratches on frames. Prediction and interpolation are used to estimate motion vectors for video de-noising. For fast motion prediction, commonly used technique is Block Matching (BM) motion estimator. The motion vector is obtained by minimizing a cost function measuring the mismatch between a block and each predictor candidate. The Motion Estimation (ME) gives motion vector of each pixel or block of pixels which is an essential tool for determining motion trajectories. Due to motion of objects in scene (i.e., corresponding regions in an image sequence), the same region does not occur in the same place in the previous frame as in current one. ARPS [11] algorithm makes use of the fact that the general motion in a frame is usually coherent, that is, if the macro blocks around the current macro block moved in a particular direction, then there is a high probability that the current macro block will also have a similar motion vector. ARPS algorithm uses the motion vector of the macro block to its immediate left to predict its own motion vector. The rood pattern search directly puts the search in an area where there is a high probability of finding a good matching block. The point that has the least weight becomes the origin for subsequent search steps, and the search pattern is changed to Small Diamond Search Pattern (SDSP). SDSP is repeated until least weighted point is found to be at the center of the SDSP. The main advantage of this algorithm over diamond search (DS) is that if the predicted motion vector is (0, 0), it does not waste computational time in carrying out Large Diamond Search Pattern (LDSP); it rather directly starts using SDSP. The temporal median filter smoothes out sharp transitions in intensity at each pixel position; it not only de-noises the whole frame and removes blotches but also helps in stabilizing the illuminating fluctuations. Temporal median filtering removes the temporal noise in the form of small dots and streaks found in some videos. In this approach, dirt is viewed as a temporal impulse (single-frame incident) and hence treated by interframe processing by taking into account at least three consecutive frames. if all the pixels in 3X3 windows is corrupted assume 5X5 windows size. else Replace the processed pixel by average of uncorrupted pixel. } until next window. Stop. V. IMPLEMENTATION The proposed adaptive median/mean algorithm is applied to video sequences degraded by scratches, blotches, and impulses. Adaptive rood pattern search block matching algorithm [11] is used for motion estimation of the image VI. RESULTS The algorithm is tested with different types of degradations, namely, strip lines, drop lines, band missing, blotches, and impulse noise. The results are compared with those of general median filter, Lin’s adaptive length median filter, Gonzalez adaptive length median filter and decision-based median filter. The median filter and Lin’s algorithm cause blur in the images and do not remove the degradations (Figures 6(c) and 6(d)). The Gonzalez adaptive algorithm removes the strip lines and drop lines but the edges are not preserved properly (Figures 6(d) and 7(d)) and this algorithm acts very poorly on the blotches and band noises. The proposed algorithm removes all these degradations more effectively with reduced blurring and edge preservation. The results of the removal of noise at different densities along with degradations. 15
  • 7. World Academy of Science, Engineering and Technology International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010 (a) (b) (e) (f) TABLE I PSNR OF LENA AND GOLDHILL IMAGE CORRUPTED BY 20% OF IMPULSE NOISE AND THE PROPOSED ALGORITHM CORRUPTED BY 20% NOISE + DEGRADATIONS. Filter (c) (d) Lena Goldhill SMF 31.42 29.60 30.39 29.87 DBMF [13] 35.12 33.31 TSMF [14] International Science Index 44, 2010 waset.org/publications/15180 CWMF [12] 31.84 31.53 ACWMF [8] 36.54 34.42 PF (noise + degradations) 35.15 35.05 VII. CONCLUSION (e) (f) Fig. 6: Drop lines removal. (a) Original image. (b) Corrupted by drop lines. (c) Median filtered image. (d) Lin’s adaptive length filter. (e) Gonzalez adaptive length filter. (f) Proposed algorithm. (a) (b) An adaptive length median/mean algorithm for removal of drops lines, strip lines, white bands, black bands, blotches, and impulses with minimum of blurring is developed. The performance is evaluated in terms of PSNR. The performance is compared with Lin’s adaptive median filter, Gonzalez adaptive median filter, weighted median filter, decision-based median filter and adaptive center weighted median filter. The results show that the algorithm is more effective in the removal of drop lines, strip lines, white bands, black bands, and blotches along with impulse noise varying upto 70%. The advantage of the proposed algorithm is that a single algorithm with improved performance can replace several independent algorithms required for removal of different artifacts. Application of the proposed algorithm to black and color video sequences is also illustrated. ACKNOWLEDGMENT The authors wish thanks to Dr. A. Jagadeesh, Director, RCET-Bhilai for his kind support. We would also especially grateful to Mr. Saurabh Rungta for providing necessary facilities to incorporate this research work. REFERENCES (c) (d) [1] [2] Fig. 7: Strip lines removal. (a) Original Image. (b) Corrupted by strip lines. (c) Median filtered image. (d) Lin’s adaptive length filter. (e) Gonzalez adaptive length filter. (f) Proposed algorithm.. [3] 16 J. Astola and P. Kuosmanen, Fundamentals of Nonlinear Digital Filtering, CRC Press, New York, NY, USA, 1977. I. Pitas and A. N. Venetsanopoulos, Nonlinear Digital Filters: Principles and Applications, Kluwer Academic Publishers, Boston, Mass, USA, 1990. S. M. Shahrokhy, “Visual and statistical quality assessment and improvement of remotely sensed images,” in Proceedings of the 20th Congress of the International Society for Photogrammetry and Remote Sensing (ISPRS '04), pp. 1–5, Istanbul, Turkey, July 2004.
  • 8. World Academy of Science, Engineering and Technology International Journal of Computer, Information Science and Engineering Vol:4 No:8, 2010 [4] [5] [6] [7] [8] [9] [10] [11] International Science Index 44, 2010 waset.org/publications/15180 [12] [13] [14] [15] A. U. Silva and L. Corte-Real, “Removal of blotches and line scratches from film and video sequences using a digital restoration chain,” in Proceedings of the IEEE-EURASIP Workshop on Nonlinear Signal and Image Processing (NSIP '99), pp. 826–829, Antalya, Turkey, June 1999. A. Kokaram, “Detection and removal of line scratches in degraded motion picture sequences,” in Proceedings of the 8th European Signal Processing Conference (EUSIPCO '96), vol. 1, pp. 5–8, Trieste, Italy, September 1996. H.-M. Lin and A. N. Willson, Jr., “Median filters with adaptive length,” IEEE Transactions on Circuits and Systems, vol. 35, no. 6, pp. 675–690, 1988. H. Hwang and R. A. Haddad, “Adaptive median filters: new algorithms and results,” Transactions on Image Processing, vol. 4, no. 4, pp. 499– 502, 1995. T. Chen and H. R. Wu, “Adaptive impulse detection using centerweighted median filters,” IEEE Signal Processing Letters, vol. 8, no. 1, pp. 1–3, 2001. W. Luo, “An efficient detail-preserving approach for removing impulse noise in images,” IEEE Signal Processing Letters, vol. 13, no. 7, pp. 413–416, 2006. K. S. Srinivasan and D. Ebenezer, “A new fast and efficient decisionbased algorithm for removal of high-density impulse noises,” IEEE Signal Processing Letters, vol. 14, no. 3, pp. 189–192, 2007. Y. Nie and K.-K. Ma, “Adaptive rood pattern search for fast blockmatching motion estimation,” IEEE Transactions on Image Processing, vol. 11, no. 12, pp. 1442–1449, 2002. S.-J. Ko and Y. H. Lee, “Center weighted median filters and their applications to image enhancement,” IEEE Transactions on Circuits and Systems, vol. 38, no. 9, pp. 984–993, 1991. D. A. F. Florencio and R. W. Schafer, “Decision-based median filter using local signal statistics,” in Visual Communications and Image Processing '94, vol. 2308 of Proceedings of SPIE, pp. 268–275, Chicago, Ill, USA, September 1994. T. Chen, K.-K. Ma, and L.-H. Chen, “Tri-state median filter for image denoising,” IEEE Transactions on Image Processing, vol. 8, no. 12, pp. 1834–1838, 1999. 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. 1012–1025, 1996. Santanu K. Nayak is working as Professor at Aditya Institute of Technology and Management (after taking lien from Berhampur University, Orissa). He completed his M.Tech. degree from Indian Institute of Science, Bangalore in Instrumentation in the year 1990 and joined as faculty member in the Department of Electronics(Berhampur University) in the year 1991. He received his Ph.D. degree in Electronics in the year 1996 from Berhampur University. He is member of IEEE, member and life member of different national professional bodies. He has published many papers in various national, international journals and conferences. He is also reviewer of EIS (Elsevier). His present area of research includes signal processing, image processing, fuzzy logic, instrumentation and embedded systems. C. Ardil is with National Academy of Aviation, AZ1045, Baku, Azerbaijan, Bina, 25th km, NAA Susanta K. Satpathy (M’08) is working as a professor at Rungta College of Engineering and Technology,Bhilai, Chhattisgarh. He received the M. Tech degree in Computer Science and Engineering from NIT, Rourkela in 2003 and B.Tech. dgree in Computer Science and Engineering in 1995. He has published above 10 papers in various Journals and conferences. He is life time member of CSI and ISTE since 2008. He worked in various other engineering colleges for about 14 years. His area of reasearch includes Signal processing, image processing and information system and security. Sidhartha Panda is working as a Professor at National Institute of Science and Technology (NIST), Berhampur, Orissa, India. He received the Ph.D. degree from Indian Institute of Technology, Roorkee, India in 2008, M.E. degree in Power Systems Engineering from UCE, Burla in 2001 and B.E. degree in Electrical Engineering in 1991. Earlier, he worked as an Associate Professor in KIIT Deemed University and also in various other engineering colleges for about 15 years. He has published above 50 papers in various International Journals and acting as a reviewer for some IEEE and Elsevier Journals. His biography has been included in Marquis' “Who's Who in the World” USA, for 2010 edition. His areas of research include power system transient stability, power system dynamic stability, FACTS, optimization techniques, model order reduction, distributed generation, image processing and wind energy. Kapil K. Nagwanshi (M’09) was born in August 1978 in Chhindwara district, Madhya Pradesh, India. He is graduated from GG University, Bilaspur, a Central University of Chhattisgarh State, India, in Computer Science & Engineering in the year 2001 and later did his post graduation in Computer Technology & Application from Chhattisgarh Swami Vivekanand Technical University, Bhilai, India. He is life time member of International Association of Computer Science & Information Technology since 2009.Currently he is working as a Reader in RCET Bhilai, and he has published more than 28 research papers in reputed journals, national and international conferences. His research area includes, signal processing, and image processing, and information systems and security. 17