This is an old revision of this page, as edited by DannyS712 bot(talk | contribs) at 18:03, 11 May 2020(Task 70: Update syntaxhighlight tags - remove use of deprecated <source> tags). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
Revision as of 18:03, 11 May 2020 by DannyS712 bot(talk | contribs)(Task 70: Update syntaxhighlight tags - remove use of deprecated <source> tags)
Like a power mean,
a Lehmer mean serves a non-linear moving average which is shifted towards small signal values for small and emphasizes big signal values for big . Given an efficient implementation of a moving arithmetic mean called smooth you can implement a moving Lehmer mean according to the following Haskell code.
Gonzalez and Woods call this a "contraharmonic mean filter" described for varying values of p (however, as above, the contraharmonic mean can refer to the specific case ). Their convention is to substitute p with the order of the filter Q:
Q=0 is the arithmetic mean. Positive Q can reduce pepper noise and negative Q can reduce salt noise.[2]