New multitarget tracking algorithm based on cinematic grouping

Details New multitarget tracking algorithm based on cinematic grouping New multitarget tracking algorithm based on cinematic grouping

Jun 1997

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1997spie.3086..296h&link_type=abstract

Proc. SPIE Vol. 3086, p. 296-307, Acquisition, Tracking, and Pointing XI, Michael K. Masten; Larry A. Stockum; Eds.

Statistics

Computation

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

New multitarget tracking algorithm based on cinematic grouping does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with New multitarget tracking algorithm based on cinematic grouping, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New multitarget tracking algorithm based on cinematic grouping will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1481598