{'fraction_non_alphanumeric': 0.015779092702169626, 'fraction_numerical': 0.0, 'mean_word_length': 5.684210526315789, '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}}
A novel Matching Pursuit algorithm with adaptive subdictionary

Sparse decomposition of a signal can be obtained by decomposing the signal in an over complete dictionary. Matching Pursuit (MP) is a greedy algorithm to realize such decompositions, and has been widely studied in many signal processing researches. Through exploiting the structure shared by these so-called adaptive decomposition dictionaries, we propose a novel MP algorithm which can reduce computation and storage requirement dramatically.