{'fraction_non_alphanumeric': 0.016283524904214558, 'fraction_numerical': 0.0, 'mean_word_length': 5.220238095238095, '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}}
An improved SIFT algorithm based on adaptive threshold canny

The traditional SIFT algorithm is popular to extract the feature points of target objects, but it also brings the feature points of non-target objects together, leading to mismatching. This paper proposes an improved SIFT algorithm based on adaptive threshold canny operator. In the proposed method, since it has the advantages of accurate edge detection and anti-noise ability, the adaptive threshold canny operator is first employed to detect the edges of an image, and then we can find the feature points by SIFT in the peripheral region of the edges. By introducing the adaptive threshold canny operator, the target objects can be separated from background, largely increasing the matching rate of SIFT algorithm. Experimental results demonstrate that, compared with the traditional SIFT and SURF algorithms, the proposed method can improve the robustness of feature points and further increase the matching rate, meanwhile reducing the cost of running time in a certain extent.