{'fraction_non_alphanumeric': 0.013110846245530394, 'fraction_numerical': 0.0011918951132300357, 'mean_word_length': 5.222222222222222, '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}}
Digital image restoration using quadratic programming.

The problem of digital image restoration is considered by obtaining an approximate solution to the Fredholm integral equation of the first kind in two variables. The system of linear equations resulting from the discretization of the integral equation is converted to a consistent system of linear equations. The problem is then solved as a quadratic programming problem with bounded variables where the unknown solution is minimized in the L(2) norm. In this method minimum computer storage is needed, and the repeated solutions are obtained in an efficient way. Also the rank of the consistent system which gives a best or near best solution is estimated. Computer simulated examples using spatially separable pointspread functions are presented. Comments and conclusion are given.