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

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

Treatment of bias in recursive filtering

Friedland, B.·1969·IEEE Transactions on Automatic Control

Abstract

The problem of estimating the statexof a linear process in the presence of a constant but unknown bias vectorbis considered. This bias vector influences the dynamics and/or the observations. It is shown that the optimum estimate\hat{x}of the state can be expressed as\hat{x} = x + V_{x}\hat{b}(1) where\tilde{x}is the bias-free estimate, computed as if no bias were present,\hat{b}is the optimum estimate of the bias, and Vxis a matrix which can be interpreted as the ratio of the covariance of\tilde{x}and\hat{b}to the variance of\hat{b}. Moreover,\hat{b}can be computed in terms of the residuals in the bias-free estimate, and the matrix Vxdepends only on matrices which arise in the computation of the bias-free estimates. As a result, the computation of the optimum estimate\tilde{x}is effectively decoupled from the estimate of the bias\hat{b}, except for the final addition indicated by (1).

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/tac.1969.1099223

Cites

1 of 1 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 1 references

Cited by

See all 744

Metadata

Authors
Friedland, B.
Venue
IEEE Transactions on Automatic Control
Published
1969-08
Volume
14
Issue
4
Pages
359-367
ISSN
0018-9286 (ISSN-L)
OpenAlex
W2056870323
Cited by
744
References
1
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: Treatment of bias in recursive filtering. https://app.cochat.ai/papers/10.1109/tac.1969.1099223
The paper
Friedland, B. (1969). Treatment of bias in recursive filtering. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.1969.1099223

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.