传统捷变频成像方法具有高旁瓣、低分辨率的缺点。鉴于捷变频ISAR回波信号的稀疏性,该文基于原始数据的2维压缩感知方案,在贝叶斯原理框架下,用稀疏贝叶斯算法方差成分扩张压缩方法(Ex Co V)实现捷变频ISAR像的重建。贝叶斯框架下的稀疏重构算法考虑了稀疏信号的先验信息以及测量过程中的加性噪声,因而能够更好地重建目标系数。作为一种新的稀疏贝叶斯算法,Ex Co V不同于稀疏贝叶斯学习(SBL)算法中赋予所有的信号元素各自的方差分量参数,Ex Co V方法仅仅赋予有重要意义的信号元素不同的方差分量,并拥有比SBL方法更少的参数,克服了SBL算法参数多时效性差的缺点。仿真结果表明,该方法能克服传统捷变频成像缺点,并能够实现低信噪比条件下的2维高精度成像。
High resolution range imaging with correlation processing suffers from high sidelobe pedestal in random frequency-hopping wideband radar. After the factors which affect the sidelobe pedestal being analyzed, a compressed sensing based algorithm for high resolution range imaging and a new minimized ll-norm criterion for motion compensation are proposed. The random hopping of the transmitted carrier frequency is converted to restricted isometry property of the observing matrix. Then practical problems of imaging model solution and signal parameter design are resolved. Due to the particularity of the proposed algorithm, two new indicators of range profile, i.e., average signal to sidelobe ratio and local similarity, are defined. The chamber measured data are adopted to testify the validity of the proposed algorithm, and simulations are performed to analyze the precision of velocity measurement as well as the performance of motion compensation. The simulation results show that the proposed algorithm has such advantages as high precision velocity measurement, low sidelobe and short period imaging, which ensure robust imaging for moving targets when signal-to-noise ratio is above 10 dB.
Narrowband radar has been successfully used for high resolution imaging of fast rotating targets by exploiting their micro-motion features.In some practical situations,however,the target image may suffer from aliasing due to the fixed pulse repetition interval(PRI)of traditional radar scheme.In this work,the random PRI signal associated with compressed sensing(CS)theory was introduced for aliasing reduction to obtain high resolution images of fast rotating targets.To circumvent the large-scale dictionary and high computational complexity problem arising from direct application of CS theory,the low resolution image was firstly generated by applying a modified generalized Radon transform on the time-frequency domain,and then the dictionary was scaled down by random undersampling as well as the atoms extraction according to those strong scattering areas of the low resolution image.The scale-down-dictionary CS(SDD-CS)processing scheme was detailed and simulation results show that the SDD-CS scheme for narrowband radar can achieve preferable images with no aliasing as well as acceptable computational cost.
Inverse synthetic aperture radar(ISAR) imaging can be regarded as a narrow-band version of the computer aided tomography(CT). The traditional CT imaging algorithms for ISAR, including the polar format algorithm(PFA) and the convolution back projection algorithm(CBP), usually suffer from the problem of the high sidelobe and the low resolution. The ISAR tomography image reconstruction within a sparse Bayesian framework is concerned. Firstly, the sparse ISAR tomography imaging model is established in light of the CT imaging theory. Then, by using the compressed sensing(CS) principle, a high resolution ISAR image can be achieved with limited number of pulses. Since the performance of existing CS-based ISAR imaging algorithms is sensitive to the user parameter, this makes the existing algorithms inconvenient to be used in practice. It is well known that the Bayesian formalism of recover algorithm named sparse Bayesian learning(SBL) acts as an effective tool in regression and classification,which uses an efficient expectation maximization procedure to estimate the necessary parameters, and retains a preferable property of the l0-norm diversity measure. Motivated by that, a fully automated ISAR tomography imaging algorithm based on SBL is proposed.Experimental results based on simulated and electromagnetic(EM) data illustrate the effectiveness and the superiority of the proposed algorithm over the existing algorithms.
The sparse recovery algorithms formulate synthetic aperture radar （SAR） imaging problem in terms of sparse representation （SR） of a small number of strong scatters＇ positions among a much large number of potential scatters＇ positions, and provide an effective approach to improve the SAR image resolution. Based on the attributed scatter center model, several experiments were performed with different practical considerations to evaluate the performance of five representative SR techniques, namely, sparse Bayesian learning （SBL）, fast Bayesian matching pursuit （FBMP）, smoothed 10 norm method （SL0）, sparse reconstruction by separable approximation （SpaRSA）, fast iterative shrinkage-thresholding algorithm （FISTA）, and the parameter settings in five SR algorithms were discussed. In different situations, the performances of these algorithms were also discussed. Through the comparison of MSE and failure rate in each algorithm simulation, FBMP and SpaRSA are found suitable for dealing with problems in the SAR imaging based on attributed scattering center model. Although the SBL is time-consuming, it always get better performance when related to failure rate and high SNR.
