Abstract #3659

Rapid Opensource Minimum Spanning TreE AlgOrithm for Phase Unwrapping (ROMEO)

Simon Daniel Robinson^1,2,3, Korbinian Eckstein¹, Siegfried Trattnig¹, Karin Shmueli⁴, and Barbara Dymerska⁴

¹Department of Biomedical Imaging and Image-guided Therapy, Medical University of Vienna, Vienna, Austria, ²Department of Neurology, Medical University of Graz, Graz, Austria, ³Centre for Advanced Imaging, University of Queensland, Queensland, Australia, ⁴University College London, London, United Kingdom

We present a phase unwrapping algorithm (ROMEO), which improves on previous path-based unwrapping methods by using weights (the values of which determine the order in which voxels are unwrapped) that guide the unwrapping on paths through the object which avoid noise and a computationally efficient minimum spanning tree algorithm. ROMEO was tested against the region-growing method PRELUDE and the voxel-based method Best Path in unwrapping simulated data (a complex topography) and in-vivo GRE and EPI data acquired at 7T. ROMEO was found to be faster and more reliable than PRELUDE and Best Path.

This abstract and the presentation materials are available to members only; a login is required.

Join Here