Abstract
A fast algorithm is presented for doing 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 multiplied by n, the computer time required is O(n).
Original language | English (US) |
---|---|
Pages | 128-113 |
Number of pages | 16 |
State | Published - 1978 |
Externally published | Yes |
Event | Proc IEEE Comput Soc Conf Pattern Recognition Image Process - Chicago, IL, USA Duration: May 31 1978 → Jun 2 1978 |
Conference
Conference | Proc IEEE Comput Soc Conf Pattern Recognition Image Process |
---|---|
City | Chicago, IL, USA |
Period | 5/31/78 → 6/2/78 |
ASJC Scopus subject areas
- General Engineering