{'fraction_non_alphanumeric': 0.028021015761821366, 'fraction_numerical': 0.0, 'mean_word_length': 5.574712643678161, '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 Efficient Iterative Thresholding Method for Compressed Sensing

—Compressed sensing is one of the newest problems in signal processing area. Recently greedy algorithms, such as matching pursuit (MP), orthogonal matching pursuit (OMP), iterative hard thresholding (IHT) and so on, are become applicable methods for compressed sensing problem. In this paper we propose an efficient technique for thresholding in IHT method. Proposed method simulation results in comparison with OMP and IHT methods, lead us to faster reconstruction and same SNR for reconstructed signal.