The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Robust-resistant spectrum estimation
Abstract
Conventional spectrum estimates of both the smoothed-periodogram and autoregressive variety lack robustness toward outliers in the original data. Outliers and other local perturbations are modeled by non-Gaussian additive noise, which is zero most of the time. Correspondingly, the lack of robustness of the conventional estimates of the spectrum manifest not only inflated variances but also damaging asymptotic biases. This paper discusses robust-resistant methods of spectrum estimation which do not suffer in this way. The main approach involves "data cleaning" by either one-sided or two-sided outlier interpolators based on autoregressive approximations. The autoregressive coefficients are themselves estimated robustly in an iterative loop along with the data-cleaning operation. The well-cleaned data are then used along with the autoregressive model to form smoothed spectral density estimates via prewhitening. Study of the so-called "linear part" of the nonlinear outlier interpolator algorithm shows that considerable bias reduction is realizable through use of the robust procedure. Some examples of applications of the robust methodology are presented. Special considerations for real-time processing and large data sets are discussed. Extensions of the method to cross-spectrum estimation, missing data, and irregularly spaced data problems are briefly mentioned.
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
A New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
Robust estimation of a location parameter
Huber, P. J. (1964) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177703732 · Cited by 7,228
Huber, P. J. (1981) · Wiley Series in Probability and Statistics · doi:10.1002/0471725250 · Cited by 7,066
Cox, D. R., & Hinkley, D. V. (1974) · doi:10.1007/978-1-4899-2887-0 · Cited by 3,089
Information Theory and an Extension of the Maximum Likelihood Principle
Akaike, H. (1992) · Springer Series in Statistics · doi:10.1007/978-1-4612-0919-5_38 · Cited by 3,028
NON-NORMALITY AND TESTS ON VARIANCES
BOX, G. E. P. (1953) · Biometrika · doi:10.1093/biomet/40.3-4.318 · Cited by 1,302
Cited by
Recurrent neural networks and robust time series prediction
Connor, J. T., Martin, R. D., & Atlas, L. E. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279188 · Cited by 1,316
Self-citationRobust techniques for signal processing: A survey
Kassam, S. A., & Poor, H. V. (1985) · Proceedings of the IEEE · doi:10.1109/proc.1985.13167 · Cited by 815
Order statistics in digital image processing
Pitas, I., & Venetsanopoulos, A. N. (1992) · Proceedings of the IEEE · doi:10.1109/5.192071 · Cited by 476
On-line outlier detection and data cleaning
LIU, H. (2004) · Computers & Chemical Engineering · doi:10.1016/s0098-1354(04)00024-9 · Cited by 256
Robust Estimation in Signal Processing: A Tutorial-Style Treatment of Fundamental Concepts
Zoubir, A. M., Koivunen, V., Chakhchoukh, Y., & Muma, M. (2012) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2183773 · Cited by 411
Metadata
- Authors
- Martin, R. D., & Thomson, D. J.
- Venue
- Proceedings of the IEEE
- Published
- 1982
- Volume
- 70
- Issue
- 9
- Pages
- 1097-1115
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2060730008
- Cited by
- 195
- References
- 6
- FWCI
- 4.39
- 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.