Calibrationless Parallel Imaging Reconstruction Based on Structured Low-Rank Matrix Completion

被引:255
|
作者
Shin, Peter J. [1 ,2 ]
Larson, Peder E. Z. [1 ,2 ]
Ohliger, Michael A. [1 ]
Elad, Michael [4 ]
Pauly, John M. [5 ]
Vigneron, Daniel B. [1 ,2 ]
Lustig, Michael [2 ,3 ]
机构
[1] Univ Calif San Francisco, Dept Radiol & Biomed Imaging, San Francisco, CA 94143 USA
[2] Univ Calif Berkeley, UCSF Grad Program Bioengn, Berkeley, CA USA
[3] Univ Calif Berkeley, Dept Elect Engn & Comp Sci, Berkeley, CA 94720 USA
[4] Technion Israel Inst Technol, Dept Comp Sci, IL-32000 Haifa, Israel
[5] Stanford Univ, Dept Elect Engn, Magnet Resonance Syst Res Lab, Stanford, CA 94305 USA
基金
美国国家卫生研究院;
关键词
parallel imaging; structured low-rank matrix completion; rapid MRI; compressed sensing; SPIRiT; GRAPPA; COIL SENSITIVITIES; SENSE; MRI; PROJECTIONS; ALGORITHM;
D O I
10.1002/mrm.24997
中图分类号
R8 [特种医学]; R445 [影像诊断学];
学科分类号
1002 ; 100207 ; 1009 ;
摘要
PurposeA calibrationless parallel imaging reconstruction method, termed simultaneous autocalibrating and k-space estimation (SAKE), is presented. It is a data-driven, coil-by-coil reconstruction method that does not require a separate calibration step for estimating coil sensitivity information. MethodsIn SAKE, an undersampled, multichannel dataset is structured into a single data matrix. The reconstruction is then formulated as a structured low-rank matrix completion problem. An iterative solution that implements a projection-onto-sets algorithm with singular value thresholding is described. ResultsReconstruction results are demonstrated for retrospectively and prospectively undersampled, multichannel Cartesian data having no calibration signals. Additionally, non-Cartesian data reconstruction is presented. Finally, improved image quality is demonstrated by combining SAKE with wavelet-based compressed sensing. ConclusionBecause estimation of coil sensitivity information is not needed, the proposed method could potentially benefit MR applications where acquiring accurate calibration data is limiting or not possible at all. Magn Reson Med 72:959-970, 2014. (c) 2013 Wiley Periodicals, Inc.
引用
收藏
页码:959 / 970
页数:12
相关论文
共 50 条
  • [21] Low-Rank Matrix Completion Based on Maximum Likelihood Estimation
    Chen, Jinhui
    Yang, Jian
    2013 SECOND IAPR ASIAN CONFERENCE ON PATTERN RECOGNITION (ACPR 2013), 2013, : 261 - 265
  • [22] Image super-resolution reconstruction based on sparse representation and low-rank matrix completion
    Jing, Guodong
    Shi, Yunhui
    Yin, Baocai
    Journal of Information and Computational Science, 2012, 9 (13): : 3859 - 3866
  • [23] Low-rank approximation pursuit for matrix completion
    Xu, An-Bao
    Xie, Dongxiu
    MECHANICAL SYSTEMS AND SIGNAL PROCESSING, 2017, 95 : 77 - 89
  • [24] Learning Low-Rank Representation for Matrix Completion
    Kwon, Minsu
    Choi, Ho-Jin
    2020 IEEE INTERNATIONAL CONFERENCE ON BIG DATA AND SMART COMPUTING (BIGCOMP 2020), 2020, : 161 - 164
  • [25] LOW-RANK MATRIX COMPLETION BY RIEMANNIAN OPTIMIZATION
    Vandereycken, Bart
    SIAM JOURNAL ON OPTIMIZATION, 2013, 23 (02) : 1214 - 1236
  • [26] Low-Rank Matrix Completion: A Contemporary Survey
    Luong Trung Nguyen
    Kim, Junhan
    Shim, Byonghyo
    IEEE ACCESS, 2019, 7 : 94215 - 94237
  • [27] Low-rank optimization for distance matrix completion
    Mishra, B.
    Meyer, G.
    Sepulchre, R.
    2011 50TH IEEE CONFERENCE ON DECISION AND CONTROL AND EUROPEAN CONTROL CONFERENCE (CDC-ECC), 2011, : 4455 - 4460
  • [28] A Nonconvex Method to Low-Rank Matrix Completion
    He, Haizhen
    Cui, Angang
    Yang, Hong
    Wen, Meng
    IEEE ACCESS, 2022, 10 : 55226 - 55234
  • [29] Accelerating Low-Rank Matrix Completion on GPUs
    Shah, Achal
    Majumdart, Angshul
    2014 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2014, : 182 - 187
  • [30] MATRIX COMPLETION FOR MATRICES WITH LOW-RANK DISPLACEMENT
    Lazzaro, Damiana
    Morigi, Serena
    ELECTRONIC TRANSACTIONS ON NUMERICAL ANALYSIS, 2020, 53 : 481 - 499