Fast, automated, N-dimensional phase-unwrapping algorithm.

Journal article

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.

Journal:: Magnetic resonance in medicine : official journal of the Society of Magnetic Resonance in Medicine / Society of Magnetic Resonance in Medicine More from this journal
Volume:: 49
Issue:: 1
Pages:: 193-197
Publication date:: 2003-01-01
DOI:: 10.1002/mrm.10354
EISSN:: 1522-2594
ISSN:: 0740-3194

Language:: English
Keywords:: Imaging, Three-Dimensional

Veins

Algorithms

Humans

Image Processing, Computer-Assisted

Magnetic Resonance Imaging
Pubs id:: pubs:241501
UUID:: uuid:ed33dc11-389e-4516-b46a-8efa2a53feca
Local pid:: pubs:241501
Source identifiers:: 241501
Deposit date:: 2012-12-19
ARK identifier:: ark:/29072/ora_ed33dc11389e4516b46a8efa2a53feca

Licence:: Terms and Conditions of Use for Oxford University Research Archive

If you are the owner of this record, you can report an update to it here: Report update to this record