Projects per year
Abstract / Description of output
Current popular methods for Magnetic Resonance Fingerprint (MRF) recovery are bottlenecked by the heavy computations of a matched-filtering step due to the size and complexity of the fingerprints dictionary. In this abstract we investigate and evaluate the advantages of incorporating an accelerated and scalable Approximate Nearest Neighbour Search (ANNS) scheme based on the Cover trees structure to shortcut the computations of this step within an iterative recovery algorithm and to obtain a good compromise between the computational cost and reconstruction accuracy of the MRF problem.
Original language | English |
---|---|
Publication status | Published - 6 Sept 2018 |
Event | 2018 International Society for Magnetic Resonance in Medicine (ISMRM) Annual Meeting - Paris, France Duration: 16 Jun 2018 → 21 Jun 2018 |
Conference
Conference | 2018 International Society for Magnetic Resonance in Medicine (ISMRM) Annual Meeting |
---|---|
Country/Territory | France |
City | Paris |
Period | 16/06/18 → 21/06/18 |
Fingerprint
Dive into the research topics of 'CoverBLIP: scalable iterative matched filtering for MR Fingerprint recovery'. Together they form a unique fingerprint.Projects
- 1 Finished