Translator Disclaimer
29 October 1997 Classical and neural solutions for plot-to-track association
Author Affiliations +
This paper presents and compares two alternative classes of solutions to the plot-to-track association problem. The first class of solutions relies on classical approaches of signal processing, principally based on the Bayes theory, that is to say the nearest- neighbor filter, the probabilistic data association filter and the joint probabilistic data association filter. The data association problem can be reduced to a combinatorial optimization problem, for which the time needed to obtain the exact solution grows drastically with the problem size. This is the reason why, in most cases, we do not look for the best solution, but rather for a good solution, reachable in a reasonable computation time. Consequently, neural networks are an interesting alternative to classical solutions. We first review several neural models: Hopfield networks, Boltzmann machine, mean filed approximation networks and our approach derived from the Hopfield model. Then we present some simulation results that enable to compare the various techniques for a general assignment problem and for the multitarget tracking problem.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Michel Winter, Valerie Schmidlin, and Gerard Favier "Classical and neural solutions for plot-to-track association", Proc. SPIE 3163, Signal and Data Processing of Small Targets 1997, (29 October 1997);


Survey of neural networks as applied to target tracking
Proceedings of SPIE (June 22 1997)
Target tracking with multipoint predictive neural network
Proceedings of SPIE (September 15 1992)
Stanford neural network research
Proceedings of SPIE (August 18 1993)
Blind source separation of convolutive mixtures
Proceedings of SPIE (April 16 2006)
Hands free device control using sound picked up in the...
Proceedings of SPIE (April 28 2008)

Back to Top