Search

Purpose Advanced MRI-based biomarkers offer comprehensive and quantitative information for the evaluation and characterization of brain tumors. In this study, we report initial clinical experience in routine glioma imaging with a novel, fully 3D multiparametric quantitative transient-state imaging (QTI) method for tissue characterization based on T1 and T2 values. Methods To demonstrate the viability of the proposed 3D QTI technique, nine glioma patients (grade II–IV), with a variety of disease states and treatment histories, were included in this study. First, we investigated the feasibility of 3D QTI (6:25 min scan time) for its use in clinical routine imaging, focusing on image reconstruction, parameter estimation, and contrast-weighted image synthesis. Second, for an initial assessment of 3D QTI-based quantitative MR biomarkers, we performed a ROI-based analysis to characterize T1 and T2 components in tumor and peritumoral tissue. Results The 3D acquisition combined with a compressed sensing reconstruction and neural network-based parameter inference produced parametric maps with high isotropic resolution (1.125 × 1.125 × 1.125 mm3 voxel size) and whole-brain coverage (22.5 × 22.5 × 22.5 cm3 FOV), enabling the synthesis of clinically relevant T1-weighted, T2-weighted, and FLAIR contrasts without any extra scan time. Our study revealed increased T1 and T2 values in tumor and peritumoral regions compared to contralateral white matter, good agreement with healthy volunteer data, and high inter-subject consistency. Conclusion 3D QTI demonstrated comprehensive tissue assessment of tumor substructures captured in T1 and T2 parameters. Aiming for fast acquisition of quantitative MR biomarkers, 3D QTI has potential to improve disease characterization in brain tumor patients under tight clinical time-constraints.

Novel methods for quantitative, transient-state multiparametric imaging are increasingly being demonstrated for assessment of disease and treatment efficacy. Here, we build on these by assessing the most common Non-Cartesian readout trajectories (2D/3D radials and spirals), demonstrating efficient anti-aliasing with a k-space view-sharing technique, and proposing novel methods for parameter inference with neural networks that incorporate the estimation of proton density. Our results show good agreement with gold standard and phantom references for all readout trajectories at 1.5T and 3T. Parameters inferred with the neural network were within 6.58% difference from the parameters inferred with a high-resolution dictionary. Concordance correlation coefficients were above 0.92 and the normalized root mean squared error ranged between 4.2% - 12.7% with respect to gold-standard phantom references for T1 and T2. In vivo acquisitions demonstrate sub-millimetric isotropic resolution in under five minutes with reconstruction and inference times < 7 minutes. Our 3D quantitative transient-state imaging approach could enable high-resolution multiparametric tissue quantification within clinically acceptable acquisition and reconstruction times., 43 pages, 12 Figures, 5 Tables

In this work we investigate the practicality of stochastic gradient descent and recently introduced variants with variance-reduction techniques in imaging inverse problems. Such algorithms have been shown in the machine learning literature to have optimal complexities in theory, and provide great improvement empirically over the deterministic gradient methods. Surprisingly, in some tasks such as image deblurring, many of such methods fail to converge faster than the accelerated deterministic gradient methods, even in terms of epoch counts. We investigate this phenomenon and propose a theory-inspired mechanism for the practitioners to efficiently characterize whether it is beneficial for an inverse problem to be solved by stochastic optimization techniques or not. Using standard tools in numerical linear algebra, we derive conditions on the spectral structure of the inverse problem for being a suitable application of stochastic gradient methods. Particularly, we show that, for an imaging inverse problem, if and only if its Hessain matrix has a fast-decaying eigenspectrum, then the stochastic gradient methods can be more advantageous than deterministic methods for solving such a problem. Our results also provide guidance on choosing appropriately the partition minibatch schemes, showing that a good minibatch scheme typically has relatively low correlation within each of the minibatches. Finally, we propose an accelerated primal-dual SGD algorithm in order to tackle another key bottleneck of stochastic optimization which is the heavy computation of proximal operators. The proposed method has fast convergence rate in practice, and is able to efficiently handle non-smooth regularization terms which are coupled with linear operators.

Consistency of the predictions with respect to the physical forward model is pivotal for reliably solving inverse problems. This consistency is mostly un-controlled in the current end-to-end deep learning methodologies proposed for the Magnetic Resonance Fingerprinting (MRF) problem. To address this, we propose PGD-Net, a learned proximal gradient descent framework that directly incorporates the forward acquisition and Bloch dynamic models within a recurrent learning mechanism. The PGD-Net adopts a compact neural proximal model for de-aliasing and quantitative inference, that can be flexibly trained on scarce MRF training datasets. Our numerical experiments show that the PGD-Net can achieve a superior quantitative inference accuracy, much smaller storage requirement, and a comparable runtime to the recent deep learning MRF baselines, while being much faster than the dictionary matching schemes. Code has been released at https://github.com/edongdongchen/PGD-Net.