{'fraction_non_alphanumeric': 0.025365853658536587, 'fraction_numerical': 0.007804878048780488, 'mean_word_length': 5.071005917159764, '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}}
On the benefits of leaf merging in quad-tree motion models

In the field of image coding, it has recently been shown that quad-tree schemes for representing geometric image features are unable to obtain the optimal exponentially decaying rate-distortion behaviour - a problem which can be rectified by following R-D optimal tree pruning with a leaf merging step. Inspired by such results, we note that quad-tree based motion representations for video compression suffer from the same fundamental shortcomings, which can again be overcome by leaf merging. Based on these observations, we describe a non-iterative low complexity extension to the existing motion model used by H.264, demonstrating significant improvements in overall compression performance. At low to moderate bit-rates, our experimental implementation yields reductions of 10% or more in overall bit-rate, relative to H.264. Perhaps more importantly, this paper reinforces the importance of leaf merging as a general tool for quad-tree based modeling schemes.