Share Email Print

Proceedings Paper

Classical and neural solutions for plot-to-track association
Author(s): Michel Winter; Valerie Schmidlin; Gerard Favier
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

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.

Paper Details

Date Published: 29 October 1997
PDF: 12 pages
Proc. SPIE 3163, Signal and Data Processing of Small Targets 1997, (29 October 1997); doi: 10.1117/12.279537
Show Author Affiliations
Michel Winter, Univ. of Nice-Sophia Antipolis (France)
Valerie Schmidlin, Univ. of Nice-Sophia Antipolis, and Systelia Technologies (France)
Gerard Favier, Univ. of Nice-Sophia Antipolis (France)

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

© SPIE. Terms of Use
Back to Top