8 November 2023 in IEEE Transactions on Geoscience and Remote Sensing
State-of-the-art phase linking (PL) methods for distributed scatterer interferometry (DSI) retrieve consistent phase histories from the sample coherence matrix or the one whose magnitudes are calibrated. To unify them, we first propose a framework consisting of sample coherence matrix estimation and Kullback–Leibler (KL) divergence minimization. Within such framework, we observe that the current state-of-the-art PL methods mainly focus on calibrating the magnitudes of sample coherence matrix while ignoring the errors caused by it exploited in the complex domain, especially when the PL problem is large-dimensional. In this paper, “large-dimensional” refers to the case where the temporal dimension N of coherence matrices and the number P of statistically homogeneous pixels (SHP) are at the same level. To solve this issue, we further propose a PL method, termed LaMIE, which is aimed at precise phase history retrieval from large-dimensional coherence matrices for DSI. It includes two steps: 1) sample coherence matrix shrinkage to calibrate the matrix in complex and real domains and 2) phase history retrieval via the flat coherence metric. Both simulated and real data experiments validate the effectiveness of the proposed method by comparing it with other PL methods. Through LaMIE, the densities of the selected points with stable phases can be significantly improved, and the displacement velocities for more regions can be obtained than with state-of-the-art methods.
14 August 2025 in IEEE Transactions on Geoscience and Remote Sensing
Multipass synthetic aperture radar interferometry (InSAR) is a powerful tool for deformation monitoring, leveraging multiple SAR images to extract surface displacement information over time. However, its application in complex environments, such as scatterers, exhibits a mixture of different scattering behaviors within a single resolution cell or in close proximity, remains challenging due to the errors in phase linking (PL) caused by deviations from the standard statistical model, i.e., the complex circular Gaussian (CCG) distribution. This article proposes an advanced approach for addressing such issues in InSAR time-series analysis. We introduce a novel pixel selection algorithm, HetPS, based on the $\mathcal {KM}$ distribution, which models both spatial and temporal heterogeneity of scatterers. This method enhances the robustness of the pixel selection process. Additionally, we present a new PL algorithm, HetPL, which builds on the pixel selection strategy and conducts the phase history reconstruction for those heterogeneous scatterers following the $\mathcal {KM}$ distribution. The methods’ effectiveness is demonstrated using both synthetic and real TerraSAR-X data. Results show that the proposed methods significantly improve phase history stability and deformation estimation accuracy, outperforming traditional techniques in regions with strong heterogeneity.
29 April 2024 in IEEE Transactions on Computational Imaging
Recently, complex convolutional sparse coding (ComCSC) has demonstrated its effectiveness in interferometric phase restoration, owing to its prominent performance in noise mitigation and detailed phase preservation. By incorporating the estimated coherence into ComCSC as prior knowledge for re-weighting individual complex residues, coherence-guided complex convolutional sparse coding (CoComCSC) further improves the quality of restored phases, especially over heterogeneous land-covers with rapidly varying coherence. However, due to the exploited $L_{2}$ norm of the data fidelity term, the original CoComCSC is not robust to outliers when relatively low coherence values are sparsely distributed over high ones. We propose CoComCSC-L1 and CoComCSC-Huber to improve the robustness of CoComCSC based on the $L_{1}$ and Huber norms. Moreover, we propose an efficient solver to decrease the computational cost of solving the linear system subproblem within ComCSC-based optimization problems. By comparing the proposed methods to other state-of-the-art methods using both simulated and real data, the proposed methods demonstrate their effectiveness. Additionally, the proposed solver has the potential to improve optimization speed by approximately 10% compared to the state-of-the-art solver.