By Topic

Some convergence properties of median filters

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

A median filter is a nonlinear digital filter which consists of a window of length 2N + 1 that moves over a signal of finite length. For each input sample, the corresponding output point is the median of all samples in the window centered on that input sample. Any finite length, M -level, signal that ends with constant regions of length N + 1 will converge to an invariant signal in a finite number of passes of this median filter. Such an invariant signal is called a root. The concept of a root signal has proved to be crucial in understanding the properties of the median filter, root signals are to median filters what passband signals are to linear signals. In this paper, two results concerning the rate at which a signal is filtered to a root are developed. For a window of width 3, we derive a recursive formula to count the number of binary signals of length L that converge to a root in exactly m passes of a median filter. Also, we show that, given a window of width 2N + 1 , any signal of length L will converge to a root in at most 3\lceil frac{(L-2)}{2(N + 2)}\rceil passes of the filter.

Published in:

Circuits and Systems, IEEE Transactions on  (Volume:33 ,  Issue: 3 )