{'fraction_non_alphanumeric': 0.011811023622047244, 'fraction_numerical': 0.0, 'mean_word_length': 5.35625, '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}}
A principled approach to fast partitioning of uncompressed video

One basic technique often used to reduce the huge computation involved in video partitioning is by selective processing of a subpart of the video frames. However, the choice of this proportion has so far been made randomly, without any formal basis. An ad hoc selection of this subpart cannot always guarantee a reduction in computation while ensuring effective partitioning. The paper argues for a principled basis for the selection of such parameters to ensure effective and efficient partitioning of video sequences. It presents a formal method for determining the optimal window size and the minimum thresholds which ensure that decisions on scene similarity are made on a reliable, effective and principled basis. To account for illumination variations and possible motion in the video, the use of neighbourhood-based colour ratio features is proposed, which avoids the huge computational requirements of explicit motion compensation operations.