{'fraction_non_alphanumeric': 0.016194331983805668, 'fraction_numerical': 0.0, 'mean_word_length': 5.288135593220339, '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 Fast Algorithm for Near-Duplicate Image Detection

Due to the popularity of digital image devices, the number of photos has increased dramatically. Because there are many photos with similar contents, the technology of detecting similar image is beneficial to the field of data storage, image retrieval and information security. This paper proposes an improved algorithm for near-duplicate image detection that not only utilizes the global feature of the color histogram, but also take into account of local complexity based on Entropy. It improves the accuracy of near-duplicate image detection without the increase of computing greatly. The experimental results on the image datasets indicate the effectiveness of the proposed algorithm.