3D Imaging for Array InSAR Based on Gaussian Mixture Model Clustering

Array InSAR can generate 3D point clouds with the use of SAR images of the observed scene, which are obtained using multiple channels in a single flight. Its resolution power in elevation enables one to solve the layover problem. However, due to the limited number of arrays and the short baseline le...

Full description

Bibliographic Details
Main Authors: Li Hang, Liang Xingdong, Zhang Fubo, Wu Yirong
Format: Article
Language:English
Published: China Science Publishing & Media Ltd. (CSPM) 2017-12-01
Series:Leida xuebao
Subjects:
Online Access:http://radars.ie.ac.cn/fileup/HTML/R17020.htm
Description
Summary:Array InSAR can generate 3D point clouds with the use of SAR images of the observed scene, which are obtained using multiple channels in a single flight. Its resolution power in elevation enables one to solve the layover problem. However, due to the limited number of arrays and the short baseline length, the resolution power in elevation is restricted. Together with the layover phenomenon of the urban buildings, the result of 3D reconstruction suffers from poor accuracy in positioning, and it is difficult to extract the effective characteristics of the buildings. In view of this situation, this paper proposed a 3D reconstruction method of array InSAR based on Gaussian mixture model clustering. First, the 3D point clouds of the observed scene are obtained by an algorithm with super-resolution based on compressive sensing, and then the scatters of buildings are extracted by density estimation; after which the method of Gaussian mixture model clustering is used to classify the 3D point clouds of the buildings. Finally, the inverse SAR images of each region are obtained by using the system parameters, and the 3D reconstruction of the buildings is completed. Based on the actual data of the first domestic 3D imaging experiment by airborne array InSAR, the validity of the algorithm is confirmed and the 3D imaging results of the buildings are obtained.
ISSN:2095-283X
2095-283X