Generation of representative members of an RrSst weighted median filer class

Abstract
The weighted median filter (WMF) is a generalisation of the median filter. The WMF has been described elsewhere, where it was shown that a given WMF class operates in a finite number of ways. An expression for the number of modes of operation of any WMF class, in a given group of classes, has recently been derived. Here, an algorithm is described for constructing a complete set of representative members of any class in such a group. This algorithm, expressed as a Pascal program, is used to generate results for two useful classes of WMFs.

This publication has 0 references indexed in Scilit: