A fast implementation of the minimum spanning tree method for phase unwrapping
- 1 January 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Medical Imaging
- Vol. 19 (8) , 805-808
- https://doi.org/10.1109/42.876306
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(n2) to O(n log2 n), where n is the number of pixels in the phase map. Typical 256 x 256 phase maps from magnetic resonance imaging can be unwrapped in seconds, compared with tens of minutes with the O(n2) implementation. This makes the pixel-level MST method time efficient and practically attractive. Index Terms-Image processing, magnetic resonance imaging, medical imaging, phase unwrapping.Keywords
This publication has 5 references indexed in Scilit:
- Understanding phase maps in MRI: a new cutline phase unwrapping methodIEEE Transactions on Medical Imaging, 2002
- Phase unwrapping by a maximum cross‐amplitude spanning tree algorithm: a comparative studyOptical Engineering, 1996
- A review of phase unwrapping techniques in fringe analysisOptics and Lasers in Engineering, 1994
- Automatic interferogram analysis techniques applied to quasi-heterodyne holography and ESPIOptics and Lasers in Engineering, 1991
- A New Phase Correction Method in NMR Imaging Based on Autocorrelation and Histogram AnalysisIEEE Transactions on Medical Imaging, 1987