Logo des Repositoriums
 
Konferenzbeitrag

Real-time implementation of a random finite set particle filter

Lade...
Vorschaubild

Volltext URI

Dokumententyp

Text/Conference Paper

Zusatzinformation

Datum

2011

Zeitschriftentitel

ISSN der Zeitschrift

Bandtitel

Verlag

Gesellschaft für Informatik e.V.

Zusammenfassung

In scenarios characterized by a high object density, data association is a demanding task due to several ambiguities. Especially the assumption that all objects move independent from each other may lead to physically impossible predicted states, in which two objects are closer to each other than feasible. Thus, avoiding such impossible states may simplify the data association. Within the random finite set statistics it is possible to easily incorporate constraints concerning object states and to integrate them into a multi-target Bayes filter. A drawback of the random finite set statistics is its computational complexity, especially in the corrector step. In this contribution, a fast approximation for the calculation of the multi-target likelihood function is proposed. This approximation is used to implement a real-time random finite set particle filter on a graphical processing unit using real world sensor data.

Beschreibung

Reuter, Stephan; Dietmayer, Klaus; Handrich, Sebastian (2011): Real-time implementation of a random finite set particle filter. INFORMATIK 2011 – Informatik schafft Communities. Bonn: Gesellschaft für Informatik e.V.. PISSN: 1617-5468. ISBN: 978-88579-286-4. pp. 493-493. Regular Research Papers. Berlin. 4.-7. Oktober 2011

Schlagwörter

Zitierform

DOI

Tags