Demonstrates a fast median filtering algorithm, indicating improved performance over traditional methods.
We present a fast algorithm for two-dimensional median filtering. It is based on storing and updating the gray level histogram of the picture elements in the window. The algorithm is much faster than conventional sorting methods. For a window size of m × n, the computer time required is 0(n).
No takes yet. Share an insight, caveat, or question.
Huang et al. (1979) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: