Generalized optimal sub-pattern assignment metric
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.
Code (3)
Similar Papers 제목 키워드 기반
Fast computation of the TGOSPA metric for multiple target tracking via unbalanced optimal transport
In multiple target tracking, it is important to be able to evaluate the performance of different tracking algorithms. The trajectory generalized optimal sub-pattern assignment metric (TGOSPA) is a recently proposed metri…
Probabilistic GOSPA: A Metric for Performance Evaluation of Multi-Object Filters with Uncertainties
This paper presents a probabilistic generalization of the Generalized Optimal Sub-Pattern Assignment (GOSPA) metric, termed P-GOSPA. The GOSPA metric has been widely used to evaluate the distance between finite sets, par…
ObjectA New Optimal Subpattern Assignment (OSPA) Metric for Multi-target Filtering
This paper proposes and evaluates a new metric. This metric will overcome a limitation of the Optimal Subpattern Assignment (OSPA) metric mentioned by Schuhmacher et al.: the OSPA distance between two sets of points is i…
Multiple Instance Learning with the Optimal Sub-Pattern Assignment Metric
Multiple instance data are sets or multi-sets of unordered elements. Using metrics or distances for sets, we propose an approach to several multiple instance learning tasks, such as clustering (unsupervised learning), cl…
ClusteringGeneral ClassificationMultiple Instance LearningNovelty DetectionOptimal Subpattern Assignment Metric for Multiple Tracks (OSPAMT Metric)
In this paper, we propose a new metric which measures the distance between two finite sets of tracks (a track is a path of either a real or estimated target). This metric is based on the same principle as the Optimal Sub…