Abstract
For real aperture radar, its azimuth resolution is much coarser than the range resolution after pulse compression, super-resolution algorithms are desired to enhance its azimuth resolution. However, the super-resolution algorithms must require enough azimuth sampling to ensure its performance. When wide scanning scope or dense azimuth sampling, the amount of data will increase significantly, which brings large computational burden to super-resolution processing. To cover this problem, we propose a two-step dimension reduction strategy. Firstly, by using linear sketching technology, the high-dimensional matrices are projected to the low-dimensional space, thus accelerating the matrix-matrix multiplications in super-resolution algorithms. Secondly, exploiting Sherman-Morrison formula, we further realized the acceleration of the matrix inversion in super-resolution algorithms. The proposed two-step acceleration strategy in our work is applicable to the existing deconvolution super-resolution algorithms, including regularization methods, Bayesian methods. It can be verified by simulation and experimental data that the proposed accelerated algorithms have advantages in computing time without losing the quality of super-resolution imaging.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.