Fast, automated, N-dimensional phase-unwrapping algorithm.
- 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.
- Publication status:
- Publisher copy:
- Magnetic resonance in medicine : official journal of the Society of Magnetic Resonance in Medicine / Society of Magnetic Resonance in Medicine
- Publication date:
- Source identifiers:
- Local pid:
- Copyright date:
Views and Downloads
If you are the owner of this record, you can report an update to it here: Report update to this record