| Zugriffsnummer | 38898 |
| Dokumenttyp | Zeitschriftenartikel |
| Peer Review | unbekannt |
| Sprache | Englisch |
| Titel | A large-scale optimization method using a sparse approximation of the Hessian for Magnetic Resonance Fingerprinting |
| Autor(in); Institution |
Wübbeler, Gerd; 8.4, Mathematische Modellierung und Datenanalyse, PTB-Berlin
Elster, Clemens; 8.4, Mathematische Modellierung und Datenanalyse, PTB-Berlin
|
| Quelle/Jahr | SIAM Journal on Imaging Sciences: 10 (2017), 3, 979 - 1004 |
| Availability | [online only] |
| ISSN | 1936-4954 (ONLINE) |
| DOI | |
| Verlag | Philadelphia, Pa.: Society for Industrial and Applied Mathematics (SIAM) |
| Freie Schlagworte | MRI ; magnetic resonance fingerprinting ; large-scale optimization ; trust region method |
| Zusammenfassung | Magnetic resonance fingerprinting (MRF) is a novel approach for quantitative imaging which enables the simultaneous determination of multiple tissue-related parameters within short acquisition times. The tissue-related parameters are usually estimated by template matching employing a large dictionary of test signals constructed on the basis of a physical model. We propose to analyze an MRF sequence by a least-squares approach and develop a large-scale optimization algorithm for this purpose. The algorithm is based on a nonmonotone trust region method and utilizes a sparse Jacobian and a sparse approximation of the Hessian. The algorithm is capable of identifying the tissue-related parameters within reasonable calculation times. Simulation results are presented in which the proposed approach compares favorably with previously suggested template matching methods. Moreover, uncertainties for the estimates of the tissue-related parameters calculated on the basis of the approximate Hessian appear to provide a reasonable characterization of their accuracy. |
