Compressed Sensing MRI Reconstruction with Multiple Sparsity Constraints on Radial Sampling

被引:11
|
作者
Huang, Jianping [1 ]
Wang, Lihui [2 ]
Zhu, Yuemin [3 ]
机构
[1] Northeast Forestry Univ, Coll Mech & Elect Engn, Harbin 150040, Heilongjiang, Peoples R China
[2] Guizhou Univ, Coll Comp Sci & Technol, Key Lab Intelligent Med Image Anal & Precise Diag, Guiyang 550025, Guizhou, Peoples R China
[3] Univ Lyon, INSA Lyon, CNRS, Inserm,CREATIS,UMR 5220,U1206, F-69621 Lyon, France
基金
中国国家自然科学基金; 黑龙江省自然科学基金;
关键词
IMAGE-RECONSTRUCTION; ALGORITHM;
D O I
10.1155/2019/3694604
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Compressed Sensing Magnetic Resonance Imaging (CS-MRI) is a promising technique for accelerating MRI acquisitions by using fewer k-space data. Exploiting more sparsity is an important approach to improving the CS-MRI reconstruction quality. We propose a novel CS-MRI framework based on multiple sparse priors to increase reconstruction accuracy. The wavelet sparsity, wavelet tree structured sparsity, and nonlocal total variation (NLTV) regularizations were integrated in the CS-MRI framework, and the optimization problem was solved using a fast composite splitting algorithm (FCSA). The proposed method was evaluated on different types of MR images with different radial sampling schemes and different sampling ratios and compared with the state-of-the-art CS-MRI reconstruction methods in terms of peak signal-to-noise ratio (PSNR), feature similarity (FSIM), relative l2 norm error (RLNE), and mean structural similarity (MSSIM). The results demonstrated that the proposed method outperforms the traditional CS-MRI algorithms in both visual and quantitative comparisons.
引用
收藏
页数:14
相关论文
共 50 条
  • [21] Compressed sensing cardiac MRI exploiting spatio-temporal sparsity
    Jafar Zamani
    Abbas N Moghaddam
    Hamidreza Saligheh Rad
    Journal of Cardiovascular Magnetic Resonance, 15 (Suppl 1)
  • [22] COMPRESSED SENSING MRI USING DOUBLE SPARSITY WITH ADDITIONAL TRAINING IMAGES
    Tang, Chenming
    Inamuro, Norihito
    Ijiri, Takashi
    Hirabayashi, Akira
    2017 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2017, : 801 - 805
  • [23] The Sparsity Adaptive Reconstruction Algorithm Based on Simulated Annealing for Compressed Sensing
    Li, Yangyang
    Zhang, Jianping
    Sun, Guiling
    Lu, Dongxue
    JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING, 2019, 2019
  • [24] Compressed Sensing MR Image Reconstruction Exploiting TGV and Wavelet Sparsity
    Zhao, Di
    Du, Huiqian
    Han, Yu
    Mei, Wenbo
    COMPUTATIONAL AND MATHEMATICAL METHODS IN MEDICINE, 2014, 2014
  • [25] Block-Sparsity Based Compressed Sensing for Multichannel ECG Reconstruction
    Kumar, Sushant
    Deka, Bhabesh
    Datta, Sumit
    PATTERN RECOGNITION AND MACHINE INTELLIGENCE, PREMI 2019, PT II, 2019, 11942 : 210 - 217
  • [26] Efficient Compressed Sensing SENSE pMRI Reconstruction With Joint Sparsity Promotion
    Chun, Il Yong
    Adcock, Ben
    Talavage, Thomas M.
    IEEE TRANSACTIONS ON MEDICAL IMAGING, 2016, 35 (01) : 354 - 368
  • [27] Random sampling and signal reconstruction based on compressed sensing
    Huang, Caiyun
    Sensors and Transducers, 2014, 170 (05): : 48 - 53
  • [28] SC-GROG followed by L plus S reconstruction with multiple sparsity constraints for accelerated Golden-angle-radial DCE-MRI
    Najeeb, Faisal
    Amjad, Kashif
    Ullah, Irfan
    Omer, Hammad
    PLOS ONE, 2025, 20 (02):
  • [29] The Sampling Rate-Distortion Tradeoff for Sparsity Pattern Recovery in Compressed Sensing
    Reeves, Galen
    Gastpar, Michael
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (05) : 3065 - 3092
  • [30] Adversarial and Perceptual Refinement for Compressed Sensing MRI Reconstruction
    Seitzer, Maximilian
    Yang, Guang
    Schlemper, Jo
    Oktay, Ozan
    Wuerfl, Tobias
    Christlein, Vincent
    Wong, Tom
    Mohiaddin, Raad
    Firmin, David
    Keegan, Jennifer
    Rueckert, Daniel
    Maier, Andreas
    MEDICAL IMAGE COMPUTING AND COMPUTER ASSISTED INTERVENTION - MICCAI 2018, PT I, 2018, 11070 : 232 - 240