Stochastic analysis for the recursive median filter process
- 1 July 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 34 (4) , 669-679
- https://doi.org/10.1109/18.9767
Abstract
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 filtersKeywords
This publication has 5 references indexed in Scilit:
- Statistical threshold decomposition for recursive and nonrecursive median filtersIEEE Transactions on Information Theory, 1986
- Median filtering by threshold decompositionIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- State description for the root-signal set of median filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- Median filters: Some modifications and their propertiesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- A theoretical analysis of the properties of median filtersIEEE Transactions on Acoustics, Speech, and Signal Processing, 1981