{'fraction_non_alphanumeric': 0.016637478108581436, 'fraction_numerical': 0.0017513134851138354, 'mean_word_length': 5.568965517241379, '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}}
Research on algorithm of point cloud coarse registration

Targeting at prerequisites in the process of registering 3D point cloud data under different angles of view by ICP algorithm, a new automatic coarse registration algorithm is presented in this paper. Firstly, through computing normal vector variation of point cloud within different radius, simplify point cloud and keep necessary key points. Then comprehensively use three geometric features of key points in point clouds to search for matching point pairs. Next, use ZNCC (zero-mean normalized cross-correlation coefficient) registration criterion which is used in 2D image matching, so as to compute neighborhood similarity between matching point pairs. According to neighborhood similarity, build one-to-one correspondence between point pairs and establish coarse registration point pairs afterwards and finally get coarse matching parameters. The experimental results show that either used alone or combined with ICP algorithm, this algorithm is a great improvement in comparison to solely using ICP algorithm or other improved ICP algorithms in terms of efficiency and accuracy.