{'fraction_non_alphanumeric': 0.017543859649122806, 'fraction_numerical': 0.0, 'mean_word_length': 5.392, '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}}
Sorted Random Matrix for Orthogonal Matching Pursuit

Orthogonal Matching Pursuit (OMP) algorithm is widely applied to compressive sensing (CS) image signal recovery because of its low computation complexity and its ease of implementation. However, OMP usually needs more measurements than some other recovery algorithms in order to achieve equal-quality reconstructions. This article firstly illustrates the fundamental idea of OMP and the specific algorithm steps. And then, two limitations leading to the previous issue are addressed. Finally, a sorted random matrix is proposed to be used as a measurement matrix to improve those two limitations. The experimental results show the proposed measurement matrix is able to help OMP make a great progress on the quality of recovered approximations.