{'fraction_non_alphanumeric': 0.010526315789473684, 'fraction_numerical': 0.006015037593984963, 'mean_word_length': 5.110091743119266, '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 in a GPU of the Calculation of Disparity Maps for Computer Vision

The high computational cost in computing disparity maps has relegated their use in real-time computer vision tasks. This work shows the design of a parallel algorithm for the generation of disparity maps which decreases the redundant operations during the stereo matching process. The proposed algorithm also uses a median filter to decrease the noise present in the generated disparity map, achieving an acceleration of 1135x on a GPU. In addition to the implementation of the parallel algorithm, GPU resources were used to improve memory access time and code optimization.