Multiple scan data association by convex variational inference
Jason L. Williams, Roslyn A. Lau

TL;DR
This paper introduces a convex variational inference approach for multiple scan data association in target tracking, addressing non-convexity issues in belief propagation and providing a convergent algorithm with practical applications.
Contribution
It develops a convex free energy formulation for multiple scan data association and proposes a BP-like algorithm that improves over existing non-convex methods.
Findings
Convex free energy improves data association accuracy.
Proposed algorithms demonstrate effective target localization.
Sequential variant retains consistency across scans.
Abstract
Data association, the reasoning over correspondence between targets and measurements, is a problem of fundamental importance in target tracking. Recently, belief propagation (BP) has emerged as a promising method for estimating the marginal probabilities of measurement to target association, providing fast, accurate estimates. The excellent performance of BP in the particular formulation used may be attributed to the convexity of the underlying free energy which it implicitly optimises. This paper studies multiple scan data association problems, i.e., problems that reason over correspondence between targets and several sets of measurements, which may correspond to different sensors or different time steps. We find that the multiple scan extension of the single scan BP formulation is non-convex and demonstrate the undesirable behaviour that can result. A convex free energy is constructed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
