🚀 go-pugleaf

In article <1991Mar20.224801.7413@leland.Stanford.EDU> rick@hanauma.stanford.edu (Richard Ottolini) writes:
>In article <1991Mar20.003425.14767@sunee.waterloo.edu> rchann@sunee.waterloo.edu (Robert Chann) writes:
>>I'm trying to implement a mean value filter.  That is, using an nxn
>>approximately two additions per pel are required for the filtering.

>Simple.
>Use a rolling window.  Add elements of the leading edges and subtract elements
>of the trailing edges.


Yes, indeed, and watch the mean value slowly diverge in some direction
or other until its uncorrelated with the actual mean value.  Now, you
might get away with this for a 512 x 512 image or so, because you won't have
too much roundoff error, but don't try it on anything much bigger.

Don't forget roundoff error!

If you do the filter recursively (and that's what you're doing), 
don't forget that it has no controllability.
-- 
       -------->From the pyrolagnic keyboard of jj@alice.att.com<--------
Copyright alice!jj 1991,  all rights reserved,  except transmission  by USENET and
like free facilities granted.  Said permission is granted only for complete copies
that include this notice.    Use on pay-for-read services specifically disallowed.