{'fraction_non_alphanumeric': 0.01882845188284519, 'fraction_numerical': 0.0, 'mean_word_length': 5.337748344370861, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Tracking in streamed video by updating globally optimal matchings

Matching methods such as the Hungarian algorithm have recently made an appearance as an alternative to classical tracking algorithms in computer vision, since they are able to find the set of tracks that optimizes well-defined criteria over a given video sequence. However, despite being globally optimal, they carry a cost: since they require complete knowledge of the sequence, such methods cannot work with continuous video streams, a crucial requirement of realistic video surveillance applications. We were able to use the recently proposed Dynamic Hungarian Algorithm in an innovative way, adapting it to the well-known sliding window methodology. The algorithm is able to run in real-time, while retaining its optimality. We tested our implementation on several datasets, tracking humans and vehicles, and obtained reliable results using the same set of parameters on all sequences.