PaperlayerView exact revision on arXiv

Source-linked AI summary

Poisson multi-Bernoulli mixture filter: direct derivation and implementation

Ángel F. García-Fernández, Jason L. Williams, Karl Granström, Lennart Svensson

arXiv:1703.04264v4cs.CVstat.ME

TL;DR

The paper tackles the accessibility and implementation of PMBM filtering for standard point-target multi-target tracking. It provides a non-PGFL derivation, relates PMBM to δ-GLMB, and develops linear/Gaussian implementation and estimator procedures. The PMBM implementation is compared with other RFS filters in a challenging scenario and is reported to outperform them.

  • Problem

    PMBM filtering had previously been derived using PGFLs and functional derivatives, limiting accessibility of its theoretical structure and practical implementation.

    Source: §I · p. 2

  • Method

    The paper derives PMBM without PGFLs, interprets δ-GLMB as a labelled special case, implements PMBM for linear/Gaussian models, and obtains three estimators.

    Source: §I · p. 2, §VIII · pp. 12–13

  • Results

    The PMBM filter is reported to outperform other multi-target filters in a challenging scenario.

    Source: §I · p. 2, §VIII · p. 13

  • Takeaways & Limitations

    The PMBM parameterisation offers a more efficient filtering-density representation than δ-GLMB, simplifying prediction and supporting efficient estimator extraction.

    Source: D. Discussion · p. 8, §VIII · p. 13

Abstract

from arXiv · show

We provide a derivation of the Poisson multi-Bernoulli mixture (PMBM) filter for multi-target tracking with the standard point target measurements without using probability generating functionals or functional derivatives. We also establish the connection with the δ-generalised labelled multi-Bernoulli (δ-GLMB) filter, showing that a δ-GLMB density represents a multi-Bernoulli mixture with labelled targets so it can be seen as a special case of PMBM. In addition, we propose an implementation for linear/Gaussian dynamic and measurement models and how to efficiently obtain typical estimators in the literature from the PMBM. The PMBM filter is shown to outperform other filters in the literature in a challenging scenario.

I. INTRODUCTION

The paper addresses intractable Bayesian multi-target tracking by making the PMBM filter more accessible through a non-PGFL derivation, implementation, and estimator procedures.

  • MTT infers the states of an unknown, changing number of targets from noisy measurements in applications including surveillance and autonomous driving.Source: §I · p. 1
  • Bayesian RFS filtering is generally intractable, motivating computationally expensive approximations such as particle filters.Source: §I · p. 1
  • Conjugate priors keep posterior densities within the same family and can express updates through single-target Bayesian updates.Source: §I · p. 1
  • For standard point-target measurements, PMBM combines a Poisson process with a multi-Bernoulli mixture representing data-association hypotheses.Source: §I · p. 1
  • The paper derives PMBM without PGFLs or functional derivatives, connects it to δ-GLMB, proposes a linear/Gaussian implementation, and develops estimators.Source: §I · p. 2

B. Standard point target measurement model

III. PROOF OF THE CONJUGACY OF THE PMBM

The proof represents the PMBM prior as a Poisson component joined with a multi-Bernoulli mixture, then explains how measurements generate and update association hypotheses.

B. Update of a Poisson prior

The Poisson-prior update decomposes the posterior into an undetected-target Poisson process and Bernoulli components associated with the measurements.

  • The likelihood is decomposed by partitioning targets into undetected targets and measurement-origin sets, each containing one target or being empty for clutter.Source: 1) Likelihood representation · p. 4
  • After observing Z, the Poisson posterior is a union of a Poisson process and a multi-Bernoulli RFS.Source: 2) Update · p. 4
  • The updated Poisson intensity equals the prior intensity multiplied by 1 − pd(·).Source: 2) Update · p. 4
  • Each measurement produces a Bernoulli component whose existence probability represents whether it originated from a target rather than clutter or another association.Source: 2) Update · p. 4

2) Update of one Bernoulli component:

The Bernoulli update considers the only measurement subsets with nonzero likelihood: a singleton measurement or no measurement. These cases produce explicit Bernoulli posteriors that feed the PMBM update.

D. Prediction of the conjugate prior

The prediction step preserves the PMBM structure under the standard dynamic and measurement models. Its Poisson and multi-Bernoulli-mixture parameters are propagated using established Poisson and MeMBer prediction equations.

E. Conjugacy for multi-Bernoulli mixtures

The paper establishes conjugacy for multi-Bernoulli mixtures and labelled variants under standard point-target dynamics and measurements. It also explains the δ-GLMB connection through labelled MBM representations and the MBM01 parameterisation.

E. Conjugacy for multi-Bernoulli mixtures

Connection with δ-GLMB

A. Multi-Bernoulli mixture 01 parameterisation

Labelled multi-Bernoulli mixtures

  • Labels augment target states with unique, time-fixed identifiers, yielding labelled MBMs whose densities retain the conjugacy property.Source: B. Conjugacy of labelled… · p. 8

C. Relation between δ-GLMB densities and labelled multi-Bernoulli mixtures

The paper establishes that δ-GLMB densities and labelled MBM01 representations encode the same labelled multi-target densities, while PMBM/MBM parameterisations offer computational advantages through more flexible mixture representations.

C. Update

The PMBM update creates hypotheses for undetected, newly detected, and previously detected targets, then forms global data-association hypotheses and prunes them for tractable computation.

VI. ESTIMATION

The PMBM supports tractable estimators based on either the highest-weight global hypothesis or the maximum a posteriori cardinality, with target means extracted from selected Bernoulli components.

  • Estimator 1 selects the highest-weight multi-Bernoulli mixture hypothesis and reports means of Bernoulli components whose existence exceeds a threshold.Source: A. Estimator 1 · p. 11
  • The existence threshold determines how many consecutive target misdetections can occur before an estimate is no longer reported.Source: A. Estimator 1 · p. 11
  • Estimator 2 first finds the MAP cardinality, then selects the highest-weight global hypothesis having that cardinality.Source: B. Estimator 2 · p. 11
  • The MBM cardinality distribution is computed efficiently using a discrete Fourier transform because Bernoulli cardinality distributions convolve.Source: B. Estimator 2 · p. 11
  • After selecting the cardinality-constrained hypothesis, the estimate uses the means of its Bernoulli components with the highest existence probabilities.Source: B. Estimator 2 · p. 11

C. Estimator 3

Estimator 3 selects the highest-weight global hypothesis with deterministic cardinality and reports the means of its existing Bernoulli components. In the challenging simulation, PMBM-based estimators performed strongly, with Estimator 1 lowest and Estimators 2 and 3 similar.

C. Estimator 3

  • Estimator 3 selects the global hypothesis with deterministic cardinality having the highest weight.Its deterministic cardinality is obtained by expanding each Bernoulli component into existence and non-existence alternatives.Source: C. Estimator 3 · pp. 11–12
  • The resulting set estimate reports the means of Bernoulli components whose existence probabilities exceed 0.5.Source: C. Estimator 3 · p. 12

VII. Simulations

  • 81 time steps and 100 Monte Carlo runs were used to evaluate root mean square OSPA error in a four-target scenario with clutter and target proximity.The scenario includes a target death at time step 40 while targets are in close proximity.Source: §VII · p. 12, Figure 3 · p. 12
  • Estimator 1 applied to PMBM provides the lowest errors, while Estimators 2 and 3 behave similarly.MOMB performs as accurately as PMBM Estimators 2 and 3 in this scenario.Source: §VII · p. 12, Figure 4 · p. 13
  • Across detection probabilities, PMBM performs better than the other filters regardless of estimator.Estimator 1 is better for pd equal to or above 0.9, whereas Estimator 2 is best for lower pd values.Source: §VII · p. 12

VIII. Conclusions

  • The paper concludes that PMBM outperforms the compared filters in the challenging scenario, while its multi-Bernoulli mixture parameterisation is more efficient than the δ-GLMB form.Source: §VIII · pp. 12–13

APPENDIX A

Appendix A proves the relevant likelihood identity by induction over measurement and target-set components. The proof separately handles the cases of adding a measurement-associated component and a target component.

APPENDIX A

  • The appendix uses induction to prove the stated likelihood result.Source: Appendix A · p. 13
  • The proof establishes equality between the likelihood forms l and l_s for finite measurement and target sets.Source: Appendix A · p. 13
  • The induction step treats terms involving a new measurement through the corresponding likelihood factors and reduced sets.Source: A. First part · pp. 13–14
  • A second induction case handles the addition of a target component and removes that component from the remaining target set.Source: B. Second part · p. 14

APPENDIX B

Appendix B derives the update of a Poisson prior and proves the prediction result for an MBM representation. The predicted density remains an MBM when survival and birth components are convolved.

APPENDIX B

  • The appendix derives the Poisson-prior update yielding the parameters in equations (16)–(24).Source: Appendix B · p. 14
  • The proof of equation (27) proceeds by induction, beginning with the zero-component case.Source: Appendix C · p. 14
  • The induction separately handles an empty added component and a singleton target component.Source: Appendix C · p. 15
  • For MBM births, the prediction combines the MBM density of surviving targets with the MBM density of new births using convolution.Source: Appendix D · p. 15
  • The resulting predicted density corresponds to an MBM.Source: Appendix D · p. 15

APPENDIX E

Appendix E establishes the equivalence between labelled MBM representations and δ-GLMB densities. A δ-GLMB global hypothesis maps to Bernoulli components with deterministic existence probabilities, making it a labelled MBM special case.

APPENDIX E

  • The appendix first writes a labelled MBM, including the labelled MBM01 case, in δ-GLMB form.Source: Appendix E · pp. 15–16
  • Both densities vanish for repeated labels or labels outside the label space, while distinct valid labels yield the equivalence.Source: Appendix E · p. 15
  • The reverse direction writes a δ-GLMB density as a labelled MBM with the MBM01 parameterisation and normalized global-hypothesis weights.Source: Appendix E · pp. 15–16
  • A δ-GLMB global hypothesis is indexed by a hypothesis and label subset, with labels in the subset existing and the rest absent.Source: Appendix E · p. 16
  • The corresponding Bernoulli existence probabilities are deterministic: 1 for included labels and 0 for excluded labels.Source: Appendix E · p. 16
  • The δ-GLMB mixture components are equivalent to global hypotheses in an MBM01 parameterisation, whose target existence is deterministic.Source: Appendix E · p. 16

Related papers

Loading 1703.04264v4…