{'fraction_non_alphanumeric': 0.021636876763875823, 'fraction_numerical': 0.007525870178739417, 'mean_word_length': 5.258823529411765, '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 New Approach for Image Classification Applying Reduction of Colored Keypoints

There are algorithms for feature extraction such as SIFT and Opponent-SIFT, which detect and describe keypoints. In image classification, it is common to have an image dataset. Therefore, when using an algorithm to detect and describe local features in a set of images, the number of keypoints detected by class can be disproportionate. This paper presents a novel approach to reduce the number of keypoints (and colored keypoints) in images after the feature extraction process so that computer vision techniques can be applied to image classification problems. This approach uses Zipf’s Law and the Pareto Principle to conduct the new strategy to reduce keypoints. An experiment was conducted comparing four different strategies. Results are encouraging, and the proposal opens new paths for keypoints reduction and syntactical pattern recognition. The classification reached an F-Measure of 76,8%, and the computer performance (execution time) has increased from 9 to 1900 times.