{'fraction_non_alphanumeric': 0.031209362808842653, 'fraction_numerical': 0.010403120936280884, 'mean_word_length': 4.923076923076923, '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}}
Low-bit-rate generalized quad-tree motion compensation algorithm and its optimal encoding schemes

Quad-tree structured motion-compensation technique effectively utilizes the motion content of a frame as opposed to fixed size block motion compensation technique. In this paper, we propose a novel quad-tree-structured region-wise motion compensation technique that divides a frame into equivalent triangle blocks using the quad-tree structure. Arbitrary partition shapes are achieved by allowing 4-to-1, 3-to-1 and 2-1 merge/combine of sibling blocks having the same motion vector. We propose an optimal code scheme and a temporal predictive coding for the quad- tree. Simulation results show that our techniques reduce the bit rate by 40% as compared to other methods.