Paper
16 April 2008 Determining the optimal time frame for multisensor track correlation
Author Affiliations +
Abstract
Conventional algorithms for track association (termed "correlation" by convention) employ algorithms which are applied to all sensor tracks at a specific time. The overall value of sensor networks for data fusion is closely tied to the reliability of correct association of common objects tracked by the sensors. Multisensor architectures consisting of gaps in target coverage requires that tracks must be propagated substantially forward or backward to a common time for correlation. This naturally gives rise to the question: at which time should track correlation be performed? In the conventional approach, a two-sensor correlation problem would be solved by propagating the first sensor's tracks forward to the update time (current time) of the tracks from the second sensor. We question this approach by showing simulation results that indicate that the current time can be the worst time to correlate. In addition, a methodology for calculating the approximate optimal correlation time for linear-Gaussian tracking problems is provided.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Lisa M. Ehrman, Paul D. Burns, and W. Dale Blair "Determining the optimal time frame for multisensor track correlation", Proc. SPIE 6969, Signal and Data Processing of Small Targets 2008, 69690R (16 April 2008); https://doi.org/10.1117/12.783107
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Sensors

Mahalanobis distance

3D acquisition

Detection and tracking algorithms

Missiles

Sensor networks

Data fusion

Back to Top