View Item 

Explicit filtering equations for labelled random finite sets

Access Status
Fulltext not available
Authors
Garcia Fernandez, Angel
Morelande, M.
Date
2015
Type
Conference Paper

Metadata
Show full item record
Citation
Garcia Fernandez, A. and Morelande, M. 2015. Explicit filtering equations for labelled random finite sets, in Proceedings of the International Conference on Control, Automation and Information Sciences (ICCAIS), Oct 29-31 2015, pp. 349-354. Changshu: IEEE.
Source Title
ICCAIS 2015 - 4th International Conference on Control, Automation and Information Sciences
Source Conference
2015 International Conference on Control, Automation and Information Sciences
DOI
ISBN
School
Department of Electrical and Computer Engineering
Remarks

Copyright © 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

URI
Collection
Abstract

We decompose a probability density function (PDF) of a labelled random finite set (RFS) into a probability mass function over a set of labels and a PDF on a vector-valued multitarget state given the labels. Using this decomposition, we write the Bayesian filtering recursion for labelled RFSs in an explicit form. The resulting formulas are of conceptual and practical interest in the RFS approach to multiple target tracking, especially, for track-before-detect particle filter implementations.