{'fraction_non_alphanumeric': 0.013490725126475547, 'fraction_numerical': 0.0, 'mean_word_length': 5.6, '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}}
Heuristic strategy for feature matching in parallel curve detection

Feature matching has been proved very efficient as an approach for curve matching. However, when there are lots of features detected in the two curves, the possible combinations of matching among these features are prohibitive computationally. In this paper, we propose a heuristic algorithm to select the most promising coupling schemes out of these possible patterns. For parallel curve detection, the rationales we employed include proximity measure and compatibility between tangent orientations at these feature points.