一種新的相位展開(kāi)算法--最近相鄰點(diǎn)連接算法
A New Phase Unwrapping Algorithm-Nearest Point Linking
-
摘要: 該文提出了一種新的相位展開(kāi)算法--最近相鄰點(diǎn)連接(Nearest Point Linking,NPL)算法,該算法是在Goldstein算法相位展開(kāi)的基礎(chǔ)上,通過(guò)事先連接距離最近的、極性相反的殘余點(diǎn),降低殘余點(diǎn)的密度,再使用Goldstein的殘余點(diǎn)連接方法連接剩余的殘余點(diǎn),從而達(dá)到了很好的殘余點(diǎn)連接效果。實(shí)驗(yàn)結(jié)果驗(yàn)證了在高密度殘余點(diǎn)情況下此算法的有效性。
-
關(guān)鍵詞:
- SAR干涉; 相位展開(kāi); 殘余點(diǎn); 最近相鄰點(diǎn)
Abstract: A new unwrapping algorithm-Nearest Point Linking (NPL) algorithm is presented based on the Goldstein algorithm. It decreases the residue number by smoothing the couple residues in nearest distance. Then, the Goldstein algorithm is applied to link the other residues. As a result, a good solution is achieved. The experiment shows the validation of the algorithm in high-density residue condition. -
Goldstein R M, Zebker H A, Werner C L. Satellite radar interferometry: Two-dimensional phase unwrapping[J].Radio Sci.1988, 23(4):713-[2]Ghiglia D C, Pritt MD. Two-Dimensional Phase Unwrapping,Theory, Algorithms, and Software. New York: A WileyInterscience Publication, JOHN WILEY SONS, INC. 1998:103- 121.[3]尤紅建,劉彤,蘇林,劉少創(chuàng),郭冠軍,李樹(shù)楷.城市DSM的快速獲取及三維顯示的研究.遙感學(xué)報(bào),2001,5(1):8-12. -
計(jì)量
- 文章訪(fǎng)問(wèn)數(shù): 2632
- HTML全文瀏覽量: 139
- PDF下載量: 673
- 被引次數(shù): 0
下載:
