{'fraction_non_alphanumeric': 0.018718502519798418, 'fraction_numerical': 0.0007199424046076314, 'mean_word_length': 5.233183856502242, '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}}
Adaptive scheme for classification of MPEG video frames

In this paper, we describe our recent work attempting to improve the motion estimation and compensation performance in MPEG, without introducing any significant computing cost. To achieve low complexity, MPEG used fixed frame classification or allocation of I, B, P-frames to do the motion estimation and compensation. By introducing an adaptive mechanism to connect the frame content and previous record analysis with the arrangement of video frames, the classification inside the video stream can be determined according to the nature of its content in relation to those neighboring video frames. During this process, records of motion estimation and compensation for previous frames are taken into consideration to form a basis of analysis. As a result, a histogram of those major directions is formulated to allow information flow being analyzed before the frame is classified. Thresholds are then applied along the analyzed direction to video frames, and their classification of I, B, or P-frames is determined on the fly. Hence, the performance of motion estimation and compensation can be improved towards the whole compression system. Extensive experiments are carried out to support our work and the results reported show that our proposed method outperforms the existing MPEG-2 scheme, when assessed in mean-square-errors.