{'fraction_non_alphanumeric': 0.025331724969843185, 'fraction_numerical': 0.0, 'mean_word_length': 5.484375, '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 matching using modified ant colony optimization

This paper proposes an ant colony optimization (ACO) based approach for point pattern matching (PPM) under affine transformation. In the paper, the point sets matching problem is formulated as a mixed variable (binary and continuous) optimization problem. The ACO is used to search for the optimal transformation parameters. There are two contributions made in this paper. Firstly, we manage to modify the original ACO method by combining it with the leastsquares method. Thus, it can handle with the continuous spatial mapping parameters searching. Secondly, we introduce a threshold to correspondence finding, which rejects outliers and enhances veracity while using "Nearest Neighbors Search". Experiments demonstrate the validity and robustness of the algorithm.