A threshold for replacement of a value by the median can be set. If the absolute value of the difference between the actual value and the median is less than the threshold, the replacement will not occur. The array boundary is dealt by either pixel replication or a reflection about the edge pixels of the array.
The WMF can be repeated iteratively a specified number of times, or it can be left to iterate continuously until convergence is achieved and no further changes are made to the data. In the latter case a damping algorithm is used if the number of iterations exceeds some critical value, which prevents the result oscillating between two solutions (which can sometimes happen). When damping is switched on data values are replaced not by the median value, but by a value midway between the original and the median.
Bad pixels are not included in the calculation of the median. There is a defined threshold which specifies minimum-allowable median position as a fraction of the median position when there are no bad pixels. For neighbourhoods with too many bad pixels, and so the median position is too small, the resulting output pixel is bad.
["Replication"]
"Continuous" mode is recommended only for images which are substantially smooth to start with (such as a sky background frame from a measuring machine). Complex images may take many iterations, and a great deal of time, to converge. ["Specified"]
[0]
weighting mask (MODE=3), a step size of 4 pixels
(STEP=4) and a difference threshold of 1.0 (DIFF=1.0). It
runs the filter twice (NUMIT=2) and writes the result to
the NDF called sabc.
The . Indicates that the weights are separated by the stepsize-minus-one zeros.
KAPPA --- Kernel Application Package