{'fraction_non_alphanumeric': 0.02494802494802495, 'fraction_numerical': 0.004851004851004851, 'mean_word_length': 4.73015873015873, '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}}
Performance of Sparse Representation Algorithms Using Randomly Generated Frames

We consider sparse representations of signals with at most L nonzero coefficients using a frame F of size M in CN. For any F, we establish a universal numerical lower bound on the average distortion of the representation as a function of the sparsity epsiv = L/N of the representation and redundancy (tau - 1) = M/N - 1 of F. In low dimensions (e.g., N = 6, 8.10), this bound is much stronger than the analytical and asymptotic bounds given in another of our papers. In contrast, it is much less straightforward to compute. We then compare the performance of randomly generated frames to this numerical lower bound and to the analytical and asymptotic bounds given in the aforementioned paper. In low dimensions, it is shown that randomly generated frames perform about 2 dB away from the theoretical lower bound, when the optimal sparse representation algorithm is used. In higher dimensions, we evaluate the performance of randomly generated frames using the greedy orthogonal matching pursuit (OMP) algorithm. The results indicate that for small values of epsiv, OMP performs close to the lower bound and suggest that the loss of the suboptimal search using orthogonal matching pursuit algorithm grows as a function of epsiv. In all cases, the performance of randomly generated frames hardens about their average as N grows, even when using the OMP algorithm.