The Bin-Occupancy Filter and Its Connection to the PHD Filters

An algorithm that is capable not only of tracking multiple targets but also of ldquotrack managementrdquo-meaning that it does not need to know the number of targets as a user input-is of considerable interest. In this paper we devise a recursive track-managed filter via a quantized state-space (ldquobinrdquo) 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 ldquotarget-deathrdquo problem, and also the statistical inference structures of the PHD filters. To obviate the target death problem, PHD originator Mahler developed a new ldquocardinalizedrdquo version of PHD (CPHD). The second contribution of this paper is to extend the ldquobin-occupancyrdquo model such that the resulting recursive filter is identical to the cardinalized PHD filter.