{'fraction_non_alphanumeric': 0.038751345532831, 'fraction_numerical': 0.02045209903121636, 'mean_word_length': 5.118421052631579, '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}}
Long-Rood motion estimation algorithm based on starting search point prediction

Motion estimation algorithm is the most complicated and time consuming part of the video codec. A novel fast block matching motion estimation algorithm named Long-Rood fast motion estimation algorithm based on starting search point prediction is proposed for real-time video coding. To validate the performance, a number of standard test sequences are used. Simulation results demonstrate that the proposed algorithm dramatically outperforms the Exhaustive Search (ES), the Three-Step Search (TSS), the Diamond Search (DS) and the Adaptive Rood Pattern Search (ARPS) algorithms. The simulation results show that the proposed algorithm is about 3.33∼17.12 times faster than that of TSS, 2.12∼8.99 times faster than that of DS, and 1.15∼4.42 times faster than ARPS, while achieving close performance in terms of the Peak Signal-to-Noise Ratio (PSNR).