A linear-complexity second-order multi-object filter via factorial cumulants - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

A linear-complexity second-order multi-object filter via factorial cumulants

Résumé

Multi-target tracking solutions with low computational complexity are required in order to address large-scale tracking problems. Solutions based on statistics determined from point processes, such as the PHD filter, CPHD filter, and newer second-order PHD filter are some examples of these algorithms. There are few solutions of linear complexity in the number of targets and number of measurements, with the PHD filter being one exception. However, the trade-off is that it is unable to propagate beyond first-order moment statistics. In this paper, a new filter is proposed with the same complexity as the PHD filter that also propagates second-order information via the second-order factorial cumulant. The results show that the algorithm is more robust than the PHD filter in challenging clutter environments
Fichier principal
Vignette du fichier
fusion2018_withallresults.pdf (360.53 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01885210 , version 1 (01-10-2018)

Identifiants

Citer

Daniel E Clark, Flavio de Melo. A linear-complexity second-order multi-object filter via factorial cumulants. FUSION 2018: 21st international conference on Information Fusion, Jul 2018, Cambridge, United Kingdom. pp.1250 - 1259, ⟨10.23919/ICIF.2018.8455331⟩. ⟨hal-01885210⟩
27 Consultations
111 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More