Bayesian Filtering With Random Finite Set Observations
MetadataShow full item record
This paper presents a novel and mathematically rigorous Bayes’ recursion for tracking a target that generates multiple measurements with state dependent sensor field of view and clutter. Our Bayesian formulation is mathematically well-founded due to our use of a consistent likelihood function derived from random finite set theory. It is established that under certain assumptions, the proposed Bayes’ recursion reduces to the cardinalized probability hypothesis density (CPHD) recursion for a single target. A particle implementation of the proposed recursion is given. Under linear Gaussian and constant sensor field of view assumptions, an exact closed-form solution to the proposed recursion is derived, and efficient implementations are given. Extensions of the closed-form recursion to accommodate mild nonlinearities are also given using linearization and unscented transforms.
Copyright © 2008. 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.
Showing items related by title, author, creator and subject.
Teunissen, Peter; Khodabandeh, A. (2013)In this contribution, we extend ‘Kalman-filter’ theory by introducing a new BLUE–BLUP recursion of the partitioned measurement and dynamic models. Instead of working with known state-vector means, we relax the model and ...
Nadarajah, Nandakumaran; Tharmarasa, R.; McDonald, M.; Kirubarajan, T. (2012)The interacting multiple model (IMM) estimator has been proven to be effective in tracking agile targets. Smoothing or retrodiction, which uses measurements beyond the current estimation time, provides better estimates ...
Nadarajah, Nandakumaran; Kirubarajan, T.; Lang, T.; McDonald, M.; Punithakumar, K. (2011)In general, for multitarget problems where the number of targets and their states are time varying, the optimal Bayesian multitarget tracking is computationally demanding. The Probability Hypothesis Density (PHD) filter, ...