Synthetic Low-Field MRI Super-Resolution Via Nested U-Net Architecture
Not on the map. Why?
Abstract (arXiv)
Low-field (LF) MRI scanners have the power to revolutionize medical imaging by providing a portable and cheaper alternative to high-field MRI scanners. However, such scanners are usually significantly noisier and lower quality than their high-field counterparts. The aim of this paper is to improve the SNR and overall image quality of low-field MRI scans to improve diagnostic capability. To address this issue, we propose a Nested U-Net neural network architecture super-resolution algorithm that outperforms previously suggested deep learning methods with an average PSNR of 78.83 and SSIM of 0.9551. We tested our network on artificial noisy downsampled synthetic data from a major T1 weighted MRI image dataset called the T1-mix dataset. One board-certified radiologist scored 25 images on the Likert scale (1-5) assessing overall image quality, anatomical structure, and diagnostic confidence across our architecture and other published works (SR DenseNet, Generator Block, SRCNN, etc.). We also introduce a new type of loss function called natural log mean squared error (NLMSE). In conclusion, we present a more accurate deep learning method for single image super-resolution applied to synthetic low-field MRI via a Nested U-Net architecture.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 5 of its 20 references that are in the map. First posted on arXiv 28 Nov 2022.
Builds on
5 of 20 references.
References · 5
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
- 2016Photo-Realistic Single Image Super-Resolution Using a Generative Adversarial Networkcited by 1,898
- 2018UNet++: A Nested U-Net Architecture for Medical Image Segmentationcited by 1,518
- 2020A Learning Strategy for Contrast-agnostic MRI Segmentationcited by 35
- 2020MRI Super-Resolution with GAN and 3D Multi-Level DenseNet: Smaller, Faster, and Bettercited by 15
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.