{'fraction_non_alphanumeric': 0.013223140495867768, 'fraction_numerical': 0.001652892561983471, 'mean_word_length': 5.340314136125654, '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}}
Point Pattern Feature Matching Method Based on Polar Coordinate

Infrared label point feature matching is one of the basic problems in the application direction of computer vision, pattern recognition and robot navigation and positioning. First, the center of the label point set and the weighted distance center are obtained in Cartesian coordinates, then the Cartesian coordinates are converted into polar coordinates to construct the position information feature vector of the label point set. Finally, using the method of spatial geometric constraints to compare each point in the label code to the feature vector, the matching result of the label code point set is obtained. The contributions of this paper are as follows: 1. A feature vector of label point set based on polar coordinate transformation is constructed, which makes the feature vector invariant to rotation, translation and illumination. 2. Using the combination of feature vector and spatial geometric constraints to screen label point pairs can effectively overcome the adverse effects of outlier points and noise. The final experiments demonstrate the effectiveness and robustness of the polar coordinate feature matching of label codes.