Fast, automated, <i>N</i>‐dimensional phase‐unwrapping algorithm

TLDR

The study investigates phase unwrapping for arbitrary N‑dimensional phase maps. A cost‑function based integer programming formulation is solved using a best‑pair‑first region‑merging optimization. The algorithm was implemented and validated on 3D MRI venograms and fMRI EPI data for unwarping and automated shimming. Published in Magn Reson Med 49:193–197 (2003); © 2003 Wiley‑Liss, Inc.

Abstract

Abstract This work investigates the general problem of phase unwrapping for arbitrary N ‐dimensional phase maps. A cost function‐based approach is outlined that leads to an integer programming problem. To solve this problem, a best‐pair‐first region merging approach is adopted as the optimization method. The algorithm was implemented and tested with 3D MRI medical data for venogram studies, as well as for fMRI applications in EPI unwarping and rapid, automated shimming. Magn Reson Med 49:193–197, 2003. © 2003 Wiley‐Liss, Inc.