A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint
Summary: This paper investigates a structured sparse SAR imaging algorithm for point scattering model based on tensor decomposition. Several SAR imaging schemes have been developed by researchers for improving the imaging quality. For a typical SAR target scenario, the scatterers distribution usually has the feature of structured sparsity. Without considering this feature thoroughly, the existing schemes have still certain drawbacks. The classic matching pursuit algorithms can obtain clearer imaging results, but the cost is resulting in an extreme complexity and a huge computation resource consumption. Therefore, this paper put forward a tensor-based SAR imaging algorithm by means of multiway structured sparsity which makes full use of the above geometrical feature of the scatterers distribution. The spotlight SAR observation signal is formulated as a Tucker model considering the Kronecker constraint, and then a sparse reconstruction algorithm is introduced by utilizing the structured sparsity of the scene. The proposed tensor-based SAR imaging model is able to take advantage of the Kronecker information in each mode, which ensures the robustness for the signal reconstruction. Both the algorithm complexity analysis and numerical simulations show that the proposed method requires less computation than the existing sparsity-driven SAR imaging algorithms. The imaging realizations based on the practical measured data also indicate that the proposed algorithm is superior to the reference methods even in the severe noisy environment, under the condition of multiway structured sparsity.
- Sparse SAR imaging based on \(L_{1/2}\) regularization
- Synthetic Aperture Imaging and Motion Estimation Using Tensor Methods
- Sparse microwave imaging: principles and applications
- Sparse synthetic aperture radar imaging with optimized azimuthal aperture
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- A Compressive Sensing Data Acquisition and Imaging Method for Stepped Frequency GPRs
- A CS recovery algorithm for model and time delay identification of MISO-FIR systems
- Accelerating the Nonuniform Fast Fourier Transform
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Compressed sensing
- Computing Sparse Representations of Multidimensional Signals Using Kronecker Bases
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Feature-enhanced synthetic aperture radar image formation based on nonquadratic regularization
- Greed is Good: Algorithmic Results for Sparse Approximation
- scientific article; zbMATH DE number 1484341 (Why is no real title available?)
- scientific article; zbMATH DE number 822593 (Why is no real title available?)
- Kronecker Compressive Sensing
- Multiarray signal processing: tensor decomposition meets compressed sensing
- Sparse solutions to underdetermined Kronecker product systems
- Stable, Robust, and Super Fast Reconstruction of Tensors Using Multi-Way Projections
- Structured Compressed Sensing: From Theory to Applications
- Synthetic aperture radar signal processing with Matlab algorithms
- Tensor Decompositions and Applications
This page was built for publication: A tensor decomposition based multiway structured sparse SAR imaging algorithm with Kronecker constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662582)
