Share Email Print

Proceedings Paper

Neural network implementation of plot/track association
Author(s): William F. Smith
Format Member Price Non-Member Price
PDF $17.00 $21.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

Plot/track association consists of assigning radar plots to predicted track positions and is an important feature of all track while scan systems. We demonstrate the feasibility of applying neural network technology to the plot/track association problem in such a way as to achieve good global solutions. The plot/track association problem can be structured in a basic framework very similar to that of the classic Travelling Salesman Problem (TSP). Hopfield organization networks have been applied to the TSP by various researchers, but with varying degrees of success because of recurring instability problems. The network presented here seeks to minimize a global cost which is a function of the distances between plots in a given scan of data and the predicted track positions. Additionally, in this paper a novel technique is introduced for helping to alleviate the instability of Hopfield networks.

Paper Details

Date Published: 1 October 1990
Proc. SPIE 1305, Signal and Data Processing of Small Targets 1990, (1 October 1990); doi: 10.1117/12.2321775
Show Author Affiliations
William F. Smith, Litton Data Systems (United States)

Published in SPIE Proceedings Vol. 1305:
Signal and Data Processing of Small Targets 1990
Oliver E. Drummond, Editor(s)

© SPIE. Terms of Use
Back to Top