{'fraction_non_alphanumeric': 0.01517706576728499, 'fraction_numerical': 0.007588532883642495, 'mean_word_length': 5.025380710659898, '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}}
Free-form registration for 3D shape comparison

This paper presents a new algorithm for matching two sets of 3D data points. It has a better polynomial time complexity, O(N2.5), over previous techniques. There is not restriction on the amount of missing point-pair correspondence between the two sets of data, provided that a majority of the data points between the two images are consistent in terms of rigidity constraints. The algorithm makes use of the Hough bucketing technique for determining the optimal solution, with a modest 1D Hough space for the rotational space search. The search in the translational space is carried out sequentially. No restrictions on al six transformation parameters are imposed and any arbitrarily shaped surface can be registered provided a unique solution exists. The only assumption made is that the surface be piece-wise smooth to allow surface normal calculations on most regions except at discontinuity boundaries. Experimental results showed successful registrations of a simple bottle and a couple of anatomical surfaces captured in 64 by 64 range images with the execution time of about half a minute per registration on a personal computer.