A fast implementation of the minimum spanning tree method for phase unwrapping

Authors
An, L Xiang, QS Chavez, S
Citation
L. An et al., A fast implementation of the minimum spanning tree method for phase unwrapping, IEEE MED IM, 19(8), 2000, pp. 805-808
Citations number
7
Categorie Soggetti
Radiology ,Nuclear Medicine & Imaging","Eletrical & Eletronics Engineeing
Journal title
IEEE TRANSACTIONS ON MEDICAL IMAGING
ISSN journal
02780062 → ACNP
Volume
19
Issue
8
Year of publication
2000
Pages
805 - 808
Database
ISI
SICI code
0278-0062(200008)19:8<805:AFIOTM>2.0.ZU;2-5
Abstract
A new implementation of the minimum spanning tree (MST) phase unwrapping me thod 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, T ypical 256 x 256 phase maps from magnetic resonance imaging can be unwrappe d in seconds, compared with tens of minutes with the O(n(2)) implementation . This makes the pixel-level MST method time efficient and practically attr active.