Final published version, 1.52 MB, PDF document
Available under license: CC BY-NC-ND
Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - Box-particle probability hypothesis density filtering
AU - Schikora, Marek
AU - Gning, Amadou
AU - Mihaylova, Lyudmila
AU - Cremers, Daniel
AU - Koch, Wofgang
PY - 2014/7
Y1 - 2014/7
N2 - This paper develops a novel approach for multitarget tracking, called box-particle probability hypothesis density filter (box-PHD filter). The approach is able to track multiple targets and estimates the unknown number of targets. Furthermore, it is capable of dealing with three sources of uncertainty: stochastic, set-theoretic and data association uncertainty. The box-PHD filter reduces the number of particles significantly, which improves the runtime considerably. The small number of box particles makes this approach attractive for distributed inference, especially when particles have to be shared overnetworks. A box-particle is a random sample that occupies a small and controllable rectangular region of non-zero volume. Manipulation of boxes utilizes methods from the field of interval analysis. The theoretical derivation of the box-PHD filter is presented followed by a comparative analysis with a standard sequential Monte Carlo (SMC) version of the PHD filter. To measure the performance objectively three measures are used: inclusion, volume and the optimum subpattern assignment metric. Our studies suggest that the box-PHD filter reaches similar accuracy results, like a SMC-PHD filter but with considerablyless computational costs. Furthermore, we can show that in the presence of strongly biased measurement the box-PHD filter even outperforms the classical SMC-PHD filter.
AB - This paper develops a novel approach for multitarget tracking, called box-particle probability hypothesis density filter (box-PHD filter). The approach is able to track multiple targets and estimates the unknown number of targets. Furthermore, it is capable of dealing with three sources of uncertainty: stochastic, set-theoretic and data association uncertainty. The box-PHD filter reduces the number of particles significantly, which improves the runtime considerably. The small number of box particles makes this approach attractive for distributed inference, especially when particles have to be shared overnetworks. A box-particle is a random sample that occupies a small and controllable rectangular region of non-zero volume. Manipulation of boxes utilizes methods from the field of interval analysis. The theoretical derivation of the box-PHD filter is presented followed by a comparative analysis with a standard sequential Monte Carlo (SMC) version of the PHD filter. To measure the performance objectively three measures are used: inclusion, volume and the optimum subpattern assignment metric. Our studies suggest that the box-PHD filter reaches similar accuracy results, like a SMC-PHD filter but with considerablyless computational costs. Furthermore, we can show that in the presence of strongly biased measurement the box-PHD filter even outperforms the classical SMC-PHD filter.
KW - Multi-Target Tracking
KW - Box-Particle Filters
KW - Random Finite Sets
KW - Probability hypothesis density filters
KW - Interval Measurements
U2 - 10.1109/TAES.2014.120238
DO - 10.1109/TAES.2014.120238
M3 - Journal article
VL - 50
SP - 1660
EP - 1672
JO - IEEE Transactions on Aerospace and Electronic Systems
JF - IEEE Transactions on Aerospace and Electronic Systems
SN - 0018-9251
IS - 3
ER -