REVIEW 1 cited by
Generalized optimal sub-pattern assignment metric
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This paper presents the generalized optimal sub-pattern assignment (GOSPA) metric on the space of finite sets of targets. Compared to the well-established optimal sub-pattern assignment (OSPA) metric, GOSPA is unnormalized as a function of the cardinality and it penalizes cardinality errors differently, which enables us to express it as an optimisation over assignments instead of permutations. An important consequence of this is that GOSPA allows us to penalize localization errors for detected targets and the errors due to missed and false targets, as indicated by traditional multiple target tracking (MTT) performance measures, in a sound manner. In addition, we extend the GOSPA metric to the space of random finite sets, which is important to evaluate MTT algorithms via simulations in a rigorous way.
Forward citations
Cited by 1 Pith paper
-
Stone Soup: ADS-B-based Multi-Target Tracking with Stochastic Integration Filter
In dense multi-target tracking, the stochastic integration filter tracks as well as the extended Kalman filter with lower covariance spikes, but on sparse real ADS-B traffic the difference is marginal.
Discussion (0). Continue with ORCID to comment.