{'fraction_non_alphanumeric': 0.019522776572668113, 'fraction_numerical': 0.0, 'mean_word_length': 5.59047619047619, '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}}
BE-SIFT: A More Brief and Efficient SIFT Image Matching Algorithm for Computer Vision

In the area of computer vision, pattern recognition and image processing, image match is a research hotspot with important theoretical significance and practical value. Recently, the image matching algorithm based on SIFT has drown wide attention for its outstanding local feature matching performance. In view of high computation complexity, poor anti-noise ability, and difficulty for practical use of the original SIFT method, a more brief and efficient SIFT image matching algorithm: BE-SIFT is proposed in this paper for computer vision. Through collaborative improvement and optimization on detection of SIFT scale space feature points, allocation of key point principal direction, and calculation of feature descriptors, the proposed method has achieved more brief dimension expression and more efficient local feature match than other existing methods. Experiments based on the Affine Covariant Features dataset provided by Oxford VGG Group demonstrate that BE-SIFT has stronger robustness for image match under the condition of viewpoint changes, rotation + scale changes, blur changes and noise changes. What's more, the computational overhead is sharply reduced and the real-time performance is greatly improved while ensuring the uniqueness of local feature and satisfactory accuracy.