Interferometric SAR phase unwrapping algorithm based on minimum spanning tree

被引:0
|
作者
Liu, W [1 ]
Zhao, YJ [1 ]
机构
[1] Informat Engn Univ, Inst Informat Engn, Zhengzhou 450002, Peoples R China
关键词
InSAR; phase unwrapping; residue; minimum spanning tree;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Phase unwrapping is one of the most difficult processing steps in sar interferometry. In this paper a new phase unwrapping approach based on minimum spanning tree is proposed. To discharge the positive and negative residues, all residues are divided into groups in a systematic searching strategy, and the connecting of residues in each group is optimized based on minimum spanning tree, optimum branch trees are achieved. The technique is explained in detail, the experiments prove the new algorithm more efficient than Goldstein's branch cut algorithm.
引用
收藏
页码:454 / 457
页数:4
相关论文
共 50 条
  • [31] An optimal minimum spanning tree algorithm
    Pettie, S
    Ramachandran, V
    AUTOMATA LANGUAGES AND PROGRAMMING, 2000, 1853 : 49 - 60
  • [32] PROBABILISTIC MINIMUM SPANNING TREE ALGORITHM
    ROHLF, FJ
    INFORMATION PROCESSING LETTERS, 1978, 7 (01) : 44 - 48
  • [33] A FAST ALGORITHM FOR THE MINIMUM SPANNING TREE
    SURAWEERA, F
    COMPUTERS IN INDUSTRY, 1989, 13 (02) : 181 - 185
  • [34] An Efficient Minimum Spanning Tree Algorithm
    Abdullah-Al Mamun
    Rajasekaran, Sanguthevar
    2016 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATION (ISCC), 2016, : 1047 - 1052
  • [35] Ground-Based SAR Multistage Mountain Slope Interferometric Phase Unwrapping
    Huang Zengshu
    Sun Jinping
    Yuan Yunneng
    Tan Weixian
    Huang Pingping
    Wang Yanping
    2015 IEEE 5TH ASIA-PACIFIC CONFERENCE ON SYNTHETIC APERTURE RADAR (APSAR), 2015, : 34 - 37
  • [36] Phase unwrapping by a maximum cross-amplitude spanning tree algorithm: A comparative study
    Takeda, M
    Abe, T
    OPTICAL ENGINEERING, 1996, 35 (08) : 2345 - 2351
  • [37] Fast phase unwrapping algorithm for interferometric applications
    Schofield, MA
    Zhu, YM
    OPTICS LETTERS, 2003, 28 (14) : 1194 - 1196
  • [38] Fast approximate minimum spanning tree based clustering algorithm
    Jothi, R.
    Mohanty, Sraban Kumar
    Ojha, Aparajita
    NEUROCOMPUTING, 2018, 272 : 542 - 557
  • [39] Minimum Spanning Tree Problem Research based on Genetic Algorithm
    Liu, Hong
    Zhou, Gengui
    SECOND INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN, VOL 2, PROCEEDINGS, 2009, : 197 - +
  • [40] Dynamic channel routing algorithm based on minimum spanning tree
    Wei, Jian-Jun
    Kang, Ji-Chang
    Lei, Yan-Jing
    Chen, Fu-Long
    Zhongbei Daxue Xuebao (Ziran Kexue Ban)/Journal of North University of China (Natural Science Edition), 2008, 29 (02): : 120 - 124