The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Multitarget Miss Distance via Optimal Assignment
Abstract
The concept of miss distance-Euclidean, Mahalanobis, etc.-is a fundamental, far-reaching, and taken-for-granted element of the engineering theory and practice of single-target systems. In this paper we introduce a comprehensive L/sub p/-type theory of distance metrics for multitarget (and, more generally, multiobject) systems. We show that this theory extends, and provides a rigorous theoretical basis for, an intuitively appealing optimal-assignment approach proposed by Drummond for evaluating the performance of multitarget tracking algorithms. We describe tractable computational approaches for computing such metrics based on standard optimal assignment or convex optimization techniques. We describe the potentially far-reaching implications of these metrics for applications such as performance evaluation and sensor management. In the former case, we demonstrate the application of multitarget miss-distance metrics as measures of effectiveness (MoEs) for multitarget tracking algorithms.
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
(2001) · doi:10.1201/9781420038545 · Cited by 397
Cited by
A Consistent Metric for Performance Evaluation of Multi-Object Filters
Schuhmacher, D., Vo, B.-T., & Vo, B.-N. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.920469 · Cited by 1,855
Sequential monte carlo methods for multi-target filtering with random finite sets
Vo, B.-N., Singh, S., & Boucet, A. (2005) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2005.1561884 · Cited by 1,216
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
Convex Optimization in Signal Processing and Communications
(2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804458 · Cited by 554
Gromov–Wasserstein Distances and the Metric Approach to Object Matching
Mémoli, F. (2011) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9093-5 · Cited by 515
Metadata
- Authors
- Hoffman, J. R., & Mahler, R. P. S.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
- Published
- 2004-05
- Volume
- 34
- Issue
- 3
- Pages
- 327-336
- ISSN
- 1083-4427 (ISSN-L)
- OpenAlex
- W2155325587
- Cited by
- 210
- References
- 1
- FWCI
- 7.46
- 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.