{'fraction_non_alphanumeric': 0.01542111506524318, 'fraction_numerical': 0.0071174377224199285, 'mean_word_length': 5.393939393939394, '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}}
Iterative relaxation methods for image reconstruction

The problem of recovering an image (a function of two variables) from experimentally available integrals of its grayness over thin strips is of great importance in a large number of scientific areas. An important version of the problem in medicine is that of obtaining the exact density distribution within the human body from X-ray projections.
 One approach that has been taken to solve this problem consists of translating the available information into a system of linear inequalities. The size and the sparsity of the resulting system of inequalities (typically, 25,000 inequalities with less than 1% of the coefficients nonzero) makes methods using successive relaxations computationally attractive. A variety of such methods have been proposed with differing relaxation parameters.