Low-rank matrix completion has emerged as a potent reconstruction approach for calibrationless parallel imaging. However, in all existing low-rank reconstruction methods, the rank threshold must be carefully chosen slice by slice in a manual and trial-and-error manner, severely hindering the adoption of low-rank reconstruction in routine clinical applications. To tackle the problem, we proposed a fast and automatic rank determination via deep learning. It directly determines optimal rank from undersampled k-space data by exploiting coil sensitivity and finite image support. Our proposed method enables fast, automatic and robust rank determination for all existing calibrationless reconstruction using low-rank matrix completion.
[1] Yi Z, Liu Y, Zhao Y et al. Joint calibrationless reconstruction of highly undersampled multicontrast MR datasets using a low‐rank Hankel tensor completion framework. Magn Reson Med 2021;85(6):3256-3271.
[2] Liu Y, Yi Z, Zhao Y et al. Calibrationless parallel imaging reconstruction for multislice MR data using low‐rank tensor completion. Magn Reson Med 2021;85(2):897-911.
[3] Shin PJ, Larson PEZ, Ohliger MA et al. Calibrationless parallel imaging reconstruction based on structured low-rank matrix completion. Magn Reson Med 2014;72(4):959-970.
[4] Haldar JP. Low-Rank Modeling of Local k-Space Neighborhoods (LORAKS) for Constrained MRI. IEEE Trans Med Imaging 2014;33(3):668-681.
[5] Lee D, Jin KH, Kim EY et al. Acceleration of MR parameter mapping using annihilating filter-based low rank hankel matrix (ALOHA). Magn Reson Med 2016;76(6):1848-1864.
[6] Zhang J, Liu C, Moseley ME. Parallel reconstruction using null operations: Parallel Imaging Reconstruction. Magn Reson Med 2011;66(5):1241-1253.
[7] Yi Z, Zhao Z, Liu Y et al. Fast Calibrationless Image-space Reconstruction by Structured Low-rank Tensor Estimation of Coil Sensitivity and Spatial Support. In: Proceedings of the 29th Annual Meeting of ISMRM, 2021, p 0067.
[8] Haldar JP, Setsompop K. Linear Predictability in Magnetic Resonance Imaging Reconstruction: Leveraging Shift-Invariant Fourier Structure for Faster and Better Imaging. IEEE Signal Processing Magazine 2020;37(1):69-82.
[9] Haldar JP, Zhuo J. P-LORAKS: Low-rank modeling of local k-space neighborhoods with parallel imaging data. Magn Reson Med 2016;75(4):1499-1514.
[10] Ongie G, Jacob M. A Fast Algorithm for Convolutional Structured Low-Rank Matrix Recovery. IEEE Transactions on Computational Imaging 2017;3(4):535-550.
[11] Uecker M, Lai P, Murphy MJ et al. ESPIRiT-an eigenvalue approach to autocalibrating parallel MRI: where SENSE meets GRAPPA. Magn Reson Med 2014;71(3):990-1001.
[12] He, K., Zhang, X., Ren, S. et al. Deep residual learning for image recognition. IEEE Conference on Computer Vision and Pattern Recognition 2016;770-778.
[13] Souza R, Lucena O, Garrafa J et al. An open, multi-vendor, multi-field-strength brain MR dataset and analysis of publicly available skull stripping methods agreement. Neuroimage 2018;170:482-494.
[14] Buehrer M, Pruessmann KP, Boesiger P et al. Array compression for MRI with large coil arrays. Magn Reson Med. 2007;57(6):1131-9.
Figure 1. (A) Views of singular values and singular vectors for low-rank matrix structured from full sampled or undersampled k-space data. The optimal rank (green line) divides the structured low-rank matrix (along with its singular values and singular vectors) into span and null subspace. (B) Images obtained from span subspace and null subspace using the optimal rank. Note that only with an optimal rank can the low-rank reconstruction obtain satisfactory results. (C) Coil sensitivity and finite image support transformed from span and null subspace bases.
Figure 2. Coil sensitivity and finite image support dependent optimal rank determination. Coil sensitivity and finite image support from original data were replaced to simulate their influences on optimal rank determination. The results show the optimal rank increased by around 35% when a larger image support was applied, or reduced by around 15% when coil sensitivity from another slice was applied, indicating the optimal rank could vary among different slices or subjects, thus leading conventional manual rank determination to be burdensome and computationally demanding.
Figure 3. (A) Conventional low-rank reconstruction pipeline using rank manually determined in a trial-and-error manner. (B) The framework of integrating ARD with low-rank reconstruction, where rank was automatically determined from multi-channel zero-padded reconstruction images. (C) Two-stage ResNet-based model for automatic rank estimation by exploring finite image support and coil sensitivity information specific to the same MR coil array system.
Figure 4. LORAKS reconstruction results using the rank automatically determined by the proposed ARD. The reconstruction showed improved results, in terms of effectively suppressed artifacts, when compared to those using manually determined rank (i.e., ranks = 50, 70 and 90 for four slices with different finite spatial support and sensitivity). The proposed ARD directly estimated optimal rank (estimation errors within 3), yielding reconstruction results comparable to those using the manually chosen optimal ranks.
Figure 5. SAKE reconstruction results using the rank automatically determined by the proposed ARD. The reconstruction showed more significant artifact suppression when compared to those using manually determined rank (i.e., ranks = 50, 70 and 90 for four slices with different finite spatial support and sensitivity). Using the proposed ARD integrated with SAKE, the reconstruction results were also comparable to those using the manually chosen optimal ranks, demonstrating the robustness of our method.