Computing 2-D Min, Median, and Max Filters

Joseph Gil, Michael Werman

Research output: Contribution to journalArticlepeer-review

131 Scopus citations


Fast algorithms to compute min, median, max, or any other order statistic filter transforms are described. The algorithms take constant time per pixel to compute min or max filters and polylog time per pixel, in 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.

Original languageAmerican English
Pages (from-to)504-507
Number of pages4
JournalIEEE Transactions on Pattern Analysis and Machine Intelligence
Issue number5
StatePublished - May 1993


  • Algorithm
  • filter
  • lower bound
  • max filter
  • median filter
  • min
  • order filter


Dive into the research topics of 'Computing 2-D Min, Median, and Max Filters'. Together they form a unique fingerprint.

Cite this