{'fraction_non_alphanumeric': 0.010043041606886656, 'fraction_numerical': 0.0, 'mean_word_length': 5.5233644859813085, '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}}
An adaptive orthogonal matching pursuit algorithm based on redundancy dictionary

The reconstruction performance of an orthogonal matching pursuit algorithm is poor due to less observation values. An observation matrix design method which can adaptively ensure the sample size based on the image information is proposed. To make the algorithm more sparsely representative, an adaptive orthogonal matching pursuit algorithm based on the redundant dictionary is discussed by using a K-SVD dictionary training method to get a sparse dictionary. Experimental results show that the algorithm not only solves the problem that the sample size is small, but also improves the image reconstruction quality.