InISAR Imaging for Maneuvering Target Based on the Quadratic Frequency Modulated Signal Model With Time-Varying Amplitude
Interferometric inverse synthetic aperture radar (InISAR) has proven to be an effective tool for 3-D imaging of noncooperative targets. The traditional InISAR imaging algorithms are almost entirely based on the assumption of a constant amplitude polynomial phase signal (PPS) model. However, target...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on geoscience and remote sensing 2022, Vol.60, p.1-17 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Interferometric inverse synthetic aperture radar (InISAR) has proven to be an effective tool for 3-D imaging of noncooperative targets. The traditional InISAR imaging algorithms are almost entirely based on the assumption of a constant amplitude polynomial phase signal (PPS) model. However, target's maneuverability tends to cause the echo signal to exhibit the characteristic of time-varying amplitude (TVA) in practice. To remedy this problem, a novel InISAR imaging algorithm for maneuvering targets based on quadratic frequency modulated (QFM) signal model with TVA is presented. First, the echo of each range cell is modeled as a multicomponent TVA-QFM signal. Then, through the matrix derivation, the parameter estimation problem of this signal is converted to a convex optimization problem. Subsequently, with the help of the scaled Fourier transform (SCFT), an efficient iterative update approach based on alternative direction method of multipliers (ADMM) framework is proposed to solve this optimization problem. Furthermore, associated with the range instantaneous Doppler (RID) method and multichannel interference technology, 2-D ISAR images and 3-D space shape of the target can be generated. Finally, some simulation results are provided to evaluate the effectiveness and robustness of the proposed algorithm. |
---|---|
ISSN: | 0196-2892 1558-0644 |
DOI: | 10.1109/TGRS.2021.3073725 |