Fast Bayesian Compressed Sensing Algorithm via Relevance Vector Machine for LASAR 3D Imaging

Abstract

Because of the three-dimensional (3D) imaging scene’s sparsity, compressed sensing (CS) algorithms can be used for linear array synthetic aperture radar (LASAR) 3D sparse imaging. CS algorithms usually achieve high-quality sparse imaging at the expense of computational efficiency. To solve this problem, a fast Bayesian compressed sensing algorithm via relevance vector machine (FBCS–RVM) is proposed in this paper. The proposed method calculates the maximum marginal likelihood function under the framework of the RVM to obtain the optimal hyper-parameters; the scattering units corresponding to the non-zero optimal hyper-parameters are extracted as the target-areas in the imaging scene. Then, based on the target-areas, we simplify the measurement matrix and conduct sparse imaging. In addition, under low signal to noise ratio (SNR), low sampling rate, or high sparsity, the target-areas cannot always be extracted accurately, which probably contain several elements whose scattering coefficients are too small and closer to 0 compared to other elements. Those elements probably make the diagonal matrix singular and irreversible; the scattering coefficients cannot be estimated correctly. To solve this problem, the inverse matrix of the singular matrix is replaced with the generalized inverse matrix obtained by the truncated singular value decomposition (TSVD) algorithm to estimate the scattering coefficients correctly. Based on the rank of the singular matrix, those elements with small scattering coefficients are extracted and eliminated to obtain more accurate target-areas. Both simulation and experimental results show that the proposed method can improve the computational efficiency and imaging quality of LASAR 3D imaging compared with the state-of-the-art CS-based methods.

Development of Fast Fourier-Compatible Image Reconstruction for 3D Near-Field Bistatic Microwave Imaging With Dynamic Metasurface Antennas

“…In addition to the visual analysis, we also compared the images in Figs. 10 and 11 with the normalized mean squared error (NMSE) quantitative measure [5,39], the results of which are shown in Table IV. Fig.…”

Three-Dimensional Sparse SAR Imaging with Generalized Lq Regularization

“…The observation scene coordinate system is established with O as the coordinate origin. The z-direction is the elevation direction, the x-direction is the cross-track direction, and the y-direction is the along-track direction [32]. In this paper, the transmitting signal of the imaging system is a steppedfrequency (SF) signal.…”

Radar and Sonar Imaging and Processing (2nd Edition)

“…One of the interesting examples of SAR evolution is the linear array synthetic aperture radar (LASAR) presented in [10], which is one of the approaches for obtaining 3D SAR image. LASAR synthesizes the 2D equivalent array by moving the linear array; the 3D imaging results of the imaged scene are then obtained by combination with pulse compression technology.…”

“…CS algorithms usually achieve high-quality sparse imaging at the expense of computational efficiency. To solve this problem, a fast Bayesian compressed sensing algorithm via relevance vector machine (FBCS-RVM) is proposed in [10]. The proposed method calculates the maximum marginal likelihood function under the framework of the RVM to obtain the optimal hyperparameters; the scattering units corresponding to the nonzero optimal hyperparameters are extracted as the target areas in the imaging scene.…”