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

被引：54
|
作者：
An, L [1 ]
Xiang, QS
Chavez, S
机构：
[1] Univ British Columbia, Dept Phys & Astron, Vancouver, BC V6T 1Z1, Canada
[2] Univ British Columbia, Dept Phys, Vancouver, BC V6T 1Z1, Canada
[3] Univ British Columbia, Dept Radiol, Vancouver, BC V6T 1Z1, Canada
来源：
IEEE TRANSACTIONS ON MEDICAL IMAGING | 2000年 / 19卷 / 08期
关键词：
image processing; magnetic resonance imaging; medical imaging; phase unwrapping;
D O I：
10.1109/42.876306
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
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 x 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.
引用
收藏
页码：805 / 808
页数：4
相关论文
共 50 条
  • [1] Interferometric SAR phase unwrapping algorithm based on minimum spanning tree
    Liu, W
    Zhao, YJ
    [J]. ICEMI 2005: CONFERENCE PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON ELECTRONIC MEASUREMENT & INSTRUMENTS, VOL 6, 2005, : 454 - 457
  • [2] Phase unwrapping with a rapid opensource minimum spanning tree algorithm (ROMEO)
    Dymerska, Barbara
    Eckstein, Korbinian
    Bachrata, Beata
    Siow, Bernard
    Trattnig, Siegfried
    Shmueli, Karin
    Robinson, Simon Daniel
    [J]. MAGNETIC RESONANCE IN MEDICINE, 2021, 85 (04) : 2294 - 2308
  • [3] Optimized minimum spanning tree phase unwrapping algorithm for phase image of interferometric SAR
    Lei, Yang
    Qian, Feng
    Gang, Wang Zhi
    [J]. 2006 6TH INTERNATIONAL CONFERENCE ON ITS TELECOMMUNICATIONS PROCEEDINGS, 2006, : 1240 - +
  • [4] Optimized minimum spanning tree phase unwrapping and rectification algorithm of redundancies for phase image
    Yang lei
    Zhao yong jun
    Wang zhi gang
    [J]. PROCEEDINGS OF 2006 CIE INTERNATIONAL CONFERENCE ON RADAR, VOLS 1 AND 2, 2006, : 1590 - +
  • [5] Dendriform Branch Cut Algorithm Based on Minimum Spanning Tree for Phase Unwrapping
    Zhang Sen
    Zhong Heping
    Tang Jinsong
    [J]. 2012 INTERNATIONAL WORKSHOP ON INFORMATION AND ELECTRONICS ENGINEERING, 2012, 29 : 1154 - 1159
  • [6] Two-dimensional phase unwrapping using a minimum spanning tree algorithm
    Ching, Neng H.
    Rosenfeld, Dov
    Braun, Michael
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 1992, 1 (03) : 355 - 365
  • [7] A Fast Minimum Discontinuity Based Phase Unwrapping Method
    Xu, Junyi
    An, Daoxiang
    Huang, Xiaotao
    Ji, Kefeng
    [J]. 2015 IEEE 5TH ASIA-PACIFIC CONFERENCE ON SYNTHETIC APERTURE RADAR (APSAR), 2015, : 6 - 9
  • [8] A FAST ALGORITHM FOR THE MINIMUM SPANNING TREE
    SURAWEERA, F
    [J]. COMPUTERS IN INDUSTRY, 1989, 13 (02) : 181 - 185
  • [9] Fast reoptimization for the minimum spanning tree problem
    Boria, Nicolas
    Paschos, Vangelis Th.
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2010, 8 (03) : 296 - 310
  • [10] A FAST METHOD FOR TOPOLOGICAL OBSERVABILITY ANALYSIS USING A MINIMUM SPANNING TREE TECHNIQUE
    MORI, H
    TSUZUKI, S
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 1991, 6 (02) : 491 - 500
12345