{'fraction_non_alphanumeric': 0.01762632197414806, 'fraction_numerical': 0.0, 'mean_word_length': 5.604651162790698, '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}}
Under-sampling trajectory design for compressed sensing MRI

The under-sampling trajectory design plays a key role in compressed sensing MRI. The traditional design scheme using probability density function (PDF) is based up observation on energy distribution in k-space rather than systematic optimization, which results in non-deterministic trajectory even with a fixed PDF. Guidance-based method like Bayesian inference scheme is always bothered with high computational complexity on entropy. In this paper, we study how to adaptively design an under-sampling trajectory in the context of CS with systematic optimization and small complexity. Simulation results conducted on images from different slices and dynamic sequence demonstrate the effectiveness of the proposed method by comparing the designed trajectory with those by traditional method.