Objective: Magnetic resonance fingerprinting (MRF) is a new technique for simultaneously quantifying multiple MR parameters using one temporally resolved MR scan. In MRF, MR signal is manipulated to have distinct temporal behavior with regard to different combinations of the underlying MR parameters and across spatial regions. The temporal behavior of acquired MR signal is then used as a key to find its unique counterpart in a MR signal dictionary. The dictionary generation and searching (DGS) process represents the most important part of MRF, which however can be intractable because of the disk space requirement and the computational demand exponentially increases with the number of MR parameters, spatial coverage, and spatial resolution. The goal of this paper was to develop a fast and space efficient MRF DGS algorithm. Methods: The optimal DGS algorithm: MRF ZOOM was designed based on the properties of the parameter matching objective function characterized with full dictionary simulations. Both synthetic data and in-vivo data were used to validate the method. Conclusion: MRF ZOOM can dramatically save MRF DGS time without sacrificing matching accuracy. Significance: MRF ZOOM can facilitate a wide range of MRF applications.
- Bloch simulation
- fast searching
- Magnetic resonance fingerprinting
ASJC Scopus subject areas
- Biomedical Engineering