Search

Passive tracking relies on detection of energy emitted by zero or more targets in surveillance space. When detection occurs, the angle of arrival, or the angle between the sensor and the possible target is measured, with a measurement error. Both targets and sensors can be moving, thus additional source of error is the sensor position uncertainty. If the targets emit beams of energy randomly, then each sensor will detect each target at random times, which are independent from sensor to sensor. False detections of clutter measurements also occur at random times for each sensor. Existence, number, and position of targets are unknown in the surveillance region. The origin of each measurement is unknown, as the measurement may be a detection from any target being tracked, or a clutter detection, or a detection from a new target. The recursive algorithm presented integrates information from measurements received by an arbitrary number of sensors, to determine the existence, number, and position of targets in a stochastic manner, given assumptions listed above. Simulations show the effectiveness of this approach in a multi-target scenario.

When tracking targets using radars and sonars, the number of targets and the origin of data is uncertain. Data may be false measurements or clutter, or they may be detections from an unknown number of targets whose possible trajectories and detection processes can only be described in a statistical manner. Optimal all-neighbor multi-target tracking (MTT) in clutter enumerates all possible joint measurement-to-track assignments and calculates the a posteriori probabilities of each of these joint assignments. The numerical complexity of this process is combinatorial in the number of tracks and the number of measurements. One of the key differences between most MTT algorithms is the manner in which they reduce the computational complexity of the joint measurement-to-track assignment process. We propose an alternative approach, using a form of soft assignment, that enables us to bypass this step entirely. Specifically, our approach treats possible detections of targets followed by other tracks as additional clutter measurements. It starts by approximating the a priori probabilities of measurement origin. These probabilities are then used to modify the clutter spatial density at the location of the measurements. A suitable single target tracking (STT) filter then uses the modified clutter intensity for updating the track state. In effect, the STT filter is transformed into an MTT filter with a numerical complexity that is linear in the number of tracks and the number of measurements. Simulations show the effectiveness of this approach in a number of different multi-target scenarios.

We describe three single-scan probabilistic data association (PDA) based algorithms for tracking manoeuvering targets in clutter. These algorithms are derived by integrating the interacting multiple model (IMM) estimation algorithm with the PDA approximation. Each IMM model a posteriori state estimate probability density function (pdf) is approximated by a single Gaussian pdf. Each algorithm recursively updates the probability of target existence, in the manner of integrated PDA (IPDA). The probability of target existence is a track quality measure, which can be used for false track discrimination. The first algorithm presented, IMM-IPDA, is a single target tracking algorithm. Two multitarget tracking algorithms are also presented. The IMM-JIPDA algorithm calculates a posteriori probabilities of all measurement to track allocations, in the manner of the joint IPDA (JIPDA). The number of measurement to track allocations grows exponentially with the number of shared measurements and the number of tracks which share the measurements. Therefiwe, IMM-JIPDA can only be used in situations with a small number of crossing targets and low clutter measurement density. The linear multitarget IMM-IPDA (IMM-LMIPDA) is also a multitarget tracking algorithm, which achieves the multitarget capabilities by integrating linear multitarget (LM) method with IMM-IPDA. When updating one track using the LM method, the other tracks modulate the clutter measurement density and are subsequently ignored. In this fashion, LM achieves multitarget capabilities using the number of operations which are linear in the number of measurements and the number of tracks, and can be used in complex scenarios, with dense clutter and a large number of targets.

A fully automatic tracking algorithm must be able to deal with an unknown number of targets, unknown target initiation and termination times, false measurements and possibly time-varying target trajectory behaviour. An efficient algorithm for tracking in this environment is presented here. This approach makes use of estimates of the probability of target existence, which is an integral part of the algorithm. This allows for the efficient generation and management of possible target hypotheses, yielding an algorithm with performance that matches what can be obtained by multiple hypothesis tracking-based approaches, but at a significantly lower computational cost. This paper considers only the single target case for clarity. The extension to multiple targets is easily incorporated into this framework. Simulation studies are given that show the effectiveness of this approach in the presence of heavy and nonuniform clutter when tracking a target in an environment of low probability of detection and in an environment where the target performs violent manoeuvres.

When detecting a target using radar in the presence of multipath fading, the signal to noise ratio (SNR) at receiver can be dramatically reduced at certain ranges due to multipath signal cancellation, which leads to a significant drop of the detection probability at those ranges. The detection of a low elevation sea-surface target (LESST) is one example. For target tracking, this special case contrasts to the usual situation where we may often assume a constant probability of detection. Automatic target tracking requires a measure of track quality to discriminate between true and false tracks. This track quality measure should take both the existence of target and the SNR of the sensor into account, and be consistent with tracking performance. This paper investigates automatic target tracking using the integrated probabilistic data association (IPDA) type filters in the presence of multipath fading. Several existing single-scan probabilistic data association (PDA)-based filters, which calculate the probabilistic measure of track quality while estimating the track state, are evaluated in the scenario of tracking a nonmaneuvering LESST in the presence of both multipath fading and clutter. In addition, a variable Markov chain (VMC) IPDA tracker (IPDA-VMC), which has joint merits of both IPDA and the IPDA with a three state Markov chain (IPDA-M2), has been designed and evaluated here. In the derivation of track quality measure of both IPDA-M2 and IPDA-VMC, the possibility that a target is present but is temporarily unable to be detected has been explicitly considered. A tracker using this track quality measure for false track discrimination has significantly improved LESST tracking performance. A simulation study verifies that both IPDA-M2 and IPDA-VMC have better capability to handle the LESST tracks and have an improved tracking performance over other PDA-based tracking algorithms under consideration.

A new recursive filter for multi-target tracking in clutter is presented. Multiple tracks may share the same measurement(s). Joint events are formed by creating all possible combinations of track-measurement assignments and the probabilities for these joint events are calculated. The expressions for the joint event probabilities incorporate the probabilities of target existence of individual tracks, an efficient approximation for the cluster volume and a priori probability of the number of clatter measurements in each cluster. From these probabilities the data association and target existence probabilities of individual tracks are obtained, which allows track state update and false track discrimination. A simulation study is presented to show the effectiveness of this approach.

This paper considers the problem of forming and maintaining tracks when measurements have both uncertain origin and are corrupted by additive sensor noise. The spatial clutter measurement density is assumed nonhomogenous and known. The IPDA-MAP algorithm provides a set of recursive formulae for data association and probability of target existence, thus enabling automatic track initiation, track maintenance, and track termination. New values for initial probability of target existence for IPDA-type algorithms are also derived. Simulation results compare the performance of IPDA-MAP with IPDA, IMM-PDA, IMM-PDA-MAP, EB-PDA and EB-PDA-MAP in a heavy and nonuniform clutter situation.