Stack filters are a large class of nonlinear filters that include median and ranked-order filters. Usually, these filters are analyzed in terms of their invariant signals and their convergence behavior. Convergence refers to whether iterative application of a stack filter to a signal will make it converge to an invariant signal. Previous convergence results have been deterministic results for limited classes of stack filters. In these results, the "visiting strategy" for the filter kernel as it filters a signal is arbitrary, but known a priori. Here, we use a new stochastic approach, with randomly evolving visiting strategies, that applies to all stack filters. We show that, within this framework, all stack filters make all input signals converge almost surely. A result for Boolean networks follows as a corollary.<>
Stochastic convergence of stack filters and Boolean networks
Proceedings of 1st International Conference on Image Processing ; 1 ; 800-804 vol.1
1994-01-01
413401 byte
Conference paper
Electronic Resource
English
Stochastic Convergence of Stack Filters and Boolean Networks
British Library Conference Proceedings | 1994
|Iterative Algorithms and Its Convergence of M-Filters for Stochastic System
British Library Online Contents | 1998
|Statistical design of stack filters (Invited Paper) [3457-01]
British Library Conference Proceedings | 1998
|Using genetic algorithm optimizing stack filters based on MMSE criterion
British Library Online Contents | 2005
|STOCHASTIC CONVERGENCE ACROSS U.S. STATES
British Library Online Contents | 2011
|