{'fraction_non_alphanumeric': 0.015319148936170212, 'fraction_numerical': 0.0, 'mean_word_length': 5.606741573033708, '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 improved method for OMP-based algorithm; using fusing strategy

The Orthogonal Matching Pursuit (OMP) algorithm has been intensively applied for its simple structure and reconstruction efficiency. However, the reconstruction accuracy of OMP algorithm still needs to be improved. Though the OMP-based algorithms, LAOMP algorithm and KOMP algorithm proposed in recent years have significantly improved reconstruction performance while it can lead to fairly high computational complexity. In this paper, we propose an improved method for OMP-based algorithms using fusing strategy and demonstrate its superiority. We use the double intersection method to fuse the estimated support set from algorithms with low computational complexity to get an atomic set with high accuracy. This is used as an initial support set to improve the LAOMP algorithm and KOMP algorithm. According to the simulation results, compared with the original algorithms, the reconstruction accuracy of the improved algorithms increases to some extent while the reconstruction time sharply decreases and the performance is more remarkable as the computational amount of the original algorithms increases.