{'fraction_non_alphanumeric': 0.01443001443001443, 'fraction_numerical': 0.004329004329004329, 'mean_word_length': 4.931623931623932, '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}}
Computational video editing model based on optimization with constraint-satisfaction

This paper presents a novel video editing model. In this model, a video is considered as a sequence of small boxes each of which has a length of 0.5 or 1 second, and editing is defined as the problem of filling each box with an appropriate shot. Each editing rule is implemented independently of the others, as an evaluation function or a constraint for choosing shots and arranging shots. This formalism enables easy and systematic editing investigation by including or excluding editing rules. We implemented this model in an actual video editing system and verified its usefulness for multiangled videos.