High-Frequency Subband Compressed Sensing MRI Using Quadruplet Sampling

被引:17
作者
Sung, Kyunghyun [1 ,2 ]
Hargreaves, Brian A. [1 ]
机构
[1] Stanford Univ, Dept Radiol, Stanford, CA 94305 USA
[2] Univ Calif Los Angeles, Dept Radiol Sci, Los Angeles, CA 90095 USA
关键词
image reconstruction; compressed sensing; wavelet transformation; parallel imaging; iterative reconstruction; TREE APPROXIMATION; WAVELET TRANSFORM; K-SPACE; RECONSTRUCTION; ALGORITHMS; RECOVERY; FOCUSS; DOMAIN;
D O I
10.1002/mrm.24592
中图分类号
R8 [特种医学]; R445 [影像诊断学];
学科分类号
1002 ; 100207 ; 1009 ;
摘要
PurposeTo present and validate a new method that formalizes a direct link between k-space and wavelet domains to apply separate undersampling and reconstruction for high- and low-spatial-frequency k-space data. Theory and MethodsHigh- and low-spatial-frequency regions are defined in k-space based on the separation of wavelet subbands, and the conventional compressed sensing problem is transformed into one of localized k-space estimation. To better exploit wavelet-domain sparsity, compressed sensing can be used for high-spatial-frequency regions, whereas parallel imaging can be used for low-spatial-frequency regions. Fourier undersampling is also customized to better accommodate each reconstruction method: random undersampling for compressed sensing and regular undersampling for parallel imaging. ResultsExamples using the proposed method demonstrate successful reconstruction of both low-spatial-frequency content and fine structures in high-resolution three-dimensional breast imaging with a net acceleration of 11-12. ConclusionThe proposed method improves the reconstruction accuracy of high-spatial-frequency signal content and avoids incoherent artifacts in low-spatial-frequency regions. This new formulation also reduces the reconstruction time due to the smaller problem size. Magn Reson Med 70:1306-1318, 2013. (c) 2012 Wiley Periodicals, Inc.
引用
收藏
页码:1306 / 1318
页数:13
相关论文
共 48 条
[1]  
[Anonymous], TECHNICAL REPORT
[2]   Near best tree approximation [J].
Baraniuk, RG ;
DeVore, RA ;
Kyriazis, G ;
Yu, XM .
ADVANCES IN COMPUTATIONAL MATHEMATICS, 2002, 16 (04) :357-373
[3]  
Beatty P., 2009, P 17 ANN M ISMRM HON, P2824
[4]   Iterative hard thresholding for compressed sensing [J].
Blumensath, Thomas ;
Davies, Mike E. .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2009, 27 (03) :265-274
[5]  
Brau AnjaC.S., 2006, Proceedings of the 14th Annual Meeting of ISMRM, P2462
[6]   Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information [J].
Candès, EJ ;
Romberg, J ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :489-509
[7]   Sparsity and incoherence in compressive sampling [J].
Candes, Emmanuel ;
Romberg, Justin .
INVERSE PROBLEMS, 2007, 23 (03) :969-985
[8]   Tree approximation and optimal encoding [J].
Cohen, A ;
Dahmen, W ;
Daubechies, I ;
DeVore, R .
APPLIED AND COMPUTATIONAL HARMONIC ANALYSIS, 2001, 11 (02) :192-226
[9]   The contourlet transform: An efficient directional multiresolution image representation [J].
Do, MN ;
Vetterli, M .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2005, 14 (12) :2091-2106
[10]   Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing [J].
Donoho, David ;
Tanner, Jared .
PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2009, 367 (1906) :4273-4293