Hybrid Sparse Regularization for Magnetic Resonance Spectroscopy

International audienceMagnetic resonance spectroscopy imaging (MRSI) is a powerful non-invasive tool for characterising markers of biological processes. This technique extends conventional MRI by providing an additional dimension of spectral information describing the abnormal presence or concentration of metabolites of interest. Unfortunately, in vivo MRSI suffers from poor signal-to-noise ratio limiting its clinical use for treatment purposes. This is due to the combination of a weak MR signal and low metabolite concentrations, in addition to the acquisition noise. We propose a new method that handles this challenge by efficiently denoising MRSI signals without constraining the spectral or spatial profiles. The proposed denoising approach is based on wavelet transforms and exploits the sparsity of the MRSI signals both in the spatial and frequency domains. A fast proximal optimization algorithm is then used to recover the optimal solution. Experiments on synthetic and real MRSI data showed that the proposed scheme achieves superior noise suppression (SNR increase up to 60%). In addition, this method is computationally efficient and preserves data features better than existing methods

Obtaining sparse distributions in 2D inverse problems

The mathematics of inverse problems has relevance across numerous estimation problems in science and engineering. L1 regularization has attracted recent attention in reconstructing the system properties in the case of sparse inverse problems; i.e., when the true property sought is not adequately described by a continuous distribution, in particular in Compressed Sensing image reconstruction. In this work, we focus on the application of L1 regularization to a class of inverse problems; relaxation-relaxation, T1–T2, and diffusion-relaxation, D–T2, correlation experiments in NMR, which have found widespread applications in a number of areas including probing surface interactions in catalysis and characterizing fluid composition and pore structures in rocks. We introduce a robust algorithm for solving the L1 regularization problem and provide a guide to implementing it, including the choice of the amount of regularization used and the assignment of error estimates. We then show experimentally that L1 regularization has significant advantages over both the Non-Negative Least Squares (NNLS) algorithm and Tikhonov regularization. It is shown that the L1 regularization algorithm stably recovers a distribution at a signal to noise ratio < 20 and that it resolves relaxation time constants and diffusion coefficients differing by as little as 10%. The enhanced resolving capability is used to measure the inter and intra particle concentrations of a mixture of hexane and dodecane present within porous silica beads immersed within a bulk liquid phase; neither NNLS nor Tikhonov regularization are able to provide this resolution. This experimental study shows that the approach enables discrimination between different chemical species when direct spectroscopic discrimination is impossible, and hence measurement of chemical composition within porous media, such as catalysts or rocks, is possible while still being stable to high levels of noise.A.R. acknowledges Gates Trust Cambridge for financial support. A.J.S. and L.F.G. would like to acknowledge support from EPSRC (EP/N009304/1)

Fast image reconstruction with L2-regularization

Purpose We introduce L2-regularized reconstruction algorithms with closed-form solutions that achieve dramatic computational speed-up relative to state of the art L1- and L2-based iterative algorithms while maintaining similar image quality for various applications in MRI reconstruction. Materials and Methods We compare fast L2-based methods to state of the art algorithms employing iterative L1- and L2-regularization in numerical phantom and in vivo data in three applications; (i) Fast Quantitative Susceptibility Mapping (QSM), (ii) Lipid artifact suppression in Magnetic Resonance Spectroscopic Imaging (MRSI), and (iii) Diffusion Spectrum Imaging (DSI). In all cases, proposed L2-based methods are compared with the state of the art algorithms, and two to three orders of magnitude speed up is demonstrated with similar reconstruction quality. Results The closed-form solution developed for regularized QSM allows processing of a three-dimensional volume under 5 s, the proposed lipid suppression algorithm takes under 1 s to reconstruct single-slice MRSI data, while the PCA based DSI algorithm estimates diffusion propagators from undersampled q-space for a single slice under 30 s, all running in Matlab using a standard workstation. Conclusion For the applications considered herein, closed-form L2-regularization can be a faster alternative to its iterative counterpart or L1-based iterative algorithms, without compromising image quality.National Institute for Biomedical Imaging and Bioengineering (U.S.) (Grant NIBIB K99EB012107)National Institutes of Health (U.S.) (Grant NIH R01 EB007942)National Institute for Biomedical Imaging and Bioengineering (U.S.) (Grant NIBIB R01EB006847)Grant K99/R00 EB008129National Center for Research Resources (U.S.) (Grant NCRR P41RR14075)National Institutes of Health (U.S.) (Blueprint for Neuroscience Research U01MH093765)Siemens CorporationSiemens-MIT AllianceMIT-Center for Integration of Medicine and Innovative Technology (Medical Engineering Fellowship

Alternating Deep Low Rank Approach for Exponential Function Reconstruction and Its Biomedical Magnetic Resonance Applications

Exponential function is a fundamental signal form in general signal processing and biomedical applications, such as magnetic resonance spectroscopy and imaging. How to reduce the sampling time of these signals is an important problem. Sub-Nyquist sampling can accelerate signal acquisition but bring in artifacts. Recently, the low rankness of these exponentials has been applied to implicitly constrain the deep learning network through the unrolling of low rank Hankel factorization algorithm. However, only depending on the implicit low rank constraint cannot provide the robust reconstruction, such as sampling rate mismatches. In this work, by introducing the explicit low rank prior to constrain the deep learning, we propose an Alternating Deep Low Rank approach (ADLR) that utilizes deep learning and optimization solvers alternately. The former solver accelerates the reconstruction while the latter one corrects the reconstruction error from the mismatch. The experiments on both general exponential functions and realistic biomedical magnetic resonance data show that, compared with the state-of-the-art methods, ADLR can achieve much lower reconstruction error and effectively alleviates the decrease of reconstruction quality with sampling rate mismatches.Comment: 14 page