Compressed sensing (CS) has provided a novel way for inverse synthetic aperture radar (ISAR) imaging. In CS based ISAR imaging, the continuous range-Doppler plane is divided into grids, and the strong scattering points are assumed on the grids. However, the strong scattering points may not be on the grids, which will degrade the performance of CS greatly. This is the off-grid problem. To solve the problem, most of existing methods aim at estimating off-grid error and sparse solution jointly. But the computational cost is relatively high. To reduce the computational cost, a fast and accurate algorithm has been proposed in this paper. Interestingly, the joint optimization problem can be solved efficiently through two least squares problems based on first order Taylor approximation. When applied into simulated chirp signal and quasi real ISAR data, the proposed algorithm has got much better imaging results than existing algorithms. Therefore, it is a promising off-grid CS based ISAR imaging algorithm.
Compressed sensing (CS) provides a new idea for inverse synthetic aperture radar (ISAR) imaging. Complex approximate message passing (CAMP) algorithm, as a new CS reconstruction algorithm, has characteristics of fast convergence and good reconstruction, which is suitable for ISAR imaging. However, the off-grid problem is inevitable in ISAR imaging, which affects the reconstruction performance seriously and needs to be solved urgently. To solve the off-grid problem, a parametric CS ISAR imaging model is built in this paper, in which the off-grid is considered as an unknown parameter. To solve the joint optimization problem efficiently, first-order Taylor series approximation is used and the optimization problem is transformed into two least squares problems. To verify the effectiveness of the proposed method, it is applied into random discrete signals, complex sinusoids, quasi-real ISAR data and real ISAR data. Compared with the existing algorithms, the proposed method has got higher reconstruction signal-to-noise ratio (RSNR), smaller relative reconstruction error, smaller frequency position error and better imaging result. Therefore the proposed method is an effective CS ISAR imaging method which can solve the off-grid problem well.
Complex approximate message passing (CAMP) algorithm is a promising compressed sensing (CS) method for inverse synthetic aperture radar (ISAR) imaging with the merits of fast convergence and good reconstruction. To improve the imaging performance and accelerate the convergence, a new strategy weighted CAMP based ISAR imaging method has been proposed. Rather than solving a sequence of weighted ${l}_{{1}}$ minimization problems, the weighted CAMP problem is solved directly by using a new weighted threshold, which not only ensures the convergence of the algorithm but also improves the convergence speed. To accelerate the convergence furtherly, a new point is chosen smartly in the scalar threshold function, which borrows the idea of fast iterative shrinkage-thresholding algorithm (FISTA). As weighting adaptively to the signal and the noise is more appropriate to maintain the target information and suppress the noise, random forests (RF) algorithm is employed to classify the signal and the noise, and strategy weighting is used based on the classification result. The proposed algorithm was applied into complex sinusoids, quasi-real, and real ISAR data. It has got the best imaging result among the algorithms of CAMP class and need less imaging time than CAMP and weighted CAMP (WCAMP). Therefore, the proposed algorithm is an efficient ISAR imaging method with good performance.
The widely used distributions in Bayesian compressed sensing (BCS) inverse synthetic aperture radar (ISAR) imaging do not support stable linear dimensionality reduction, and the compressibility of the recently proposed distributions is hard to be proved theoretically. However, generalised pareto distribution (GPD) can overcome these shortcomings. So a GPD‐based ISAR imaging method has been proposed. Interestingly, shape parameter can be set to a small value directly based on mathematical proof in one kind of GPD‐Meridian distribution, which is totally different from the existing methods. It not only simplifies the method but also improves the sparsity of the solution. It has been proved that the proposed method now is equal to the log‐sum minimisation, which verifies the correctness of the parameter selecting algorithm. Compared with the conventional methods, the new method can recover signals with fewer measurements or in looser sparsity conditions or with smaller recovery errors. When applied into simulated and real ISAR data imaging, the proposed method has obtained better images than the conventional methods. Therefore, the proposed method is a promising imaging method in BCS ISAR imaging.
23 April 2024 in International Journal of Remote Sensing
To improve the performance of inverse synthetic aperture radar (ISAR) imaging based on compressed sensing (CS), a new algorithm based on log-sum minimization is proposed. A new interpretation of the algorithm is also provided. Compared with the conventional algorithm, the new algorithm can recover signals based on fewer measurements, in looser sparsity condition, with smaller recovery error, and it has obtained better sinusoidal signal spectrum and imaging result for real ISAR data. Therefore, the proposed algorithm is a promising imaging algorithm in CS ISAR.