發(fā)布時間：2018-05-14 09:17

  本文選題：高精度InSAR + 配準　； 參考：《電子科技大學》2014年碩士論文

【摘要】：具有全天候、全天時測量能力的合成孔徑雷達干涉(InSAR)測量技術(shù),在大范圍地形高程測繪方面具有廣泛的應(yīng)用前景。本文針對高精度InSAR配準和相位解纏技術(shù)進行了詳細研究,分析了相關(guān)算法優(yōu)缺點,并提出了改進的算法,最后結(jié)合仿真及實測數(shù)據(jù)對比分析了各算法性能。所做的具體工作及創(chuàng)新如下:(1)研究了基于DFT模型的高效精配準算法。本文指出了InSAR主副圖像地距分辨率不均勻?qū)е略撍惴ㄟ_不到配準要求的問題,提出了使用分塊策略進行精配準的方法,使用實測數(shù)據(jù)進行了驗證,針對配準結(jié)果只有部分干涉紋的情況,分塊處理在大部分干涉相位圖都能得到干涉紋,大大提高了配準效果。(2)研究了路徑跟蹤類相位解纏算法。首先分析了Goldstein枝切法的優(yōu)缺點。研究并指出了Goldstein枝切法布置枝切線時的不足,在此基礎(chǔ)上提出了改進的枝切法。改進的枝切法和Goldstein枝切法相比能獲得更好的枝切線,解纏結(jié)果誤差少,且消除了Goldstein枝切法解纏結(jié)果可能存在的解纏空洞,明顯提高了解纏效果。最后本文仿真了不連續(xù)相位曲面的解纏情況,指出了該類算法的適用條件,同時也說明了對存在不連續(xù)時實測數(shù)據(jù)解纏處理該類算法可能失敗。(3)研究了最小范數(shù)類相位解纏算法。首先指出了最小二乘法相位解纏算法和迭代最小二乘相位解纏算法解纏結(jié)果是真實相位的估計值,解纏誤差較大,分布廣泛。在此基礎(chǔ)上提出改進的迭代最小二乘相位解纏算法,通過推導(dǎo)公式發(fā)現(xiàn),當解纏相位與真實相位的差不存在纏繞時,可以將解纏相位與纏繞相位的相位差主值加入到解纏相位中,得到精確的解纏相位。改進算法對仿真和實測數(shù)據(jù)解纏只有非常少的解纏誤差,驗證了改進算法的解纏性能。同時本文也通過仿真不連續(xù)相位面,說明了該算法不適用于不連續(xù)相位解纏。最后研究了圖割相位解纏算法,該算法通過將相位解纏問題轉(zhuǎn)化為圖像分割問題,每次對分割得到的兩部分分別加0或者2?,迭代到不能分割得到解纏相位。該算法能夠識別不連續(xù),打破連續(xù)性條件限制。同時其解纏精度非常高,仿真和實測數(shù)據(jù)都證明了該算法的有效性�？傊�,本文提出了InSAR高精度圖像配準算法和相位解纏算法,為高精度InSAR數(shù)據(jù)處理提供了新的研究思路。
[Abstract]:Synthetic aperture radar interferometry (InSAR) measurement technology with all-weather and all-weather measurement is widely used in large range terrain elevation surveying and mapping. In this paper, the high precision InSAR registration and phase unwrapping technology are studied in detail, the advantages and disadvantages of the related algorithms are analyzed, and the improved algorithm is put forward. Finally, the simulation is combined with imitation. The performance of each algorithm is compared and analyzed. The specific work and innovation are as follows: (1) the efficient and accurate registration algorithm based on the DFT model is studied. This paper points out the problem that the uneven resolution of the InSAR main and vice image leads to the problem that the algorithm can not reach the registration requirements, and proposes a method of using the block strategy to carry out the precise registration. The measured data are verified. In case the registration results only partially interfere with the pattern, the block processing can get the interference pattern in most interference phase diagrams, which greatly improves the registration effect. (2) the phase unwrapping algorithm of path tracking class is studied. First, the advantages and disadvantages of the Goldstein branch cutting method are analyzed. The Goldstein char method is studied and pointed out. The improved branch cutting method is proposed on this basis. The improved branch cutting method can obtain better branch tangent compared with the Goldstein branch cutting method, and the error of the unwrapping result is less, and the unwrapping holes that may exist in the unwrapping result of the Goldstein branch cutting method are eliminated, and the entangling effect is obviously improved. Finally, the discontinuous phase is simulated. The application conditions of this kind of algorithm are pointed out. At the same time, the possible failure of this kind of algorithm is explained. (3) the minimum norm phase unwrapping algorithm is studied. First, it is pointed out that the least squares phase unwrapping algorithm and the iterative least squares phase unwrapping algorithm are true. An improved iterative least square phase unwrapping algorithm is proposed. By deriving the formula, it is found that when the difference between the unwrapping phase and the real phase is not entangled, the phase difference between the unwrapping phase and the entangled phase can be added to the unwrapping phase, and the exact solution can be obtained. The improved algorithm has only very little unwrapping error for the simulation and the measured data, and verifies the unwrapping performance of the improved algorithm. At the same time, this paper also shows that the algorithm is not suitable for discontinuous phase unwrapping by simulation of the discontinuous phase surface. Finally, the graph cut phase unwrapping algorithm is studied. The algorithm transfers the phase unwrapping problem by turning the phase unwrapping problem. The algorithm is transformed into image segmentation problem. Each time the two parts of the segmentation are added to 0 or 2 respectively, the unwrapping phase can not be segmented. The algorithm can recognize discontinuity and break the continuity condition limit. At the same time, its unwrapping accuracy is very high. Both the simulation and the measured data prove the effectiveness of the algorithm. In a word, the high precision of InSAR is proposed. Image registration algorithm and phase unwrapping algorithm provide a new research idea for high precision InSAR data processing.

【學位授予單位】：電子科技大學
【學位級別】：碩士
【學位授予年份】：2014
【分類號】：TN957.52

【參考文獻】

相關(guān)期刊論文 前2條

1 董春敏;劉國林;于勝文;劉偉科;周偉;;加權(quán)最小二乘相位解纏的一種改進[J];大地測量與地球動力學;2011年S1期

2 楊福芹;郭增長;王苗苗;李春意;;InSAR基線要素對測高精度影響分析[J];河南理工大學學報(自然科學版);2007年02期

相關(guān)博士學位論文 前1條

1 楊文濤;分數(shù)傅里葉變換在數(shù)字圖像處理中的應(yīng)用研究[D];華中科技大學;2007年

相關(guān)碩士學位論文 前2條

1 穆文爭;干涉SAR測高測速技術(shù)研究[D];電子科技大學;2008年

2 宗晟璇;InSAR圖像配準算法研究[D];湖南師范大學;2009年

，

本文編號：1887266