By Topic

Stochastic analysis for the recursive median filter process

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

2 Author(s)
Arce, G.R. ; Dept. of Electr. Eng., Delaware Univ., Newark, DE, USA ; Gallagher, N.C., Jr.

Vector probability measure functions (density function) for recursively median filtered signals are found when the underlying input binary sequences are either independent identically distributed (i.i.d.) or Markov chains. The results are parametric in the window size of the filter and in the probability distribution of the input sequence. Using statistical threshold decomposition, the same results are found for discrete alphabet random sequences that are either i.i.d. or Markov chains. Some examples illustrating the efficacy of the recursive median filter relative to the nonrecursive implementation are presented. In particular, the breakdown probabilities are tabulated for both recursive and nonrecursive median filters

Published in:

Information Theory, IEEE Transactions on  (Volume:34 ,  Issue: 4 )