Lably
Skip to content

Joint Probabilistic Data Association Filter

  • 2 min read
  • 2 chapters

Related on Lably

Through Expected value, Computer vision and Free and open-source software

The JPDAF is one of several techniques for radar target tracking and for target tracking in the field of computer vision.

The coalescence problem

A common problem observed with the JPDAF is that estimates of closely spaced targets tend to coalesce over time. This is because the MMSE estimate is typically undesirable when target identity is uncertain.

Variants of the JPDAF algorithm have been made that try to avoid track coalescence. For example, the Set JPDAF uses an approximate minimum mean optimal sub pattern assignment (MMOSPA) instead of an approximate MMSE estimator. The JPDAF*, modifies how the target-measurement association probabilities are computed, and variants of the global nearest-neighbor JPDAF (GNN-JPDAF) (a best-hypothesis tracker) use the global nearest neighbor (GNN) estimate in place of the mean but compute the covariance matrix as in the normal JPDAF: as a mean-squared error matrix.

Sign in to keep reading

One more chapter is free with a Lably account.

More in Robotics