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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.