ISAR Imaging Based on L1 L0 Norms Homotopy 2D Block Sparse Signal Recovery Algorithm
نویسندگان
چکیده
Many traditional sparse signal recovery based ISAR imaging methods did not utilize the block scatterers information of targets. Some block Bayesian learning based ISAR imaging algorithms are computational expensive. In this paper, a 2D block 1 0 norms homotopy sparse signal recovery algorithm (the BL1L0 algorithm) is proposed and utilized to form the ISAR image. Compared with Bayesian-based algorithms, this algorithm can obtain ISAR images with similar image quality, but the computation speed is faster. Real data experiments verify the merits of our algorithm.
منابع مشابه
ISAR Imaging Based on Iterative Reweighted Lp Block Sparse Reconstruction Algorithm
Sparse signal recovery algorithms can be used to improve radar imaging quality by using the sparse property of strong scatterers. Traditional sparse inverse synthetic aperture radar (ISAR) imaging algorithms mainly consider the recovery of sparse scatterers. However, the scatterers of an ISAR target usually exhibit block or group sparse structure. By utilizing the inherent block sparse structur...
متن کاملSparse Aperture InISAR Imaging via Sequential Multiple Sparse Bayesian Learning
Interferometric inverse synthetic aperture radar (InISAR) imaging for sparse-aperture (SA) data is still a challenge, because the similarity and matched degree between ISAR images from different channels are destroyed by the SA data. To deal with this problem, this paper proposes a novel SA-InISAR imaging method, which jointly reconstructs 2-dimensional (2-D) ISAR images from different channels...
متن کاملSparse Recovery of Streaming Signals Using L1-Homotopy
Most of the existing methods for sparse signal recovery assume a static system: the unknown signal is a finite-length vector for which a fixed set of linear measurements and a sparse representation basis are available and an `1-norm minimization program is solved for the reconstruction. However, the same representation and reconstruction framework is not readily applicable in a streaming system...
متن کاملA Simple Homotopy Proximal Mapping for Compressive Sensing
In this paper, we present a novel yet simple homotopy proximal mapping algorithm for compressive sensing. The algorithm adopts a simple proximal mapping of the l1 norm at each iteration and gradually reduces the regularization parameter for the l1 norm. We prove a global linear convergence of the proposed homotopy proximal mapping (HPM) algorithm for solving compressive sensing under three diff...
متن کاملA Simple Homotopy Proximal Mapping Algorithm for Compressive Sensing
In this paper, we present a novel yet simple homotopy proximal mapping algorithm for compressive sensing. The algorithm adopts a simple proximal mapping for l1 norm regularization at each iteration and gradually reduces the regularization parameter of the l1 norm. We prove a global linear convergence for the proposed homotopy proximal mapping (HPM) algorithm for solving compressive sensing unde...
متن کامل