{'fraction_non_alphanumeric': 0.022189349112426034, 'fraction_numerical': 0.0, 'mean_word_length': 5.702970297029703, '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}}
Optimized sampling patterns for practical compressed MRI

The performance of compressed sensing (CS) algorithms is dependent on the sparsity level of the underlying signal, the type of sampling pattern used and the reconstruction method applied. The higher the incoherence of the sampling pattern used for undersampling, less aliasing will be noticeable in the aliased signal space, resulting in better CS reconstruction. In this work, based on point spread function (PSF) properties, we compare random, Poisson disc and constrained random sampling patterns and show their usefulness in practical compressed sensing applied to dynamic cardiac magnetic resonance imaging (MRI).