Fast, automated, N‐dimensional phase‐unwrapping algorithm
Mark Jenkinson · Magnetic Resonance in Medicine · 2002
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.
Cited by 695 works. doi:10.1002/mrm.10354 Open-access PDF
Authors
References
- Correction for geometric distortion in echo planar images from B0 field variations
- Blood Flow Imaging by Cine Magnetic Resonance
- Three‐point dixon technique for true water/fat decomposition with B0 inhomogeneity correction
- Two-dimensional phase unwrapping with use of statistical models for cost functions in nonlinear optimization
- New Robust 3-D Phase Unwrapping Algorithms: Application to Magnetic Field Mapping and Undistorting Echoplanar Images
- Two-dimensional phase unwrapping using a minimum spanning tree algorithm
- Phase unwrapping of MR phase images using Poisson equation
- A new two‐dimensional phase unwrapping algorithm for MRI images
- Phase unwrapping in the three-point Dixon method for fat suppression MR imaging.
- A model-based method for phase unwrapping