{'fraction_non_alphanumeric': 0.014796547472256474, 'fraction_numerical': 0.0, 'mean_word_length': 5.34375, '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}}
Sparse electromagnetic tomography based on matching pursuit algorithms

A sparse Electromagnetic Tomography (EMT) system based on Matching Pursuit (MP) algorithms is introduced in this paper. The sparse EMT problem with a linear model is essentially a pursuit for the sparse representation of the spatial conductivity. The framework of sparse representation theory is adopted for the EMT problem. Such notations as spark and mutual-coherence are introduced as tools in the analysis of the recovery results. MP algorithms are considered as effective and efficient solvers towards sparse representation. Some variations of MP are compared in this paper for a random dictionary and the EMT dictionary. The result of conductivity reconstruction proves the effectiveness of MP algorithms for the proposed EMT system.