{'fraction_non_alphanumeric': 0.03324468085106383, 'fraction_numerical': 0.015957446808510637, 'mean_word_length': 4.837209302325581, '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}}
Optical Flow in Dynamic Graph Cuts

In this paper, we propose an approach to calculate optical flow by using dynamic graph cuts framework. We use several good ingredients to estimate optical flow. We combine occlusion model for visual correspondence problem (V. Kolmogorov and R. Zabih, 2001) and illumination invariant optical flow (D. Freedman and M.W. Turek, 2005) to achieve robustness given large occlusion and illumination changes. And we make use the dynamic algorithm from (P. Kohli and P.H.S. Torr, 2005) to estimates dynamically changing MRF models of labeling problems in computer vision. The dynamic algorithm is shown faster than standard counterpart, thus promising real time application of graph cuts techniques to estimate optical flow.