Paper
3 September 1998 Computational experiences with hot starts for a moving window implementation of track maintenance
Author Affiliations +
Abstract
The use of a multiframe moving for the solution of the data association problem in multisensor-multitarget tracking requires the repeated solution of a multidimensional assignment problem. This problem differs from its predecessor only by the addition of the new scan of measurements. In addition, the multidimensional assignment problem is an MP-hard problem which is large scale and sparse yet has 'real-time' solution requirements. The use of relaxation techniques to solve the multidimensional assignment problem has proven to be an effective scheme within the context of a multiframe moving window. This work demonstrates the improved efficiency that is obtained by the use of hot starts in conjunction with a relaxation method in the data association problem. The idea is to use solution information from the previous frame in conjunction with new information from the current problem to hot start the data association problem. Computational results for various tracking scenarios have shown that hot starts can significantly reduce the amount of time needed to solve the data association problem without affecting solution quality.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Peter J. Shea and Aubrey B. Poore "Computational experiences with hot starts for a moving window implementation of track maintenance", Proc. SPIE 3373, Signal and Data Processing of Small Targets 1998, (3 September 1998); https://doi.org/10.1117/12.324636
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications and 1 patent.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Detection and tracking algorithms

Sensors

Algorithms

Astatine

Data processing

Information operations

Mathematics

RELATED CONTENT


Back to Top