New multitarget tracking algorithm based on cinematic grouping
Laurent Hérault · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1997
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.