{'fraction_non_alphanumeric': 0.023731587561374796, 'fraction_numerical': 0.0, 'mean_word_length': 5.646739130434782, '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}}
Distributed Implementation for Person Re-Identification

Person re-identification is to associate people across different camera views at different locations and time. Current computer vision algorithms on person re-identification mainly focus on performance, making it unsuitable for distributed systems. For distributed system, computational complexity, network usage, energy consumption and memory requirement are as important as the performance. In this paper, we compare the merits of the current algorithms. We consider three key algorithms Keep It Simple and Straightforward MEtric (KISSME), Symmetry-Driven Accumulation of Local Features (SDALF) and Unsupervised Saliency Matching (USM). The advantage of SDALF, and USM is that they are unsupervised methods so training is not required but computationally many time expensive than KISSME. Saliency based method is superior in performance but also has the longest feature length. As the feature needs to be transmitted from one camera to other in distributed system, this mean higher energy consumption and longer time delay. Among these three, KISSME offers a balance between performance, complexity and feature lengths hence more suitable for distributed systems.