Median Filter: T I About This Document ... Smooth - Sharpen Spatial Averaging (Low-Pass Filtering)

Download as pdf or txt
Download as pdf or txt
You are on page 1of 3

11/2/2017 Median Filter

t i
Next: About this document ... Up: smooth_sharpen Previous: Spatial averaging (low-pass filtering)

Median Filter
Neighborhood averaging can suppress isolated out-of-range noise, but the side effect is that it also
blurs sudden changes such as line featuress, sharp edges, and other image details all corresponding to
high spatial frequencies.

The median filter is an effective method that can, to some extent, distinguish out-of-range isolated
noise from legitmate image features such as edges and lines. Specifically, the median filter replaces a
pixel by the median, instead of the average, of all pixels in a neighborhood

where represents a neighborhood defined by the user, centered around location in the

image.

1D median filter:

Consider a 1x5 window sliding over a 1D array (either horizontal or vertical) of pixels. Assume the
five pixels currently inside the windows are:

where the middle pixel with value 200 is an isolated out-of-range and is therefore likely to be noisy.
The median of these five values can be found by sorting the values (in either ascending or descending
order). The median is 110, the value in the middle:

The original pixel value 200 is replaced by the median 110.

Question: How do you get rid of noise in the form of horizontal line across the image using 1D median
filter?

2D median filter:

The window of a 2D median filter can be of any central symmetric shape, a round disc, a square, a
rectangle, or a cross. The pixel at the center will be replaced by the median of all pixel values inside
the window.

Programming issues:
http://fourier.eng.hmc.edu/e161/lectures/smooth_sharpen/node2.html 1/3
11/2/2017 Median Filter

Sorting is necessary for finding the median of a set of values. There exit various sorting algorithm with
complexity of . However, in this case, as the number of pixels is quite limited, a simple

sorting method with complexity can be used. The code segment below sorts a 1-D array of

elements:

Example:

This figure shows the comparison of the smoothing results of a 1D signal (blue, 1st column) by an
average filter (red, 2nd column) and by a median filter (red, 3rd column) both of size five. It is clear
that the average filter always blurs edges without completely suppressing noise, while the median filter
can preserve sharp edges while completely suppressing isolated out-of-range noise, based on the size
of the feature. If its size is less than half of the filter size, indicating the pixel is likely to be an out-of-
range noise, it is replace by the median. However, if the size is greater than half of the window, large
enough to represent some legitimate feature in the image, it is preserved.

http://fourier.eng.hmc.edu/e161/lectures/smooth_sharpen/node2.html 2/3
11/2/2017 Median Filter

t i
Next: About this document ... Up: smooth_sharpen Previous: Spatial averaging (low-pass filtering)
Ruye Wang 2014-10-24

http://fourier.eng.hmc.edu/e161/lectures/smooth_sharpen/node2.html 3/3

You might also like