{'fraction_non_alphanumeric': 0.020752269779507133, 'fraction_numerical': 0.010376134889753566, 'mean_word_length': 5.126984126984127, '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}}
Coefficient sign bit compression in video coding

We propose a novel compression technique on signs of DCT coefficients. The proposed technique utilizes a high correlation among pixels at boundaries of a current block and those of neighboring blocks and estimates the original signs. It encodes the difference between the original coefficient signs and the estimated signs. We also propose a speeding up technique for the estimation, utilizing concepts of Gray code and transform matrix decomposition. Compared to JM16.2, the proposed technique reduces 10% bitrate in sign bits of DCT coefficients and achieves 1% BD-bitrate reduction in total bitstream. With the speeding up technique, complexities increase only 8% and 5% on an encoder and a decoder side, respectively.