首页 | 本学科首页   官方微博 | 高级检索  
     检索      

最小生成树相位解缠中冗余去除算法
引用本文:杨磊,赵拥军,王志刚.最小生成树相位解缠中冗余去除算法[J].遥感学报,2006,10(6):879-884.
作者姓名:杨磊  赵拥军  王志刚
作者单位:1. 信息工程大学,信息工程学院,河南,郑州,450002
2. 信息工程大学,信息工程学院,河南,郑州,450002;北京理工大学,电子工程系,北京,100081
摘    要:目前,相位解缠的方法中以Goldstein提出的枝切法最为经典,它通过枝切线将残差点相互连接使得残差点电荷中和,在相位展开处理的积分中,积分路径不能穿过分支,从而限制误差的传播。但是由于枝切线连接策略的不合理,往往造成连成的枝切线过多、过长,甚至多条枝切线形成闭合区域,造成不能解缠的“死区”,特别是在残差点较多的情况,这种现象更为严重。本文在最小生成树原理的基础上,提出的枝切线冗余去除算法能简单、准确地去除枝切树中的冗余,并保证了相位解缠具有最好的效果。

关 键 词:干涉SAR  相位解缠  最小生成树  枝切线  冗余
文章编号:1007-4619(2006)06-0879-06
收稿时间:2005-05-13
修稿时间:2006-03-15

Redundancy Removal Algorithm in Minimum Spanning Tree Phase Unwrapping for Interferometric SAR
YANG Lei,ZHAO Yong-jun and WANG Zhi-gang.Redundancy Removal Algorithm in Minimum Spanning Tree Phase Unwrapping for Interferometric SAR[J].Journal of Remote Sensing,2006,10(6):879-884.
Authors:YANG Lei  ZHAO Yong-jun and WANG Zhi-gang
Institution:1. Information Engineering University, Henan Zhengzhou 450002, China ; 2. Department of Electronic Engineering, Beijing University of Technology, Beijing 100081, China
Abstract: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.
Keywords:interferometric SAR  phase unwrapping  minimum spanning tree  branch-cut  redundancy
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《遥感学报》浏览原始摘要信息
点击此处可从《遥感学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号