%0 Journal Article
%T Redundancy Removal Algorithm in Minimum Spanning Tree Phase Unwrapping for Interferometric SAR<br>最小生成树相位解缠中冗余去除算法
%A YANG Lei
%A ZHAO Yong-jun
%A WANG Zhi-gang
%A <br>杨磊
%A 赵拥军
%A 王志刚
%J 遥感学报
%D 2006
%I 
%X Goldstein's branch-cut algorithm is now the most classical one of the known phase unwrapping algorithms.It connects residues with branch-cut lines to neutralize their charges so that the integral path(can't) stride over the branches in the process of phase unwrapping,thus avoiding pervasion of error.However,due to improper connections,this always brings about excessive branch-cut lines,and even many lines form a closed 'dead area' that can not be unwrapped,especially when many residues exist.This paper presents a removal redundancy algorithm in phase unwrapping based on minimum spanning tree theory,and its implementation is described in detail.It can accurately remove the redundancies of the branch-cut tree and ensure the effectiveness of phase unwrapping.
%K interferometric SAR
%K phase unwrapping
%K minimum spanning tree
%K branch-cut
%K redundancy<br>干涉SAR
%K 相位解缠
%K 最小生成树
%K 枝切线
%K 冗余
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=E62459D214FD64A3C8082E4ED1ABABED5711027BBBDDD35B&cid=A41A70F4AB56AB1B&jid=F926358B31AC94511E4382C083F7683C&aid=1DAA1EE373B07AEE&yid=37904DC365DD7266&vid=F3090AE9B60B7ED1&iid=B31275AF3241DB2D&sid=D698D0190A84C2BD&eid=BEBF2238C7F1C1F1&journal_id=1007-4619&journal_name=遥感学报&referenced_num=0&reference_num=17