{'fraction_non_alphanumeric': 0.01820250284414107, 'fraction_numerical': 0.0, 'mean_word_length': 5.3768115942028984, '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}}
An effective three-step search algorithm for motion estimation

In order to reduce the computational complexity for motion estimation and improve the reliability of the image sequences for super-resolution reconstruction, an effective three-step search algorithm is presented. Based on the center-biased characteristic and parallel processing of the motion vector, the new algorithm adopts the multi-step search strategy. In the region where the best matching points exist, the small square template which is used in the new three-step search algorithm is replaced by a small diamond template which improves the search accuracy. Experimental results show that, compared with the full search algorithm, diamond search algorithm and the predictive diamond search algorithm, the new algorithm not only ensures the search accuracy but also reduces calculation time by a large margin.