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

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

Efficient particle filtering for jump markov systems. Application to time-varying autoregressions

Andrieu, C., Davy, M., Doucet, A.·2003·IEEE Transactions on Signal Processing

Abstract

We present an efficient particle filtering method to perform optimal estimation in jump Markov (nonlinear) systems (JMSs). Such processes consist of a mixture of heterogeneous models and possess a natural hierarchical structure. We take advantage of these specificities in order to develop a generic filtering methodology for these models. The method relies on an original and nontrivial combination of techniques that have been presented recently in the filtering literature, namely, the auxiliary particle filter and the unscented transform. This algorithm is applied to the complex problem of time-varying autoregressive estimation with an unknown time-varying model order. More precisely, we develop an attractive and original probabilistic model that relies on a flexible pole representation that easily lends itself to interpretations. We show that this problem can be formulated as a JMS and that the associated filtering problem can be efficiently addressed using the generic methodology developed in this paper. Simulations demonstrate the performance of our method compared to standard particle filtering techniques.

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/tsp.2003.810284

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

Cited by

See all 179

Metadata

Authors
Andrieu, C., Davy, M., & Doucet, A.
Venue
IEEE Transactions on Signal Processing
Published
2003-07
Volume
51
Issue
7
Pages
1762-1770
ISSN
1053-587X (ISSN-L)
OpenAlex
W2125514280
Cited by
179
References
1
FWCI
7.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: Efficient particle filtering for jump markov systems. Application to time-varying autoregressions. https://app.cochat.ai/papers/10.1109/tsp.2003.810284
The paper
Andrieu, C., Davy, M., & Doucet, A. (2003). Efficient particle filtering for jump markov systems. Application to time-varying autoregressions. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2003.810284

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.