{'fraction_non_alphanumeric': 0.020802377414561663, 'fraction_numerical': 0.0014858841010401188, 'mean_word_length': 4.986666666666666, '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}}
Recognition of binary images from three signatures

A signature of a binary image contains, for each of a set of parallel lines, the total number of 1s (as opposed to 0s) along that line. We have been studying the recognition of binary images from these signatures. Typically a very large number of binary images would satisfy three signatures. To overcome this difficulty, we have investigated the possibility of modeling the class of binary images of a particular application area as a Markov random field (MRF) and using a stochastic algorithm which seeks to optimize a functional which, in addition to a penalty term for the violation of the signatures, contains a regularization term indicating the likelihood provided by the MRF. We have found that for some MRFs (specified by small regions of the image, which are either uniform or contain edges or corners), the method works remarkably well: binary image randomly selected from the MRF were recovered within one location in nearly all cases we have tried. The time-consuming nature of the stochastic algorithm is ameliorated by a preprocessing step which discovers locations at which the value is the same in all images having the given signatures; this reduces the search space considerably. We discuss, in particular, a linear-programming approach to finding such `invariant' locations.