One of the challenges MRF faces is the amount of data needed to be stored, loaded, and processed, especially when a high resolution dictionary is needed or large multi-dimensional analyses need to be taken into account. A low rank approximation to the high resolution MRF dictionary using a coarse dictionary is an effective remedy to this problem. Here we present one of many possible ways to implement low rank approximation to an arbitrary fine MRF dictionary by a coarse dictionary equipped with polynomial fitting, so as to avoid the need of pre-calculating, storing, and processing the large, finely-resolved MRF dictionary.
How to access this content:
For one year after publication, abstracts and videos are only open to registrants of this annual meeting. Registrants should use their existing login information. Non-registrant access can be purchased via the ISMRM E-Library.
After one year, current ISMRM & ISMRT members get free access to both the abstracts and videos. Non-members and non-registrants must purchase access via the ISMRM E-Library.
After two years, the meeting proceedings (abstracts) are opened to the public and require no login information. Videos remain behind password for access by members, registrants and E-Library customers.
Keywords