DocumentCode
1394165
Title
A fast implementation of the minimum spanning tree method for phase unwrapping
Author
An, Li ; Xiang, Qing-San ; Chavez, Sofia
Author_Institution
Dept. of Phys. & Astron., British Columbia Univ., Vancouver, BC, Canada
Volume
19
Issue
8
fYear
2000
Firstpage
805
Lastpage
808
Abstract
A new implementation of the minimum spanning tree (MST) phase unwrapping method is presented. The time complexity of the MST method is reduced from O(n 2) to O(n log 2 n), where n is the number of pixels in the phase map. Typical 256×256 phase maps from magnetic resonance imaging can be unwrapped in seconds, compared with tens of minutes with the O(n 2) implementation. This makes the pixel-level MST method time efficient and practically attractive.
Keywords
biomedical MRI; medical image processing; MRI; magnetic resonance imaging; medical diagnostic imaging; minimum spanning tree method; phase map; phase unwrapping; time complexity; Biomedical imaging; Chemicals; Image reconstruction; Magnetic fields; Magnetic resonance imaging; Magnetization; Medical signal detection; Physics; Signal detection; Tree graphs; Humans; Image Processing, Computer-Assisted; Magnetic Resonance Imaging; Microcomputers; Time Factors;
fLanguage
English
Journal_Title
Medical Imaging, IEEE Transactions on
Publisher
ieee
ISSN
0278-0062
Type
jour
DOI
10.1109/42.876306
Filename
876306
Link To Document