{'fraction_non_alphanumeric': 0.01411764705882353, 'fraction_numerical': 0.0, 'mean_word_length': 5.862903225806452, '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}}
A fast iterative greedy algorithm for MEG source localization

Recent dynamic source localization algorithms for the Magnetoencephalographic inverse problem use cortical spatio-temporal dynamics to enhance the quality of the estimation. However, these methods suffer from high computational complexity due to the large number of sources that must be estimated. In this work, we introduce a fast iterative greedy algorithm incorporating the class of subspace pursuit algorithms for sparse source localization. The algorithm employs a reduced order state-space model resulting in significant computational savings. Simulation studies on MEG source localization reveal substantial gains provided by the proposed method over the widely used minimum-norm estimate, in terms of localization accuracy, with a negligible increase in computational complexity.