Abstract
The traditional compressed sensing ISAR imaging algorithm is based on row and column stacking, the image matrix is arranged as a long vector, and then a one-dimensional compressed sensing method is used to obtain the sparse representation of the target image. The biggest problem with traditional methods is that the stacked vectors are so large that the measurement matrices are large, making the algorithms very time-consuming. In addition, the traditional algorithm in the real domain, so in the processing of ISAR imaging data, need to complex measurement matrix diagonalization of real processing results such that the expected circular constraint space into square constraint space, increases the range of spatial constraints will inevitably increase the algorithm error. In this paper, a complex domain compressed sensing algorithm for two-dimensional space is proposed. The processing result proves the feasibility of the algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: DEStech Transactions on Computer Science and Engineering
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.