Taxonomy of multiple target tracking methods
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
A concise summary of techniques for multiple target tracking is provided and their main characterics assessed qualitatively. The techniques have been catergorised into more than 35 different algorithmic types. A comparison chart is provided that lists each algorithm and categorises the processing scheme, data association mechanism, complexity scaling (with number of targets and with state dimension), overall complexity and a subjective performance figure. Although some recent filtering theory developments have been omitted, the survey should serve to demonstrate the large variety of ‘classical’ estimation theoretic algorithms already available for the design of multiple target tracking systems. A number of areas deserving of further study are identified in the concluding remarks.
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
An introduction to hidden Markov models
Rabiner, L., & Juang, B. (1986) · IEEE ASSP Magazine · doi:10.1109/massp.1986.1165342 · Cited by 4,775
An algorithm for tracking multiple targets
Reid, D. (1979) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1979.1102177 · Cited by 3,059
Cox, I. J., & Hingorani, S. L. (1996) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.481539 · Cited by 665
Cited by
Analytic Implementations of the Cardinalized Probability Hypothesis Density Filter
Vo, B.-T., Vo, B.-N., & Cantoni, A. (2007) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.894241 · Cited by 824
“Contrary to the belief that the PHD recursion is intractable [20], a closed-form solution for linear Gaussian models was proposed in [4], and a full sequential Monte Carlo (SMC) implementation was proposed in [3] with relevant convergence results established in [3], [15], and [16].”
BackgroundA survey: Optimization and applications of evidence fusion algorithm based on Dempster–Shafer theory
Zhao, K., Li, L., Chen, Z., Sun, R., Yuan, G., & Li, J. (2022) · Applied Soft Computing · doi:10.1016/j.asoc.2022.109075 · Cited by 150
Maritime Surveillance Using Multiple High-Frequency Surface-Wave Radars
Maresca, S., Braca, P., Horstmann, J., & Grasso, R. (2014) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2013.2286741 · Cited by 144
Knowledge-Based Multitarget Ship Tracking for HF Surface Wave Radar Systems
Vivone, G., Braca, P., & Horstmann, J. (2015) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2014.2388355 · Cited by 88
Metadata
- Authors
- Pulford, G. W.
- Venue
- IEE Proceedings - Radar, Sonar and Navigation
- Published
- 2005-10-07
- Volume
- 152
- Issue
- 5
- Pages
- 291-304
- ISSN
- 1350-2395 (ISSN-L)
- 1359-7086
- OpenAlex
- W2107142957
- Cited by
- 179
- References
- 3
- FWCI
- 4.47
- 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.