New multitarget tracking algorithm based on cinematic grouping

Laurent Herault

doi:10.1117/12.277195

23 June 1997 New multitarget tracking algorithm based on cinematic grouping

Laurent Herault

Proceedings Volume 3086, Acquisition, Tracking, and Pointing XI; (1997) https://doi.org/10.1117/12.277195
Event: AeroSense '97, 1997, Orlando, FL, United States

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.

Citation Download Citation

Laurent Herault "New multitarget tracking algorithm based on cinematic grouping", Proc. SPIE 3086, Acquisition, Tracking, and Pointing XI, (23 June 1997); https://doi.org/10.1117/12.277195

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available