pith. sign in

arxiv: 1601.05585 · v7 · pith:XFBLTKQAnew · submitted 2016-01-21 · 💻 cs.SY · cs.CV· cs.SY

Generalized optimal sub-pattern assignment metric

classification 💻 cs.SY cs.CVcs.SY
keywords gospametricassignmenterrorsoptimalsub-patterntargetscardinality
0
0 comments X
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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.