MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Fast group matching for MR fingerprinting reconstruction

Author(s)
Cauley, Stephen F.; Setsompop, Kawin; Ma, Dan; Jiang, Yun; Ye, Huihui; Griswold, Mark A.; Adalsteinsson, Elfar; Wald, Lawrence; ... Show more Show less
Thumbnail
DownloadFast group matching.pdf (1.662Mb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
Purpose MR fingerprinting (MRF) is a technique for quantitative tissue mapping using pseudorandom measurements. To estimate tissue properties such as T1, T2, proton density, and B0, the rapidly acquired data are compared against a large dictionary of Bloch simulations. This matching process can be a very computationally demanding portion of MRF reconstruction. Theory and Methods We introduce a fast group matching algorithm (GRM) that exploits inherent correlation within MRF dictionaries to create highly clustered groupings of the elements. During matching, a group specific signature is first used to remove poor matching possibilities. Group principal component analysis (PCA) is used to evaluate all remaining tissue types. In vivo 3 Tesla brain data were used to validate the accuracy of our approach. Results For a trueFISP sequence with over 196,000 dictionary elements, 1000 MRF samples, and image matrix of 128 × 128, GRM was able to map MR parameters within 2s using standard vendor computational resources. This is an order of magnitude faster than global PCA and nearly two orders of magnitude faster than direct matching, with comparable accuracy (1–2% relative error). Conclusion The proposed GRM method is a highly efficient model reduction technique for MRF matching and should enable clinically relevant reconstruction accuracy and time on standard vendor computational resources.
Date issued
2015-07
URI
http://hdl.handle.net/1721.1/110735
Department
Massachusetts Institute of Technology. Institute for Medical Engineering & Science; Harvard University--MIT Division of Health Sciences and Technology; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Journal
Magnetic Resonance in Medicine
Publisher
Wiley Blackwell
Citation
Cauley, Stephen F.; Setsompop, Kawin; Ma, Dan et al. “Fast Group Matching for MR Fingerprinting Reconstruction.” Magnetic Resonance in Medicine 74, 2 (August 2014): 523–528 © 2014 Wiley Periodicals, Inc
Version: Author's final manuscript
ISSN
0740-3194
1522-2594

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.