A new sparse representation framework for compressed sensing MRI

被引:24
|
作者
Chen, Zhen [1 ]
Huang, Chuanping [2 ]
Lin, Shufu [3 ]
机构
[1] South China Univ Technol, Sch Elect & Informat Engn, Guangzhou, Peoples R China
[2] Southern Med Univ, Affiliated Nanfang Hosp, Guangzhou, Peoples R China
[3] Xiamen Univ, Sch Software, Xiamen, Peoples R China
关键词
Compressed sensing (CS); Double tight frame (DTF); Magnetic resonance imaging (MRI); Robust L-1; L-a-norm; Sparse representation (SR); IMAGE-RECONSTRUCTION; EFFICIENT ALGORITHM; REGULARIZATION; MINIMIZATION;
D O I
10.1016/j.knosys.2019.104969
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Compressed sensing based Magnetic Resonance imaging (MRI) via sparse representation (or transform) has recently attracted broad interest. The tight frame (TF)-based sparse representation is a promising approach in compressed sensing MRI. However, the conventional TF-based sparse representation is difficult to utilize the sparsity of the whole image. Since the whole image usually has different structure textures and a kind of tight frame can only represent a particular kind of ground object, how to reconstruct high-quality of magnetic resonance (MR) image is a challenge. In this work, we propose a new sparse representation framework, which fuses the double tight frame (DTF) into the mixed norm regularization for MR image reconstruction from undersampled k-space data. In this framework, MR image is decomposed into smooth and nonsmooth regions. For the smooth regions, the wavelet TF-based weighted L-1-norm regularization is developed to reconstruct piecewise-smooth information of image. For nonsmooth regions, we introduce the curvelet TF-based robust L-1,L-a-norm regularization with the parameter to preserve the edge structural details and texture. To estimate the reasonable parameter, an adaptive parameter selection scheme is designed in robust L-1,L-a-norm regularization. Experimental results demonstrate that the proposed method can achieve the best image reconstruction results when compared with other existing methods in terms of quantitative metrics and visual effect. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页数:10
相关论文
共 50 条
  • [42] Image Compressed Sensing Recovery based on Multi-scale Group Sparse Representation
    Geng, Tianyu
    Sun, Guiling
    Xu, Yi
    Liu, Xiaochao
    2018 25TH INTERNATIONAL CONFERENCE ON SYSTEMS, SIGNALS AND IMAGE PROCESSING (IWSSIP), 2018,
  • [43] Ultrasonic Block Compressed Sensing Imaging Reconstruction Algorithm Based on Wavelet Sparse Representation
    Dai, Guangzhi
    He, Zhiyong
    Sun, Hongwei
    CURRENT MEDICAL IMAGING, 2020, 16 (03) : 262 - 272
  • [44] Orthogonal sparse representation for chirp echoes in broadband radar and its application to compressed sensing
    Gao L.
    Su S.-Y.
    Chen Z.-P.
    Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2011, 33 (11): : 2720 - 2726
  • [45] Sparse image representation using the analytic contourlet transform and its application on compressed sensing
    Lian, Qiu-Sheng
    Chen, Shu-Zhen
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2010, 38 (06): : 1293 - 1298
  • [46] IMAGE REPRESENTATION BY COMPRESSED SENSING
    Han, Bing
    Wu, Feng
    Wu, Dapeng
    2008 15TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOLS 1-5, 2008, : 1344 - 1347
  • [47] Symposium on Sparse Approximation and Compressed Sensing
    Blanchard, Jeffrey D.
    NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, VOLS I-III, 2010, 1281 : 1718 - 1719
  • [48] SPARSE DUAL FRAMES IN COMPRESSED SENSING
    Li, Shidong
    Mi, Tiebin
    Liu, Yulong
    WAVELETS AND SPARSITY XIV, 2011, 8138
  • [49] Compressed sensing of approximately sparse signals
    Stojnic, Mihailo
    Xu, Weiyu
    Hassibi, Babak
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 2182 - +
  • [50] Compressed sensing with sparse, structured matrices
    Angelini, Maria Chiara
    Ricci-Tersenghi, Federico
    Kabashima, Yoshiyuki
    2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2012, : 808 - 814