{'fraction_non_alphanumeric': 0.018121911037891267, 'fraction_numerical': 0.0, 'mean_word_length': 5.230769230769231, '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}}
A parallel algorithm for tracking of segments in noisy edge images

We present a parallel implementation of a probabilistic algorithm for real time tracking of segments in noisy edge images. Given an initial solution-a set of segments that reasonably describe the input binary edge image-,the algorithm efficiently updates the parameters of these segments to track the movements of objects in the image in successive image frames. The proposed method is based on the EM algorithm-a technique for parameter estimation of statistical distributions in presence of incomplete data-,used here to estimate the parameters of a mixture density. The algorithm is highly susceptible of parallelization, because of the uncoupled nature of the computations needed on its main data structures. This property is exploited in order to make an efficient version for parallel distributed memory environments, under the message passing paradigm. We carefully describe the details of the implementation, and finally, we show an evaluation of the algorithm in a NOW (network of workstations), using the standard message passing interface (MPI) library. Our evaluation shows that the reached speedup is very close to the ideal optimum.