Sorry, you need to enable JavaScript to visit this website.

The Greedy Dirichlet Process Filter - An Online Clustering Multi-Target Tracker

Citation Author(s):
Patrick Burger, Hans-Joachim Wuensche
Submitted by:
Benjamin Naujoks
Last updated:
27 November 2018 - 1:23pm
Document Type:
Presentation Slides
Document Year:
2018
Event:
Presenters:
Benjamin Naujoks
Paper Code:
IVC-L.2.4
 

Reliable collision avoidance is one of the main requirements for autonomous driving.
Hence, it is important to correctly estimate the states of an unknown number of static and dynamic objects in real-time.
Here, data association is a major challenge for every multi-target tracker.
We propose a novel multi-target tracker called Greedy Dirichlet Process Filter (GDPF) based on the non-parametric Bayesian model called Dirichlet Processes and the fast posterior computation algorithm Sequential Updating and Greedy Search (SUGS).
By adding a temporal dependence we get a real-time capable tracking framework without the need of a previous clustering or data association step.
Real-world tests show that GDPF outperforms other multi-target tracker in terms of accuracy and stability.

up
0 users have voted: