检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张妍[1] 冯大政[2] 曲小宁[2] 顾潮琪[1]
机构地区:[1]西北工业大学电子信息学院,西安710072 [2]西安电子科技大学雷达信号处理国家重点实验室,西安710071
出 处:《电子科技大学学报》2013年第4期555-558,共4页Journal of University of Electronic Science and Technology of China
基 金:国家自然科学基金(60971111)
摘 要:该文在Goldstein枝切法的基础上提出了一种改进的枝切法。该算法对干涉图中的正负残差点进行组合,再以枝切线的长度和作为评价值对干涉图中的正负残差点进行重新替换组合,使整体枝切线的长度和减小,有效地克服了相位解缠时在残差点密集区易出现的"孤岛现象"问题。仿真数据以及实测数据验证了该算法的可行性和有效性。Interferometric synthetic aperture radar (InSAR) measures the height of the object based on the distance difference reflected by the absolute phase difference of the corresponding pixels on two pieces of synthetic aperture radar (SAR). But in fact the phase difference is restricted to (-n, n), which causes phase wrap. The branch-cut method is one of the most important approaches for the phase unwrapping. In this paper, an improved branch-cut algorithm is proposed based on the Goldstein algorithm. The positive and the negative residues in the interference image are combined in this algorithm and then re-combined and replaced by using the length of the branch-cut as criteria so that the overall length of the branch-cut can be reduced gradually and the "isolated island phenomenon" in the unwrapping process can be overcome effectively. The proposed method has been verified through both the simulated and experimental data.
分 类 号:TN957[电子电信—信号与信息处理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15