Online MR image reconstruction for compressed sensing acquisition in T2*imaging

被引:2
作者
El Gueddari, Loubna [1 ,2 ]
Chouzenoux, Emilie [3 ]
Vignaud, Alexandre [1 ]
Pesquet, Jean-Christophe [3 ]
Ciuciu, Philippe [1 ,2 ]
机构
[1] CEA NeuroSpin, Bat 145, F-91191 Gif Sur Yvette, France
[2] Univ Paris Saclay, Inria CEA Saclay Ile de France, Parietal Team, St Aubin, France
[3] Univ Paris Saclay, CVN, Inria Saclay, Cent Supelec, St Aubin, France
来源
WAVELETS AND SPARSITY XVIII | 2019年 / 11138卷
关键词
C ompressed Sensing; Magnetic Resonance Imaging; Image reconstruction; Online processing; Structured sparsity; THRESHOLDING ALGORITHM;
D O I
10.1117/12.2527881
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
Reducing acquisition time is a major challenge in high-resolution MRI that has been successfully addressed by Compressed Sensing (CS) theory. While the scan time has been massively accelerated by a factor up to 20 in 2D imaging, the complexity of image recovery algorithms has strongly increased, resulting in slower reconstruction processes. In this work we propose an online approach to shorten image reconstruction times in the CS setting. We leverage the segmented acquisition in multiple shots of k-space data to interleave the MR acquisition and image reconstruction steps. This approach is particularly appealing for 2D high-resolution T-2*-weighted anatomical imaging as the largest timing interval (i.e. Time of Repetition) between consecutive shots arises for this kind of imaging. During the scan, acquired shots are stacked together to form mini-batches and image reconstruction may start from incomplete data. For each newly available mini-batch, the previous partial solution is used as warm restart for the next sub-problem to be solved in a timing window compatible with the given TR and the number of shots stacked in a mini-batch. We demonstrate the interest and time savings of using online MR image reconstruction for Cartesian and non-Cartesian sampling strategies combined with a single receiver coil. Next, we extend the online formalism to address the more general multi-receiver phased array acquisition scenario. In this setting, calibrationless image reconstruction is adopted to remain compatible with the timing constraints of online delivery. Our retrospective and prospective results on ex-vivo 2D T-2*-weighted brain imaging show that high-quality MR images are recovered by the end of acquisition for single receiver acquisition and that additional iterations are required when parallel imaging is adopted. Overall, our approach implemented through the Gadgetron framework may be compatible with the data workflow on the scanner to provide the physician with reliable MR images for diagnostic purposes.
引用
收藏
页数:15
相关论文
共 58 条
[11]   A wavelet-based regularized reconstruction algorithm for SENSE parallel MRI with applications to neuroimaging [J].
Chaari, Lotfi ;
Pesquet, Jean-Christophe ;
Benazza-Benyahia, Amel ;
Ciuciu, Philippe .
MEDICAL IMAGE ANALYSIS, 2011, 15 (02) :185-201
[12]   A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging [J].
Chambolle, Antonin ;
Pock, Thomas .
JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2011, 40 (01) :120-145
[13]   Variable Density Sampling with Continuous Trajectories [J].
Chauffert, Nicolas ;
Ciuciu, Philippe ;
Kahn, Jonas ;
Weiss, Pierre .
SIAM JOURNAL ON IMAGING SCIENCES, 2014, 7 (04) :1962-1992
[14]  
Cherkaoui H., 2018, 26 EUR SIGN PROC C E
[15]   Proximal Splitting Methods in Signal Processing [J].
Combettes, Patrick L. ;
Pesquet, Jean-Christophe .
FIXED-POINT ALGORITHMS FOR INVERSE PROBLEMS IN SCIENCE AND ENGINEERING, 2011, 49 :185-+
[16]   A Primal-Dual Splitting Method for Convex Optimization Involving Lipschitzian, Proximable and Linear Composite Terms [J].
Condat, Laurent .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2013, 158 (02) :460-479
[17]   An iterative thresholding algorithm for linear inverse problems with a sparsity constraint [J].
Daubechies, I ;
Defrise, M ;
De Mol, C .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2004, 57 (11) :1413-1457
[18]   Compressed sensing [J].
Donoho, DL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (04) :1289-1306
[19]   ON THE DOUGLAS-RACHFORD SPLITTING METHOD AND THE PROXIMAL POINT ALGORITHM FOR MAXIMAL MONOTONE-OPERATORS [J].
ECKSTEIN, J ;
BERTSEKAS, DP .
MATHEMATICAL PROGRAMMING, 1992, 55 (03) :293-318
[20]  
El Gueddari L, 2019, I S BIOMED IMAGING, P1532, DOI [10.1109/isbi.2019.8759393, 10.1109/ISBI.2019.8759393]