{'fraction_non_alphanumeric': 0.021116138763197588, 'fraction_numerical': 0.0015082956259426848, 'mean_word_length': 5.574257425742574, '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}}
Dense disparity estimation using a hierarchical matching technique from uncalibrated stereo vision

In motion estimation, the sub-pixel matching technique involves the search of sub-sample positions as well as integer-sample positions between the image pairs, choosing the one that gives the best match. Based on this idea, the proposed disparity estimation algorithm performs a 2-D correspondence search using a hierarchical search pattern. The disparity value is then defined using the distance of the matching position. Therefore, the proposed algorithm can process non-rectified stereo image pairs, maintaining the computational load within reasonable levels.