The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Approximate evaluation of marginal association probabilities with belief propagation
Open accessAbstract
Data association, the problem of reasoning over correspondence between targets and measurements, is a fundamental problem in tracking. This paper presents a graphical model formulation of data association and applies an approximate inference method, belief propagation (BP), to obtain estimates of marginal association probabilities. We prove that BP is guaranteed to converge, and bound the number of iterations necessary. Experiments reveal a favourable comparison to prior methods in terms of accuracy and computational complexity.
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
A New Approach to Linear Filtering and Prediction Problems
Kalman, R. E. (1960) · Journal of Basic Engineering · doi:10.1115/1.3662552 · Cited by 31,751
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Lauritzen, S. L. (1996) · doi:10.1093/oso/9780198522195.001.0001 · Cited by 2,976
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Cited by
Message Passing Algorithms for Scalable Multitarget Tracking
Meyer, F., Kropfreiter, T., Williams, J. L., Lau, R., Hlawatsch, F., Braca, P., & Win, M. Z. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2789427 · Cited by 355
Self-citationMarginal multi-bernoulli filters: RFS derivation of MHT, JIPDA, and association-based member
Williams, J. L. (2015) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2015.130550 · Cited by 352
Self-citationA Scalable Algorithm for Tracking an Unknown Number of Targets Using Multiple Sensors
Meyer, F., Braca, P., Willett, P., & Hlawatsch, F. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2688966 · Cited by 230
“In particular, BP has been used in [32] and [33] to calcula te approximate marginal association probabilities for a sing le sensor; in [36] to calculate exact marginal association pro babilities for a single sensor; in [37] to calculate approxim ate ssociation probabilities for multiple sensors with overl apping regio…”
BackgroundMethodInfluentialBelief propagation based AIS/radar data fusion for multi-target tracking
Gaglione, D., Braca, P., & Soldi, G. (2018) · 2018 21st International Conference on Information Fusion (FUSION) · doi:10.23919/icif.2018.8455217 · Cited by 37
Bayesian information fusion and multitarget tracking for maritime situational awareness
Gaglione, D., Soldi, G., Meyer, F., Hlawatsch, F., Braca, P., Farina, A., & Win, M. Z. (2020) · IET Radar, Sonar & Navigation · doi:10.1049/iet-rsn.2019.0508 · Cited by 36
Metadata
- Authors
- Williams, J., & Lau, R.
- Venue
- IEEE Transactions on Aerospace and Electronic Systems
- Published
- 2014-10
- Volume
- 50
- Issue
- 4
- Pages
- 2942-2959
- ISSN
- 0018-9251 (ISSN-L)
- 1557-9603
- 2371-9877
- OpenAlex
- W2157316965
- Cited by
- 159
- References
- 4
- FWCI
- 5.61
- Type
- journal article
- Language
- en
- Open access
- green
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.