{'fraction_non_alphanumeric': 0.0188953488372093, 'fraction_numerical': 0.007267441860465116, 'mean_word_length': 5.263636363636364, '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 multi-frame reference video encoding with key frames

Enhanced reference picture selection in H.264 enables increasing compression efficiency at the expense of increasing complexity, in other words encoding time. We search how we can select the best multiple reference pictures by a fast, computationally efficient method. We propose a simple histogram-similarity based method for selecting the best set of multiple reference pictures. Out-of-order coding of these frames is implemented by means of pyramid encoding. Experimental results show that the proposed approach can provide encoding time saving up to 22% with similar picture quality and bitrate for selected video sequences.