{'fraction_non_alphanumeric': 0.020118343195266272, 'fraction_numerical': 0.007100591715976331, 'mean_word_length': 4.957746478873239, '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}}
Macroblock sampling and mode ranking for complexity scalability in mobile H.264 video coding

We propose a framework for complexity scalability in H.264. The prediction is constrained so that only a subset of prediction modes are tested. The test subset is found by ranking the most “popular” modes (those the are most often picked as best) and selecting the modes that maximize their expected occurrence frequency given a complexity constraint. Ranking is performed by selecting a small set of macroblocks (the sampling population), for which all modes are tested. The remaining macroblocks only test the available dominant modes. The modes in the sampling population of a frame are used to process the next frame. Results are shown to verify the performance of the proposed method, which reveals sizeable complexity savings at small penalties.