[11] use Maximum Weight Independent Set to merge short tracks of size 2 into full trajectories. Berclaz et al. [12] use a grid of potential spatial locations and formulate their data association problem using the K-Shortest Path algorithm. However, their method does not actively incor- po...