17. The method of claim 13 , wherein the objective of the first round of association of the second level is formulated as a maximum a posteriori (MAP) problem.
18. The method of claim 17 , further comprising transforming the MAP problem into an assignment problem in a way that distinguishes between true trajectories and false alarm trajectories using a Hungarian algorithm.