Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 599

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Optimal recursive estimation with uncertain observation

Nahi, N.·1969·IEEE Transactions on Information Theory

Abstract

In classical estimation theory, the observation is always assumed to contain the signal to be estimated. In practice, certain observations, or sequences of observations, may contain noise alone, only the probability of occurrence of such cases being available to the estimator. An example is trajectory tracking where the signal is first detected and then the estimator is allowed to process it for tracking purposes. However, any detection decision is associated with a false-alarm probability, which is the probability that the detected signal contains only noise. Minimum mean-square estimators are derived for two different forms of this problem; 1) when it is possible that the observation at any sample time contains signal or is noise alone, independent of the situation at any other sample, and 2) when the entire sequence of observations contains signal or is only noise. The estimators derived are of recursive form. A simple example is given for illustration.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tit.1969.1054329

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 2 references

Cited by

See all 599

Metadata

Authors
Nahi, N.
Venue
IEEE Transactions on Information Theory
Published
1969-07
Volume
15
Issue
4
Pages
457-462
ISSN
  • 0018-9448 (ISSN-L)
  • 1557-9654
OpenAlex
W2052178830
Cited by
599
References
2
FWCI
10.77
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: Optimal recursive estimation with uncertain observation. https://app.cochat.ai/papers/10.1109/tit.1969.1054329
The paper
Nahi, N. (1969). Optimal recursive estimation with uncertain observation. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1969.1054329

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.