Abstract

In this paper, we explore the performance of the distance-weighting probabilistic data association (DWPDA) approach in conjunction with the loopy sum-product algorithm (LSPA) for tracking multiple objects in clutter. First, we discuss the problem of data association (DA), which is to infer the correspondence between targets and measurements. DA plays an important role when tracking multiple targets using measurements of uncertain origin. Second, we describe three methods of data association: probabilistic data association (PDA), joint probabilistic data association (JPDA), and LSPA. We then apply these three DA methods for tracking multiple crossing targets in cluttered environments, e.g., radar detection with false alarms and missed detections. We are interested in two performance metrics: tracking accuracy and computation time. LSPA is known to be superior to PDA in terms of the former and to dominate JPDA in terms of the latter. Last, we consider an additional DA method that is a modification of PDA by incorporating a weighting scheme based on distances between position estimates and measurements. This distance-weighting approach, when combined with PDA, has been shown to enhance the tracking accuracy of PDA without significant change in the computation burden. Since PDA constitutes a crucial building block of LSPA, we hypothesize that DWPDA, when integrated with LSPA, would perform better under the two performance metrics above. Contrary to expectations, the distance-weighting approach does not enhance the performance of LSPA, whether in terms of tracking accuracy or computation time.

Highlights

  • Since probabilistic data association (PDA) was introduced for tracking in a cluttered environment [1], engineers have been trying to optimize the data association (DA) technique for implementing in a Kalman filter (KF) [2] tracker

  • To develop a robust algorithm that is scalable for tracking multiple objects in clutter, in this paper we examine the performance of the distance-weighting probabilistic data association (DWPDA) [4] in conjunction with the loopy sum-product algorithm (LSPA) [5]

  • We know that LSPA can improve the tracking performance for multiple target tracking (MTT) in densely cluttered environments

Read more

Summary

Introduction

Since probabilistic data association (PDA) was introduced for tracking in a cluttered environment [1], engineers have been trying to optimize the data association (DA) technique for implementing in a Kalman filter (KF) [2] tracker. With the inception of the sum-product algorithm (SPA) [3], a new graphical approach for KF tracking was developed that is more efficient in dealing with the complex problem of multiple target tracking (MTT). To develop a robust algorithm that is scalable for tracking multiple objects in clutter, in this paper we examine the performance of the distance-weighting probabilistic data association (DWPDA) [4] in conjunction with the loopy sum-product algorithm (LSPA) [5]. There are several approaches to tackle this problem, such as the nearest neighbor (NN), PDA, and joint probabilistic data association (JPDA) [1,6,7]. The NN approach is one of the easiest and uses at any time only the nearest measurement to the predicted measurement as if it were the one originated from the target of interest [6]

Objectives
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call