{'fraction_non_alphanumeric': 0.024943310657596373, 'fraction_numerical': 0.003779289493575208, 'mean_word_length': 5.245283018867925, '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}}
Parallel Implementation for Real Time Person Matching System

Local Binary Pattern multi-scale covariance descriptor (LBP_MSCOV) has been proved to be robust for video surveillance applications such as person detection, tracking and re-identification. Matching technique has recently grown in interest. It can be used to design person detection, tracking and re-identification. However, the original version is difficult to execute in real time. It requires a large data set and complex operations. Parallel implementation is adopted to achieve real time constraints. In this paper, we propose an optimized parallel model of a person matching algorithm based on LBP_MSCOV. For this end, a high-level parallelization approach based on the exploration of task and data levels of parallelism is adopted. First, an initial model is defined using only task-level parallelism. Second, this model is validated and analyzed at a high level of abstraction. Using the communication and computation workload results, the potential bottlenecks of this model are then identified. Concurrent optimizations are then performed to propose an optimized parallel model with the best workload balance. Finally, this model is validated and prototyped using a dual-core ARM-Cortex-A9architecture achieving up to 20.21 fps processing performance.