Kd-tree for Dictionary Matching in Magnetic Resonance Fingerprinting
Nicolas Pannetier 1,2 and Norbert Schuff 1,2
Radiology, UCSF, San Francisco, California,
San Francisco, CA, United States
We evaluate the use of kd-tree (a space partitioning
data structure) to speed-up the matching process in
magnetic resonance fingerprinting. We found that, in
combination with PCA reduction, the matching time can be
reduced by 2 to 3 order of magnitude while preserving
the accuracy. The matching time, however, increases with
noise level and the PCA threshold remains a key element
to tune to achieve the best performance.
This abstract and the presentation materials are available to members only;
a login is required.