Meeting Banner
Abstract #3272

A Fast and Globally Optimal 3-D Graph Search Algorithm for Phase Unwrapping in MRI with Applications in Quantitative Susceptibility Mapping (QSM)

Chen Cui1, Abhay Shah1, Cameron M. Cushing2, Vince Magnotta3, Xiaodong Wu1,2, and Mathews Jacob1

1Electrical and Computer Engineering, University of Iowa, Iowa City, IA, United States, 2Radiology Oncology, University of Iowa Hospitals and Clinics, Iowa City, IA, United States, 3Radiology, University of Iowa Hospitals and Clinics, Iowa City, IA, United States

Phase wrapping is a classic problem in many fields of study. In MRI, Unwrapping the phase in the estimation of B0 field inhomogeneity maps is challenging commonly due to the presence of a large field inhomogeneity, anatomical discontinuities or low SNR in certain regions of the map (e.g. boundaries). We propose a general phase unwrapping method that exploits the smoothness of the field map in three spatial dimensions. The method is solved using a linear-convex constrained graph search algorithm that provides the globally guaranteed optimal solution without over-smoothing effect. The proposed scheme aims to produce a robust solution for field map estimation that will further improve the quality of quantitative susceptibility mapping (QSM).

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

Join Here