Share Email Print

Proceedings Paper

New multitarget tracking algorithm based on cinematic grouping
Author(s): Laurent Herault
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper presents a new concept of tracking systems, called Cinematic Grouping. The partitioning of the observations at different dates between false alarms and tracks is encoded as a matching problem between association hypotheses. This matching problem can be solved efficiently by using metaheuristics like simulated annealing or pulsed neural networks. Some experiments are presented both on synthetic and real scenarii and a comparison with some classical algorithms, like cheap JPDA is performed. It appears that the approach provides very good results, especially in very complex situations, within a reduced computation effort. In fact, the false alarms are well filtered and the tracks are well initialized and maintained.

Paper Details

Date Published: 23 June 1997
PDF: 12 pages
Proc. SPIE 3086, Acquisition, Tracking, and Pointing XI, (23 June 1997); doi: 10.1117/12.277195
Show Author Affiliations
Laurent Herault, CEA/LETI (France)

Published in SPIE Proceedings Vol. 3086:
Acquisition, Tracking, and Pointing XI
Michael K. Masten; Larry A. Stockum, Editor(s)

© SPIE. Terms of Use
Back to Top