Multisensor CPHD filter

Abstract

The single sensor probability hypothesis density (PHD) and cardinalized probability hypothesis density (CPHD) filters have been developed in the literature using the random finite set framework. The existing multisensor extensions of these filters have limitations such as sensor order dependence, numerical instability or high computational requirements. In this paper we derive update equations for the multisensor CPHD filter. The multisensor PHD filter is derived as a special case. Exact implementation of the multisensor CPHD involves sums over all partitions of the measurements from different sensors and is thus intractable. We propose a computationally tractable approximation which combines a greedy measurement partitioning algorithm with the Gaussian mixture representation of the PHD. Our greedy approximation method allows the user to control the tradeoff between computational overhead and approximation accuracy.

Cited by in corpus (8)

• A Scalable Algorithm for Tracking an Unknown Number of Targets Using Multiple Sensors
• A multi-sensor multi-Bernoulli filter
• Radar networks: A review of features and challenges
• Decentralized Gaussian Filters for Cooperative Self-localization and Multi-target Tracking
• Heterogeneous Multi-sensor Fusion with Random Finite Set Multi-object Densities
• Robust multi-sensor Generalized Labeled Multi-Bernoulli filter
• Arithmetic Average Density Fusion -- Part III: Heterogeneous Unlabeled and Labeled RFS Filter Fusion
• Classification-Aided Multitarget Tracking Using the Sum-Product Algorithm