By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
An, L. ; Dept. of Phys. & Astron., British Columbia Univ., Vancouver, BC, Canada ; Qing-San Xiang ; Chavez, S.

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.

Published in:

Medical Imaging, IEEE Transactions on  (Volume:19 ,  Issue: 8 )