Simple paper, nothing special.
What’s important is that it combines CNN + Kalman Filter +
Hungarian Maximum Matching Algorithm | Brilliant Math & Science Wiki
The Hungarian algorithm can also be executed by manipulating the weights of the bipartite graph in order to find a stable, maximum (or minimum) weight matching.
https://brilliant.org/wiki/hungarian-matching/
This is an algorithm that uses matrix operation to speed up matching. Very interesting.