Median filter

Worked one-dimensional example

To demonstrate, using a window size of three with one entry immediately preceding and following each entry, and zero-padded boundaries, a median filter will be applied to the following simple one-dimensional signal:

x = (2, 3, 80, 6, 2, 3).

This signal has mainly small valued entries, except for one entry that is unusually high and considered to be a noise spike, and the aim is to eliminate it. So, the median filtered output signal y will be:

y₀ = med(0, 2, 3) = 2, (the boundary value is taken to be 0)

y₁ = med(2, 3, 80) = 3, (already 2, 3, and 80 are in the increasing order so no need to arrange them)

y₂ = med(3, 80, 6) = med(3, 6, 80) = 6, (3, 80, and 6 are rearranged to find the median)

y₃ = med(80, 6, 2) = med(2, 6, 80) = 6,

y₄ = med(6, 2, 3) = med(2, 3, 6) = 3,

y₅ = med(2, 3, 0) = med(0, 2, 3) = 2,

i.e.,

y = (2, 3, 6, 6, 3, 2).

It is clear that the noise spike has been essentially eliminated (and the signal has also been smoothed a bit). The result of a moving average filter with the same window width on the same dataset would be y = (1.7, 28.3, 29.7, 29.3, 3.7, 1.7). It can be seen that the noise spike has infected neighbouring elements in the moving average signal, and that the median filter has performed much better (for this type of impulse noise). Median filtering works well for both positive impulses (spikes) and negative impulses (dropouts), so long as a window can be chosen so that the number of entries infected with impulse noise is (almost) always smaller than half of the window size.

Boundary issues

When implementing a median filter, the boundaries of the signal must be handled with special care, as there are not enough entries to fill an entire window. There are several schemes that have different properties that might be preferred in particular circumstances:

• When calculating the median of a value near the boundary, missing values are filled by repeating the boundary value to obtain enough entries to fill the window.
• Avoid processing the boundaries, with or without cropping the signal or image boundary afterwards,
• Fetching entries from other places in the signal such as values from the far ends (repeating boundary conditions) or reversing the signal (reflected boundary conditions). With 2D images for example, entries from the far horizontal or vertical boundary might be selected, or repeating in reverse order the points at the same boundary
• Shrinking the window near the boundaries, so that every window is full,
• Assuming zero-padded boundaries.

Two-dimensional median filter pseudo code

Code for a simple two-dimensional median filter algorithm might look like this:

1. allocate outputPixelValue[image width][image height] 2. allocate window[window width × window height] 3. edgex := (window width / 2) rounded down 4. edgey := (window height / 2) rounded down

<b id="mwUg">for</b> <i id="mwUw">x</i> from edgex to image width - edgex <b id="mwVA">do</b> <b id="mwVQ">for</b> <i id="mwVg">y</i> from edgey to image height - edgey <b id="mwVw">do</b> i = 0 <b id="mwWA">for</b> <i id="mwWQ">fx</i> from 0 to window width <b id="mwWg">do</b> <b id="mwWw">for</b> <i id="mwXA">fy</i> from 0 to window height <b id="mwXQ">do</b> window[i] := inputPixelValue[x + fx - edgex][y + fy - edgey] i := i + 1 sort entries in window[] outputPixelValue[x][y] := window[window width * window height / 2]

This algorithm:

• Processes one color channel only,
• Takes the "not processing boundaries" approach (see above discussion about boundary issues).

Algorithm implementation issues

By far the majority of the computational effort and time is spent on calculating the median of each window. Because the filter must process every entry in the signal, for large signals such as images, the efficiency of this median calculation is a critical factor in determining how fast the algorithm can run. The naïve implementation described above sorts every entry in the window to find the median; however, since only the middle value in a list of numbers is required, selection algorithms can be much more efficient. Furthermore, some types of signals (very often the case for images) use whole number representations: in these cases, histogram medians can be far more efficient because it is simple to update the histogram from window to window, and finding the median of a histogram is not particularly onerous.

Worked two-dimensional example

The median filter operates by considering a local window (also known as a kernel) around each pixel in the image. The steps for applying the median filter are as follows:

1. Window Selection:
   • Choose a window of a specific size (e.g., 3x3, 5x5) centered around the pixel to be filtered.
   • For our example, let’s use a 3x3 window.
2. Collect Pixel Values:
   • Collect the pixel values within the window.
   • For the center pixel, we have the following values:
     • Window: $${\displaystyle \left[\begin{array}{ccc}1& 2& 3\\ 4& 8& 6\\ 7& 5& 9\end{array}\right]}$$
     • Center pixel: 8
3. Sort the Values:
   • Sort the collected pixel values in ascending order.
   • For the center pixel, the sorted values are: [1, 2, 3, 4, 5, 6, 7, 8, 9]
4. Choose the Median Value:
   • The median value is the middle value in the sorted list.
   • In our case, the median value is 5.
5. Replace the Center Pixel:
   • Replace the original center pixel value (8) with the median value (5).
6. Repeat for All Pixels:
   • Repeat steps 2-5 for all pixels in the image.

Converted Image

After applying the median filter to all pixels, the converted image becomes: $${\displaystyle \left[\begin{array}{ccc}2& 3& 3\\ 4& 5& 6\\ 7& 7& 8\end{array}\right]}$$ This filtered image effectively removes noisy pixels while preserving important features. Remember that we assumed virtual rows and columns with repeated border pixel values to handle the edge pixels.

Edge preservation properties

Median filtering is one kind of smoothing technique, as is linear Gaussian filtering. All smoothing techniques are effective at removing noise in smooth patches or smooth regions of a signal, but adversely affect edges. Often though, at the same time as reducing the noise in a signal, it is important to preserve the edges. Edges are of critical importance to the visual appearance of images, for example. For small to moderate levels of Gaussian noise, the median filter is demonstrably better than Gaussian blur at removing noise whilst preserving edges for a given, fixed window size. However, its performance is not that much better than Gaussian blur for high levels of noise, whereas, for speckle noise and salt-and-pepper noise (impulsive noise), it is particularly effective. Because of this, median filtering is very widely used in digital image processing.