COMPUTING 2-D MIN, MEDIAN, AND MAX FILTERS

Authors
GIL J WERMAN M
Citation
J. Gil et M. Werman, COMPUTING 2-D MIN, MEDIAN, AND MAX FILTERS, IEEE transactions on pattern analysis and machine intelligence, 15(5), 1993, pp. 504-507
Citations number
6
Categorie Soggetti
Computer Sciences","Computer Applications & Cybernetics
Journal title
IEEE transactions on pattern analysis and machine intelligence → ACNP
ISSN journal
01628828
Volume
15
Issue
5
Year of publication
1993
Pages
504 - 507
Database
ISI
SICI code
0162-8828(1993)15:5<504:C2MMAM>2.0.ZU;2-D
Abstract
Fast algorithms to compute min, median, max, or any other order statis tic filter transforms are described. The algorithms take constant time per pixel to compute min or max filters and polylog time per pixel, i n the size of the filter, to compute the median filter. A logarithmic time per pixel lower bound for the computation of the median filter is shown.