Search

Quantitative MRI methods that estimate multiple physical parameters simultaneously often require the fitting of a computational complex signal model defined through the Bloch equations. Repeated Bloch simulations can be avoided by matching the measured signal with a precomputed signal dictionary on a discrete parameter grid (i.e. lookup table) as used in MR Fingerprinting. However, accurate estimation requires discretizing each parameter with a high resolution and consequently high computational and memory costs for dictionary generation, storage, and matching. Here, we reduce the required parameter resolution by approximating the signal between grid points through B-spline interpolation. The interpolant and its gradient are evaluated efficiently which enables a least-squares fitting method for parameter mapping. The resolution of each parameter was minimized while obtaining a user-specified interpolation accuracy. The method was evaluated by phantom and in-vivo experiments using fully-sampled and undersampled unbalanced (FISP) MR fingerprinting acquisitions. Bloch simulations incorporated relaxation effects $(\boldsymbol {T}_{\boldsymbol {1}},\boldsymbol {T}_{\boldsymbol {2}})$ , proton density $\left ({\boldsymbol {PD} }\right)$ , receiver phase ($\boldsymbol {\varphi }_{\boldsymbol {0}}$), transmit field inhomogeneity ($\boldsymbol {B}_{\boldsymbol {1}}^{\boldsymbol {+}}$), and slice profile. Parameter maps were compared with those obtained from dictionary matching, where the parameter resolution was chosen to obtain similar signal (interpolation) accuracy. For both the phantom and the in-vivo acquisition, the proposed method approximated the parameter maps obtained through dictionary matching while reducing the parameter resolution in each dimension ($\boldsymbol {T}_{\boldsymbol {1}},\boldsymbol {T}_{\boldsymbol {2}},\boldsymbol {B}_{\boldsymbol {1}}^{\boldsymbol {+}}$) by – on average – an order of magnitude. In effect, the applied dictionary was reduced from $1.47GB$ to $464KB$. Furthermore, the proposed method was equally robust against undersampling artifacts as dictionary matching. Dictionary fitting with B-spline interpolation reduces the computational and memory costs of dictionary-based methods and is therefore a promising method for multi-parametric mapping. [ABSTRACT FROM AUTHOR]

Magnetic resonance fingerprinting (MRF) is a quantitative imaging technique that can simultaneously measure multiple important tissue properties of human body. Although MRF has demonstrated improved scan efficiency as compared to conventional techniques, further acceleration is still desired for translation into routine clinical practice. The purpose of this paper is to accelerate MRF acquisition by developing a new tissue quantification method for MRF that allows accurate quantification with fewer sampling data. Most of the existing approaches use the MRF signal evolution at each individual pixel to estimate tissue properties, without considering the spatial association among neighboring pixels. In this paper, we propose a spatially constrained quantification method that uses the signals at multiple neighboring pixels to better estimate tissue properties at the central pixel. Specifically, we design a unique two-step deep learning model that learns the mapping from the observed signals to the desired properties for tissue quantification, i.e.: 1) with a feature extraction module for reducing the dimension of signals by extracting a low-dimensional feature vector from the high-dimensional signal evolution and 2) a spatially constrained quantification module for exploiting the spatial information from the extracted feature maps to generate the final tissue property map. A corresponding two-step training strategy is developed for network training. The proposed method is tested on highly undersampled MRF data acquired from human brains. Experimental results demonstrate that our method can achieve accurate quantification for T1 and T2 relaxation times by using only 1/4 time points of the original sequence (i.e., four times of acceleration for MRF acquisition). [ABSTRACT FROM AUTHOR]

Quantitative magnetic resonance imaging (MRI) is of great value to both clinical diagnosis and scientific research. However, most MRI experiments remain qualitative, especially dynamic MRI, because repeated sampling with variable weighting parameter makes quantitative imaging time-consuming and sensitive to motion artifacts. A single-shot quantitative T2 mapping method based on multiple overlapping-echo acquisition (dubbed MOLED-4) was proposed to obtain reliable T2 mapping in milliseconds. Different from traditional MRI acceleration methods, such as compressed sensing and parallel imaging, MOLED-4 accelerates quantitative T2 mapping via synchronized multisampling and then deep learning to map the complex nonlinear relationship that is difficult to solve by traditional optimization-based methods. The results of simulation, phantom, and in vivo human brain experiments show the great performance of the proposed method. The principle of MOLED-4 may be extended to other ultrafast quantitative parameter mappings and potentially lead to new dynamic MRI with high efficiency to catch quantitative variation of tissue properties. [ABSTRACT FROM AUTHOR]

Magnetic resonance parameter mapping (e.g., T1 mapping, T2 mapping, T^\ast 2 mapping) is a valuable tool for tissue characterization. However, its practical utility has been limited due to long data acquisition time. This paper addresses this problem with a new model-based parameter mapping method. The proposed method utilizes a formulation that integrates the explicit signal model with sparsity constraints on the model parameters, enabling direct estimation of the parameters of interest from highly undersampled, noisy \bf k-space data. An efficient greedy-pursuit algorithm is described to solve the resulting constrained parameter estimation problem. Estimation-theoretic bounds are also derived to analyze the benefits of incorporating sparsity constraints and benchmark the performance of the proposed method. The theoretical properties and empirical performance of the proposed method are illustrated in a T2 mapping application example using computer simulations. [ABSTRACT FROM AUTHOR]