{'fraction_non_alphanumeric': 0.016891891891891893, 'fraction_numerical': 0.0008445945945945946, 'mean_word_length': 5.370967741935484, '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}}
Bidirectional motion estimation via vector propagation

A low-complexity vector propagation (VP) algorithm is introduced for the estimation of bidirectional motion vector fields in image sequences. The proposed VP algorithm exploits the strong correlation between forward and backward motion vector fields in image sequences. The performance of the VP algorithm is compared to that of a bidirectional multiresolution block-matching (MRBM) motion estimation (ME) algorithm. Computer simulation results demonstrate that with the VP algorithm, the computational workload of the bidirectional ME is reduced by a factor of nearly 2. The robustness of the VP algorithm is extensively tested using computer generated image sequences and real movies for a motion picture restoration (MPR) system. It is shown that the VP algorithm is robust enough to be used in the computationally demanding MPR algorithm, in which the performance of the novel VP algorithm is close to that of a bidirectional MRBM ME algorithm. With this technique, other video processing systems that desire to take advantage of bidirectional motion estimation can now do so without an excessive increase in computing time.