{'fraction_non_alphanumeric': 0.013719512195121951, 'fraction_numerical': 0.012195121951219513, 'mean_word_length': 5.4411764705882355, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 1, '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}}
Locating Perceptually Salient Points on Planar Curves

This paper describes the underlying ideas and algorithmic details of a computer program that performs at a human level of competence for a significant subset of the curve partitioning task. It extends and rounds out the technique and philosophical approach originally presented by Fischler and Bolles (1986). In particular, it provides a unified strategy for selecting and dealing with interactions between salient points, even when these points are salient at different scales of resolution. Experimental results are presented involving on the order of 1000 real and synthetically generated images. >