{'fraction_non_alphanumeric': 0.013966480446927373, 'fraction_numerical': 0.0074487895716946, 'mean_word_length': 5.437125748502994, '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}}
Fast motion estimation algorithm using unequal search effort for H.264|MPEG-4 AVC encoder

H.264IMPEG-4 AVC allows multiple reference frames and multiple partition types to improve the coding performance at the expense of much higher computation complexity. This paper proposes a fast motion estimation (ME) algorithm to reduce search complexity for this demanding configuration. Our experimental results show that the partition type which gives the lowest matching cost for the reference frame closest to the current picture in temporal domain is likely to be the best partition type for all reference frames. Based on this finding, the proposed method performs a less complicated search effort for the other partition types on the remaining reference frames to obtain significant savings in search complexity. This approach can be easily modified to support any existing fast search algorithms. Simulation results show the proposed algorithm significantly reduces the overall motion search complexity and at the same time, maintains minimum coding performance degradation.