A fast Hankel matrix nonconvex factorization reconstruction method with inertia momentum for non-uniformly sampled NMR spectroscopy

被引:3
|
作者
Lang, Jun [1 ,2 ]
Cheng, Da [1 ]
机构
[1] Northeastern Univ, Coll Comp Sci & Engn, Shenyang 110819, Peoples R China
[2] Northeastern Univ, Minist Educ, Key Lab Intelligent Comp Med Image, Shenyang 110819, Peoples R China
基金
中国国家自然科学基金;
关键词
Low-rank Hankel matrix; Matrix nonconvex factorization; Singular value decomposition; Inertia momentum; Adaptive strategy; THRESHOLDING ALGORITHM; MINIMIZATION; RECOVERY; SPECTRA;
D O I
10.1016/j.dsp.2021.103171
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Multidimensional nuclear magnetic resonance (NMR) spectroscopy is one of the most powerful tools for qualitative or quantitative analysis of the composition and structure of various organic and inorganic substances. However, the time required to acquire NMR signals increases exponentially with dimensionality. Therefore, non-uniform sampling is commonly adopted to accelerate data acquisition and then the complete spectrum can be obtained by reconstruction method. At present, the state-of-the-art reconstruction methods are based on the idea of low-rank Hankel matrix completion and solved by different singular value thresholding methods. However, the computation of singular value decomposition (SVD) is very time-consuming, especially for high-resolution spectra. In this paper, we proposed a Hankel matrix nonconvex factorization optimization model to avoid SVD, thus greatly reducing the computational time. We developed a numerical algorithm based on the linearized Alternating direction method of multipliers to solve the proposed optimization problem, and Nesterov momentum is adopted to accelerate the convergence of the algorithm. However, for nonconvex model, the high quality reconstruction can only be obtained when the number of the spectral peaks is known. Thus we designed an adaptive strategy to alleviate this problem. Experiments are performed to demonstrate that the proposed algorithm can obtain higher quality reconstruction in less computational time than low rank Hankel matrix factorization and fast iterative hard thresholding methods. (C) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页数:10
相关论文
共 24 条
  • [21] Sparse multidimensional iterative lineshape-enhanced (SMILE) reconstruction of both non-uniformly sampled and conventional NMR data
    Jinfa Ying
    Frank Delaglio
    Dennis A. Torchia
    Ad Bax
    Journal of Biomolecular NMR, 2017, 68 : 101 - 118
  • [22] A Non-Uniformly Under-Sampled Blade Tip-Timing Signal Reconstruction Method for Blade Vibration Monitoring
    Hu, Zheng
    Lin, Jun
    Chen, Zhong-Sheng
    Yang, Yong-Min
    Li, Xue-Jun
    SENSORS, 2015, 15 (02) : 2419 - 2437
  • [23] A simple approach for reconstruction of non-uniformly sampled pseudo-3D NMR data for accurate measurement of spin relaxation parameters
    East, Kyle W.
    Delaglio, Frank
    Lisi, George P.
    JOURNAL OF BIOMOLECULAR NMR, 2021, 75 (6-7) : 213 - 219
  • [24] A simple approach for reconstruction of non-uniformly sampled pseudo-3D NMR data for accurate measurement of spin relaxation parameters
    Kyle W. East
    Frank Delaglio
    George P. Lisi
    Journal of Biomolecular NMR, 2021, 75 : 213 - 219