Robust Interferometric ISAR Imaging With UAMP-Based Joint Sparse Signal Recovery

Sparse Bayesian learning (SBL) has found successful applications in interferometric inverse synthetic aperture radar (InISAR) imaging, especially in the presence of limited number of pulses or when using sparse apertures. SBL-based InISAR algorithms have been proven to be significantly superior to F...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on aerospace and electronic systems 2023-08, Vol.59 (4), p.1-19
Hauptverfasser: Kang, Hailong, Li, Jun, Guo, Qinghua, Martorella, Marco, Giusti, Elisa, Cai, Jinjian
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Sparse Bayesian learning (SBL) has found successful applications in interferometric inverse synthetic aperture radar (InISAR) imaging, especially in the presence of limited number of pulses or when using sparse apertures. SBL-based InISAR algorithms have been proven to be significantly superior to Fourier transform-based ones. However, the existing SBL-based algorithms are slow due to their high computational complexity. Moreover, there is also much room to improve in terms of imaging performance. In this work, leveraging the approximate message passing with unitary transformation (UAMP), we propose an InISAR imaging algorithm named UAMP-JSR (joint sparse recovery), which is much faster and delivers notably higher imaging accuracy than the existing SBL-based algorithms. Specifically, we develop a type-2 joint sparse model (JSM-2) for InISAR imaging and formulate it as a two-layer multiple measurement vectors (MMV) joint sparse problem. Based on a factor graph representation, the message passing techniques are used to efficiently solve this problem, which leads to the UAMP-JSR algorithm. Results based on extensive simulations and experiments based on the real data collected by the Pisa Radar (PIRAD) demonstrate the effectiveness and superiority of the proposed algorithm compared to existing algorithms.
ISSN:0018-9251
1557-9603
DOI:10.1109/TAES.2022.3233545