Synthesis of stack filters by rank selection probabilities

In this paper, we extend the concept of the Mi's of weighted median filters to stack filters. A fast algorithm is proposed to compute Mi of stack filters. The problem of synthesis of stack filters by rank selection probabilities through the Mi's is addressed. The necessary and sufficient condition for Mi to be a stack filter is presented. A procedure is proposed to synthesize a stack filter by a given set of rank selection probabilities.

[1]  M. K. Prasad,et al.  Stack filters and selection probabilities , 1990, IEEE International Symposium on Circuits and Systems.

[2]  Sos S. Agaian,et al.  On rank selection probabilities , 1994, IEEE Trans. Signal Process..

[3]  Moncef Gabbouj,et al.  2-D Optimal Weighted Median Filters , 1992 .

[4]  Peter D. Wendt.  Nonrecursive and recursive stack filters and their filtering behavior , 1990, IEEE Trans. Acoust. Speech Signal Process..

[5]  Edward J. Coyle,et al.  Stack filters , 1986, IEEE Trans. Acoust. Speech Signal Process..

[6]  Moncef Gabbouj,et al.  Minimum Mean Absolute Error Stack Filtering with Structural Constraints and Goals , 1990 .

[7]  M. Gabbouj,et al.  Optimal weighted median filters under structural constraints , 1993, 1993 IEEE International Symposium on Circuits and Systems.

[8]  Edward J. Coyle,et al.  Stack Filter Lattices and Rank Selection Probabilities , 1993, IEEE Winter Workshop on Nonlinear Digital Signal Processing.

[9]  Jaakko Astola,et al.  Analysis of the properties of median and weighted median filters using threshold logic and stack filter representation , 1991, IEEE Trans. Signal Process..