The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Median Filtering in Constant Time
Abstract
The median filter is one of the basic building blocks in many image processing situations. However, its use has long been hampered by its algorithmic complexity of O (r) in the kernel radius. With the trend toward larger images and proportionally larger filter kernels, the need for a more efficient median filtering algorithm becomes pressing. In this correspondence, a new, simple, yet much faster, algorithm exhibiting O (1) runtime complexity is described and analyzed. It is compared and benchmarked against previous algorithms. Extensions to higher dimensional or higher precision data and an approximation to a circular kernel are presented, as well.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
David, F. N., & Tukey, J. W. (1977) · Biometrics · doi:10.2307/2529486 · Cited by 12,708
The Art of Computer Programming: Volume 3: Sorting and Searching
Knuth, D. E. (1973) · Cited by 3,955
The Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Knuth, D. E. (1998) · Addison-Wesley Longman Publishing Co., Inc. eBooks · Cited by 1,421
Bulmer, M. (1978) · Sociology · doi:10.1177/003803857801200331 · Cited by 1,412
A fast two-dimensional median filtering algorithm
Huang, T., Yang, G., & Tang, G. (1979) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1979.1163188 · Cited by 1,390
Fast median and bilateral filtering
Weiss, B. (2006) · ACM Transactions on Graphics · doi:10.1145/1141911.1141918 · Cited by 346
Carayon, P., Portier, M., Dussossoy, D., Bord, A., Petitpretre, G., Canat, X., Le Fur, G., & Casellas, P. (1996) · Blood · doi:10.1182/blood.v87.8.3170.bloodjournal8783170 · Cited by 187
Computing 2-D min, median, and max filters
Gil, J., & Werman, M. (1993) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.211471 · Cited by 142
Three‐dimensional ultrasound of fetal surface features
Nelson, T. R., & Pretorius, D. H. (1992) · Ultrasound in Obstetrics and Gynecology · doi:10.1046/j.1469-0705.1992.02030166.x · Cited by 73
Cited by
He, K., Sun, J., & Tang, X. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.213 · Cited by 5,546
Fast visibility restoration from a single color or gray level image
Tarel, J.-P., & Hautiere, N. (2009) · 2009 IEEE 12th International Conference on Computer Vision · doi:10.1109/iccv.2009.5459251 · Cited by 1,313
Lesion border detection in dermoscopy images
Celebi, M. E., Iyatomi, H., Schaefer, G., & Stoecker, W. V. (2009) · Computerized Medical Imaging and Graphics · doi:10.1016/j.compmedimag.2008.11.002 · Cited by 422
Fast Image Processing with Fully-Convolutional Networks
Chen, Q., Xu, J., & Koltun, V. (2017) · 2017 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2017.273 · Cited by 341
Lei, H., Li, C., Meng, J., Zhou, H., Liu, Y., Zhang, X., Wang, P., & Fang, D. (2019) · Materials & Design · doi:10.1016/j.matdes.2019.107685 · Cited by 331
Metadata
- Authors
- Perreault, S., & Hebert, P.
- Venue
- IEEE Transactions on Image Processing
- Published
- 2007-09
- Volume
- 16
- Issue
- 9
- Pages
- 2389-2394
- ISSN
- 1057-7149 (ISSN-L)
- OpenAlex
- W2021586009
- Cited by
- 317
- References
- 10
- FWCI
- 15.27
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Median Filtering in Constant Time. https://app.cochat.ai/papers/10.1109/tip.2007.902329
- The paper
- Perreault, S., & Hebert, P. (2007). Median Filtering in Constant Time. IEEE Transactions on Image Processing. https://doi.org/10.1109/tip.2007.902329
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
