Meeting Banner
Abstract #3984

Undersampling trajectory design for fast MRI with super-resolution convolutional neural network

Shanshan Wang1, Taohui Xiao1,2, Sha Tan1,3, Yuanyuan Liu1, Leslie Ying4, and Dong Liang1

1Paul C. Lauterbur Research Center for Biomedical Imaging, SIAT, Chinese Academy of Sciences, Shenzhen, People's Republic of China, 2School of Physics and Optoelectronics, Xiangtan University, Xiangtan, People's Republic of China, 3School of Information Engineering, Guangdong University of Technology, Guangzhou, People's Republic of China, 4Department of Biomedical Engineering and Department of Electrical Engineering, The State University of New York, NY, United States

Deep learning based fast MR imaging (DeepLearnMRI) has been an appealing new research direction, which utilizes networks to draw valuable prior information from enormous existing high-quality MR images and then assists accurate MR image reconstruction from undersampled data. This paper explores optimal undersampling trajectory for DeepLearnMRI. Specifically, we designed hamming filtered asymmetrical 1D partial Fourier sampling scheme for fast MR imaging with our developed super-resolution convolutional neural network. Experimental results on in vivo dataset show that the proposed scheme allows DeepLearnMRI to reconstruct more accurate MR images with less time compared to the Classical GRAPPA and SPIRiT.

How to access this content:

For one year after publication, abstracts and videos are only open to registrants of this annual meeting. Registrants should use their existing login information. Non-registrant access can be purchased via the ISMRM E-Library.

After one year, current ISMRM & ISMRT members get free access to both the abstracts and videos. Non-members and non-registrants must purchase access via the ISMRM E-Library.

After two years, the meeting proceedings (abstracts) are opened to the public and require no login information. Videos remain behind password for access by members, registrants and E-Library customers.

Click here for more information on becoming a member.

Keywords