{'fraction_non_alphanumeric': 0.02857142857142857, 'fraction_numerical': 0.0, 'mean_word_length': 5.133333333333334, '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}}
Iterative reconstruction of magnetic resonance images from arbitrary samples in k-space

In magnetic resonance (MR) imaging, methods that use a non-Cartesian (e.g. spiral) sampling grid in k-space are becoming increasingly important. Reconstruction is then usually performed by resampling the data on a Cartesian grid, followed by FFT (gridding). In gridding, the weighting of the data to compensate for the varying density of the sampling scheme can lead to degradation of image quality. An iterative approach that avoids this problem is proposed. The two methods were compared using spiral k-space trajectories. Simulations were performed and showed better image quality and higher SNR in comparison to gridding based reconstruction.