Share Email Print

Optical Engineering

On optimal synchronous and asynchronous track fusion
Author(s): Ali T. Alouani; Theodore R. Rice
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In practice, multisensor systems use dissimilar sensors that may have different data rates. Such sensors may also have inherent delays due to multitasking as well as communication delays between the sensor platform and a remote central processing site. Track fusion algorithms are presented that are valid for asynchronous sensors (the sensors have different data rates and different delays) as well as synchronous sensors (all of the sensors take measurements at the same time and the same rate with no delays). The asynchronous track fusion problem is formulated and solved first. Then the synchronous track fusion problem is obtained as a special case of the asynchronous one. Finally, using simulated target tracks, the performance of the asynchronous track fusion (ASTF) algorithm is analyzed and compared to an existing track fusion algorithm. Different sensor data rates and communication delays are used in the simulations. It is found that the ASTF algorithm outperforms its counterpart and is able to handle relatively large communication delays. The results presented set the foundation for deriving optimal track fusion algorithms when taking into account realistic constraints such as sensors with different data rates and different communication and/or processing delays. The results can also be used as a benchmark to evaluate existing suboptimal track fusion algorithms.

Paper Details

Date Published: 1 February 1998
PDF: 7 pages
Opt. Eng. 37(2) doi: 10.1117/1.601628
Published in: Optical Engineering Volume 37, Issue 2
Show Author Affiliations
Ali T. Alouani, ennessee Technological Univ. (United States)
Theodore R. Rice, Naval Surface Warfare Ctr. (United States)

© SPIE. Terms of Use
Back to Top