The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Kullback-Leibler Approach to Gaussian Mixture Reduction
Abstract
A common problem in multi-target tracking is to approximate a Gaussian mixture by one containing fewer components; similar problems can arise in integrated navigation. A common approach is successively to merge pairs of components, replacing the pair with a single Gaussian component whose moments up to second order match those of the merged pair. Salmond [1] and Williams [2, 3] have each proposed algorithms along these lines, but using different criteria for selecting the pair to be merged at each stage. The paper shows how under certain circumstances each of these pair-selection criteria can give rise to anomalous behaviour, and proposes that a key consideration should the the Kullback-Leibler (KL) discrimination of the reduced mixture with respect to the original mixture. Although computing this directly would normally be impractical, the paper shows how an easily computed upper bound can be used as a pair-selection criterion which avoids the anomalies of the earlier approaches. The behaviour of the three algorithms is compared using a high-dimensional example drawn from terrain-referenced navigation.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
Linear Statistical Inference and its Applications: Second Editon
Rao, C. R. (1973) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316436 · Cited by 10,489
Design and Analysis of Modern Tracking Systems
Blackman, S. S., & Populi, R. (1999) · Cited by 3,509
Principles and practice of information theory
Blahut, R. E. (1987) · Medical Entomology and Zoology · Cited by 1,008
Mixture reduction algorithms for target tracking in clutter
Salmond, D. J. (1990) · SPIE Proceedings · doi:10.1117/12.21610 · Cited by 194
Gaussian Mixture Reduction for Tracking Multiple Maneuvering Targets in Clutter
Williams, J. (2003) · Defense Technical Information Center (DTIC) · Cited by 62
Cited by
Gradient boosting machines, a tutorial
Natekin, A., & Knoll, A. (2013) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2013.00021 · Cited by 3,887
Metadata
- Authors
- Runnalls, A. R.
- Venue
- IEEE Transactions on Aerospace and Electronic Systems
- Published
- 2007-07
- Volume
- 43
- Issue
- 3
- Pages
- 989-999
- ISSN
- 0018-9251 (ISSN-L)
- OpenAlex
- W2125105520
- Cited by
- 360
- References
- 7
- FWCI
- 8.27
- 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.