{'fraction_non_alphanumeric': 0.011579818031430935, 'fraction_numerical': 0.0, 'mean_word_length': 5.576086956521739, '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 Cloud Registration with Virtual Interest Points from Implicit Quadric Surface Intersections

A novel method is presented to robustly and efficiently register two partially overlapping point clouds. Following segmentation, the regions are represented as implicit quadric surfaces using polynomials of degree two in three variables. The registration establishes correspondences of virtual interest points, which do not exist in the original point cloud data, and are defined by the intersection of three implicit quadric surfaces extracted from the point cloud regions. Implicit quadric surfaces exist in abundance in both natural and architectural scenes, and can be used to identify stable regions in the data, which in turn leads to repeatable virtual interest points. Large regions in a point cloud can be represented by a few implicit surfaces, which reduces the computational cost of registration and also makes the algorithm robust to noise and data density variations. Experiments were performed on seven data sets from various sensors. The proposed method outperformed most of the feature based registration and non-feature based registration methods for computational efficiency and convergence.