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).
|Original language||English (US)|
|Number of pages||6|
|Journal||IEEE Transactions on Acoustics, Speech, and Signal Processing|
|State||Published - Feb 1979|
ASJC Scopus subject areas
- Signal Processing