The DOI matches its Crossref record.
Mixture reduction algorithms for target tracking in clutter
Abstract
The Bayesian solution of the problem of tracking a target in random clutter gives rise to Gaussian mixture distributions, which are composed of an ever increasing number of components. To implement such a tracking filter, the growth of components must be controlled by approximating the mixture distribution. A popular and economical scheme is the Probabilistic Data Association Filter (PDAF), which reduces the mixture to a single Gaussian component at each time step. However this approximation may destroy valuable information, especially if several significant, well spaced components are present. In this paper, two new algorithms for reducing Gaussian mixture distributions are presented. These techniques preserve the mean and covariance of the mixture, and the fmal approximation is itself a Gaussian mixture. The reduction is achieved by successively merging pairs of components or groups of components until their number is reduced to some specified limit. Further reduction will then proceed while the approximation to the main features of the original distribution is still good. The performance of the most economical of these algorithms has been compared with that of the PDAF for the problem of tracking a single target which moves in a plane according to a second order model. A linear sensor which measures target position is corrupted by uniformly distributed clutter. Given a detection probability of unity and perfect knowledge of initial target position and velocity, this problem depends on only tw non-dimensional parameters. Monte Carlo simulation has been employed to identify the region of this parameter space where significant performance improvement is obtained over the PDAF.© (1990) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
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
Cited by
Survey of maneuvering target tracking. part v: multiple-model methods
Li, X. R., & Jilkov, V. P. (2005) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2005.1561886 · Cited by 1,157
The probabilistic data association filter
(2009) · IEEE Control Systems · doi:10.1109/mcs.2009.934469 · Cited by 754
Discrete-Time Nonlinear Filtering Algorithms Using Gauss–Hermite Quadrature
Arasaratnam, I., Haykin, S., & Elliott, R. J. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2007.894705 · Cited by 622
Fundamentals of Object Tracking
Challa, S., Morelande, M. R., Mušicki, D., & Evans, R. J. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511975837 · Cited by 416
Monte Carlo filtering for multi-target tracking and data association
Vermaak, J., Godsill, S. J., & Perez, P. (2005) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2005.1413764 · Cited by 378
Metadata
- Authors
- Salmond, D. J.
- Venue
- SPIE Proceedings
- Publisher
- SPIE
- Published
- 1990-10-01
- Volume
- 1305
- Pages
- 434
- ISSN
- 0277-786X (ISSN-L)
- OpenAlex
- W2046059763
- Cited by
- 194
- References
- 0
- FWCI
- 0.00
- Type
- conference paper
- 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: Mixture reduction algorithms for target tracking in clutter. https://app.cochat.ai/papers/10.1117/12.21610
- The paper
- Salmond, D. J. (1990). Mixture reduction algorithms for target tracking in clutter. SPIE Proceedings. https://doi.org/10.1117/12.21610
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.