Abstract

In certain applications it is sometimes not necessary to detect and track individual targets with accuracy. Examples include applications with very large track densities, in which the overall distribution of forces is of greater interest than individual targets; or group target processing, in which detection and tracking of force-level objects (brigades, battalions, etc.) is of greater interest than detection and tracking of the individual targets which constitute them. The usual strategy is to attempt to detect and track individual targets first and then deduce group behavior from them. The approach described in this paper employs the opposite philosophy: it detects and tracks target groupings first and sorts out individual targets only as data quantity and quality permits. It is based on a multitarget statistical analog of the simplest approximate single-target filter: the constant-gain Kalman filter. Our approximate multitarget filter propagates a first-order statistical moment of the entire multitarget system. This moment, the probability hypothesis density (PHD), is the density function whose integral in any region of state space is the expected number of targets in the region. We describe the behavior of an implementation of the PHD filter in some simple bulk-tracking scenarios.

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