Computing 2-D Min, Median, and Max Filters

Joseph Gil; Michael Werman

doi:10.1109/34.211471

Computing 2-D Min, Median, and Max Filters

Joseph Gil, Michael Werman

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

132 Scopus citations

Abstract

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 language	English
Pages (from-to)	504-507
Number of pages	4
Journal	IEEE Transactions on Pattern Analysis and Machine Intelligence
Volume	15
Issue number	5
DOIs	https://doi.org/10.1109/34.211471
State	Published - May 1993

Keywords

Algorithm
filter
lower bound
max filter
median filter
min
order filter

Access to Document

10.1109/34.211471

Cite this

@article{59764063792543d682a6323a77cce486,

title = "Computing 2-D Min, Median, and Max Filters",

abstract = "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.",

keywords = "Algorithm, filter, lower bound, max filter, median filter, min, order filter",

author = "Joseph Gil and Michael Werman",

year = "1993",

month = may,

doi = "10.1109/34.211471",

language = "אנגלית",

volume = "15",

pages = "504--507",

journal = "IEEE Transactions on Pattern Analysis and Machine Intelligence",

issn = "0162-8828",

publisher = "IEEE Computer Society",

number = "5",

}

TY - JOUR

T1 - Computing 2-D Min, Median, and Max Filters

AU - Gil, Joseph

AU - Werman, Michael

PY - 1993/5

Y1 - 1993/5

N2 - 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.

AB - 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.

KW - Algorithm

KW - filter

KW - lower bound

KW - max filter

KW - median filter

KW - min

KW - order filter

UR - http://www.scopus.com/inward/record.url?scp=0027590120&partnerID=8YFLogxK

U2 - 10.1109/34.211471

DO - 10.1109/34.211471

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0027590120

SN - 0162-8828

VL - 15

SP - 504

EP - 507

JO - IEEE Transactions on Pattern Analysis and Machine Intelligence

JF - IEEE Transactions on Pattern Analysis and Machine Intelligence

IS - 5

ER -

Computing 2-D Min, Median, and Max Filters

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this