Dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI) is used to study microvascular structure and tissue perfusion. In DCE-MRI, a bolus of gadolinium-based contrast agent is injected into the blood stream and spatiotemporal changes induced by the contrast agent flow are estimated from a time series of MRI data. Sufficient time resolution can often only be obtained by using an imaging protocol which produces undersampled data for each image in the time series. This has lead to the popularity of compressed sensing-based image reconstruction approaches, where all the images in the time series are reconstructed simultaneously, and temporal coupling between the images is introduced into the problem by a sparsity promoting regularization functional. We propose the use of Huber penalty for temporal regularization in DCE-MRI, and compare it to total variation, total generalized variation and smoothness-based temporal regularization models. We also study the effect of spatial regularization to the reconstruction and compare the reconstruction accuracy with different temporal resolutions due to varying undersampling. The approaches are tested using simulated and experimental radial golden angle DCE-MRI data from a rat brain specimen. The results indicate that Huber regularization produces similar reconstruction accuracy with the total variation-based models, but the computation times are significantly faster.

No abstract

Quantitative MRI (qMRI) methods allow reducing the subjectivity of clinical MRI by providing numerical values on which diagnostic assessment or predictions of tissue properties can be based. However, qMRI measurements typically take more time than anatomical imaging due to requiring multiple measurements with varying contrasts for, e.g., relaxation time mapping. To reduce the scanning time, undersampled data may be combined with compressed sensing (CS) reconstruction techniques. Typical CS reconstructions first reconstruct a complex-valued set of images corresponding to the varying contrasts, followed by a non-linear signal model fit to obtain the parameter maps. We propose a direct, embedded reconstruction method for T1ρ mapping. The proposed method capitalizes on a known signal model to directly reconstruct the desired parameter map using a non-linear optimization model. The proposed reconstruction method also allows directly regularizing the parameter map of interest and greatly reduces the number of unknowns in the reconstruction, which are key factors in the performance of the reconstruction method. We test the proposed model using simulated radially sampled data from a 2D phantom and 2D cartesian ex vivo measurements of a mouse kidney specimen. We compare the embedded reconstruction model to two CS reconstruction models and in the cartesian test case also the direct inverse fast Fourier transform. The T1ρ RMSE of the embedded reconstructions was reduced by 37–76% compared to the CS reconstructions when using undersampled simulated data with the reduction growing with larger acceleration factors. The proposed, embedded model outperformed the reference methods on the experimental test case as well, especially providing robustness with higher acceleration factors.

In dynamic MRI, sufficient temporal resolution can often only be obtained using imaging protocols which produce undersampled data for each image in the time series. This has led to the popularity of compressed sensing (CS) based reconstructions. One problem in CS approaches is determining the regularization parameters, which control the balance between data fidelity and regularization. We propose a data-driven approach for the total variation regularization parameter selection, where reconstructions yield expected sparsity levels in the regularization domains. The expected sparsity levels are obtained from the measurement data for temporal regularization and from a reference image for spatial regularization. Two formulations are proposed. Simultaneous search for a parameter pair yielding expected sparsity in both domains (S-surface), and a sequential parameter selection using the S-curve method (Sequential S-curve). The approaches are evaluated using simulated and experimental DCE-MRI. In the simulated test case, both methods produce a parameter pair and reconstruction that is close to the root mean square error (RMSE) optimal pair and reconstruction. In the experimental test case, the methods produce almost equal parameter selection, and the reconstructions are of high perceived quality. Both methods lead to a highly feasible selection of the regularization parameters in both test cases while the sequential method is computationally more efficient.

In dynamic MRI, sufficient time resolution can often only be obtained using imaging protocols which produce undersampled data for each image in the time series. This has led to the popularity of compressed sensing (CS) based image reconstruction approaches. One of the main problems in the CS approaches is determining the regularization parameters, which control the balance between the data fidelity term and the spatial and temporal regularization terms.Methods: A data-driven approach is proposed for the regularization parameter selection such that the reconstructions yield expected sparsity levels in the regularization domains. The expected sparsity levels are obtained from the measurement data for the temporal regularization and from a reference image for the spatial regularization. Two formulations are proposed. The first is a 2D search for a parameter pair which produces expected sparsity in both the temporal and spatial regularization domains. In the second approach, the sparsity-based parameter selection is split to two 1D searches using the S-curve method. The approaches are evaluated using simulated and experimental DCE-MRI data.Results: In the simulated test case, both methods produce a parameter pair that is close to the optimal pair, and the reconstruction error is also close to minimum.In the experimental test case, the methods produce almost similar parameter selection, and the reconstructions are of high perceived quality. Conclusion:Both approaches lead to a highly feasible selection of the temporal and spatial regularization parameters in both the simulated and experimental test cases while the second method is computationally more efficient.

Knowledge of the relative performance of the well-known sparse and low-rank compressed sensing models with 3D radial quantitative magnetic resonance imaging acquisitions is limited. We use 3D radial T1 relaxation time mapping data to compare the total variation, low-rank, and Huber penalty function approaches to regularization to provide insights into the relative performance of these image reconstruction models. Simulation and ex vivo specimen data were used to determine the best compressed sensing model as measured by normalized root mean squared error and structural similarity index. The large-scale compressed sensing models were solved by combining a GPU implementation of a preconditioned primal-dual proximal splitting algorithm to provide high-quality T1 maps within a feasible computation time. The model combining spatial total variation and locally low-rank regularization yielded the best performance, followed closely by the model combining spatial and contrast dimension total variation. Computation times ranged from 2 to 113 min, with the low-rank approaches taking the most time. The differences between the compressed sensing models are not necessarily large, but the overall performance is heavily dependent on the imaged object.

In this work we consider the image reconstruction problem of sparsely sampled dynamic contrast-enhanced (DCE) magnetic resonance imaging (MRI). DCE-MRI is a technique for acquiring a series of MR images before, during and after intravenous contrast agent administration, and it is used to study microvascular structure and perfusion. To overcome the ill-posedness of the related spatiotemporal inverse problem, we use regularization. In regularization one of the main problems is how to determine the regularization parameter which controls the balance between data fitting term and regularization term. Most methods for selecting this parameter require the computation of a large number of estimates even in stationary problems. In dynamic imaging, the parameter selection is even more time consuming since separate regularization parameters are needed for the spatial and temporal regularization functionals. In this work, we study the possibility of using the S-curve with DCE-MR data. We select the spatial regularization parameter using the S-curve, leaving the temporal regularization parameter as the only free parameter in the reconstruction problem. In this work, the temporal regularization parameter is selected manually by computing reconstructions with several values of the temporal regularization parameter.

Quantitative MRI (qMRI) methods allow reducing the subjectivity of clinical MRI by providing numerical values on which diagnostic assessment or predictions of tissue properties can be based. However, qMRI measurements typically take more time than anatomical imaging due to requiring multiple measurements with varying contrasts for, e.g., relaxation time mapping. To reduce the scanning time, undersampled data may be combined with compressed sensing reconstruction techniques. Typical CS reconstructions first reconstruct a complex-valued set of images corresponding to the varying contrasts, followed by a non-linear signal model fit to obtain the parameter maps. We propose a direct, embedded reconstruction method for T1ρ mapping. The proposed method capitalizes on a known signal model to directly reconstruct the desired parameter map using a non-linear optimization model. The proposed reconstruction method also allows directly regularizing the parameter map of interest, and greatly reduces the number of unknowns in the reconstruction. We test the proposed model using a simulated radially sampled data from a 2D phantom and 2D cartesian ex vivo measurements of a mouse kidney specimen. We compare the embedded reconstruction model to two CS reconstruction models, and in the cartesian test case also iFFT. The proposed, embedded model outperformed the reference methods on both test cases, especially with higher acceleration factors.