{'fraction_non_alphanumeric': 0.02089864158829676, 'fraction_numerical': 0.0010449320794148381, 'mean_word_length': 5.0251572327044025, '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}}
Universal distance measure for images

We introduce an algorithm for measuring the distance between two images based on computing the complexity of two strings of characters that encode the images. Given a pair of images, our algorithm transforms each one into a text-based sequence (strings) of characters. For each string, it computes the LZ-complexity and then uses the string-distance measure of [1] to obtain a distance value between the images. The main advantages of our algorithm are that it is universal, that is, it neither needs nor assumes any spatial or spectral information about the images, it can measure the distance between two images of different sizes, it works for black and white, grayscale and color images, and it can be implemented efficiently on an embedded computer system. We present successful experimental results on clustering images of different sizes into categories based on their similarities as measured by our algorithm.