Abstract

Sparse aperture (SA) autofocusing and imaging is a hot research problem in the signal processing field and has been widely used. Under SA, the absence of echoes destroys the coherence between the pulses, which then affects the autofocusing accuracy of the imaging, leading to defocus of the image. In this paper, a novel SA autofocusing and imaging algorithm based on Sparse Bayesian Learning (SBL) is proposed, which uses a fast SBL algorithm to achieve SA high resolution imaging, and uses the minimum Tsallis entropy algorithm to realize autofocusing. As is known to all, SBL has strong robustness and high precision. Unfortunately, the direct calculation of the inversion and multiplication operations involved in each iteration of SBL results in significant computational costs. In the proposed fast SBL algorithm, the matrix required to be inverted has a special structure. The inverse matrix can then be represented by Gohberg-Semencul (G-S) factorization. And almost all operations except for G-S factorization during each iteration can be completed by fast Fourier transform (FFT) or inverse FFT (IFFT), which greatly reduces the amount of computation by several orders of magnitude. In each SBL iteration, the minimum Tsallis entropy algorithm is used for estimating the phase error, which has better noise sensitivity and obtains the images with the best focused degree. Finally, the effectiveness and high efficiency of the proposed fast algorithm are verified by experimental results obtained by simulation and measured data.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.