{'fraction_non_alphanumeric': 0.011807447774750226, 'fraction_numerical': 0.0, 'mean_word_length': 5.444444444444445, '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 ICP Algorithm for Point Cloud Registration

In order to solve the problems that classical ICP algorithm has low registration efficiency in the process of point cloud data registration and high requirements for the initial position of point cloud, an improved point cloud registration method with ICP algorithm is proposed. A spatial registration scheme combining initial registration with accurate registration is adopted, using the FPFH algorithm to transform initial point cloud to an ideal position, which reduces the possibility of iterative nearest point algorithm falling into the optimal solution, Then, based on ICP algorithm, ISS algorithm is used to extract key points, and the search time of the nearest neighbor points is shortened by using the k-d tree structure, distance constraint and cosine constraint of normal vector angle are used to exclude wrong point pairs. By observing the experimental results we found that the running time and accuracy of the algorithm are obviously improved, which can meet the registration requirements and improve the registration efficiency.