The bin-occupancy filter and its connection to the PHD filters

  • Authors:
  • Ozgur Erdinc;Peter Willett;Yaakov Bar-Shalom

  • Affiliations:
  • United Technologies Research Center, East Hartford, CT and ECE Department, University of Connecticut, Storrs, CT;ECE Department, University of Connecticut, Storrs, CT;ECE Department, University of Connecticut, Storrs, CT

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 2009

Quantified Score

Hi-index 35.68

Visualization

Abstract

An algorithm that is capable not only of tracking multiple targets but also of "track management"--meaning that it does not need to know the number of targets as a user input--is of considerable interest. In this paperwedevise a recursivetrack-managed filter via a quantized state-space ("bin") model. In the limit, as the discretization implied by the bins becomes as refined as possible (infinitesimal bins) we find that the filter equations are identical to Mahler's probability hypothesis density (PHD) filter, a novel track-managed filtering scheme that is attracting increasing attention. Thus, one contribution of this paper is an interpretation of, if not the PHD itself, at least what the PHD is doing. This does offer some intuitive appeal, but has some practical use as well: with this model it is possible to identify the PHD's "target-death" problem, and also the statistical inference structures of the PHD filters. To obviate the target death problem, PHD originator Mahler developed a new "cardinalized" version of PHD (CPHD). The second contribution of this paper is to extend the "bin-occupancy" model such that the resulting recursive filter is identical to the cardinalized PHD filter.