{'fraction_non_alphanumeric': 0.01932367149758454, 'fraction_numerical': 0.0, 'mean_word_length': 5.098039215686274, '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}}
Image Registration Based on Convex Hull RANSAC-like

In this paper, a improved algorithm based on convex hull vertices is proposed. After extracting feature points by Harris corner detector, for searching the same regions of reference images, correlation method is used to match these points firstly, which gains two initial pairing sets. Then convex hull vertices of the pairing sets are used to establish the transformation parameters that can match most points of the two pairing sets, which use a convex hull RANSAC-like procedure. Lots of experiments demonstrate the accuracy, efficiency and robust of this approach.