The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A theoretical analysis of the properties of median filters
Abstract
Necessary and sufficient conditions for a signal to be invariant under a specific form of median filtering are derived. These conditions state that a signal must be locally monotone to pass through a median filter unchanged. It is proven that the form of successive median filtering of a signal (i.e., the filtered output is itself again filtered) eventually reduces the original signal to an invariant signal called a root signal. For a signal of length L samples, a maximum of\frac{1}{2}(L - 2)repeated filterings produces a root signal.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Beniger, J. R., & Tukey, J. W. (1978) · Contemporary Sociology · doi:10.2307/2065930 · Cited by 2,607
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
Applications of a nonlinear smoothing algorithm to speech processing
Rabiner, L., Sambur, M., & Schmidt, C. (1975) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1975.1162749 · Cited by 315
Jayant, N. S. (1976) · IRE Transactions on Communications Systems · doi:10.1109/tcom.1976.1093415 · Cited by 98
Cited by
Direct observation of kinesin stepping by optical trapping interferometry
Svoboda, K., Schmidt, C. F., Schnapp, B. J., & Block, S. M. (1993) · Nature · doi:10.1038/365721a0 · Cited by 1,910
Pore-network extraction from micro-computerized-tomography images
Dong, H., & Blunt, M. J. (2009) · Physical Review E · doi:10.1103/physreve.80.036307 · Cited by 1,282
Astola, J., Haavisto, P., & Neuvo, Y. (1990) · Proceedings of the IEEE · doi:10.1109/5.54807 · Cited by 1,141
A generalized Gaussian image model for edge-preserving MAP estimation
Bouman, C., & Sauer, K. (1993) · IEEE Transactions on Image Processing · doi:10.1109/83.236536 · Cited by 884
From Boolean to probabilistic Boolean networks as models of genetic regulatory networks
Shmulevich, I., Dougherty, E. R., & Zhang, W. (2002) · Proceedings of the IEEE · doi:10.1109/jproc.2002.804686 · Cited by 641
Metadata
- Authors
- Gallagher, N., & Wise, G.
- Venue
- IEEE Transactions on Acoustics, Speech, and Signal Processing
- Published
- 1981-12
- Volume
- 29
- Issue
- 6
- Pages
- 1136-1141
- ISSN
- 0096-3518 (ISSN-L)
- OpenAlex
- W2168932899
- Cited by
- 754
- References
- 4
- FWCI
- 10.80
- 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
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.