{'fraction_non_alphanumeric': 0.019498607242339833, 'fraction_numerical': 0.002785515320334262, 'mean_word_length': 5.493975903614458, '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}}
Forward/backward adaptive context selection with applications to motion vector field encoding

In low rate motion-compensated video coding, the rate required to encode the motion field can become a significant portion of the overall rate budget. This motivates us to investigate methods to efficiently, and losslessly, encode the motion field. Reductions in the required motion field bit rate allow increasing the rate for the residue images or may permit a higher density motion field to be used. We consider adaptive context modeling techniques, such as those proposed in image coding applications, and explore their effectiveness for coding the motion data. We rely on various forward/backward context selection algorithms, and demonstrate how forward adaptation, based on alphabet partitioning approaches, can result in performance improvements over purely backward adaptive methods. We observe substantial reductions in rate, especially for dense motion fields, when comparing with popular differential coding schemes using VLC tables, such as those in the H.263 standard.