{'fraction_non_alphanumeric': 0.031578947368421054, 'fraction_numerical': 0.009210526315789473, 'mean_word_length': 4.765151515151516, '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}}
Variable step search algorithm for motion estimation

Motion estimation (ME) is a key technique in interframe coding. It is the basis of most compression algorithms for video compression, such as the CCITT standard H. 261, and MPEG 2. The performance of ME is decided by two factors: (1) the estimation exactitude; and (2) the computational load. The full search algorithm is the optimal one for the first factor, but it requires extensive computations. To reduce the computational complexity, many efficient search algorithms have been proposed. The one step at a time search (OSATS) is the second most efficient algorithm, but it becomes inefficient when the search window is greater than 4 pels/frame. The aim of this paper is to overcome this disadvantage.