An imaging algorithm based on compressed sensing（CS） for the multi-ship motion target is presented. In order to reduce the quantity of data transmission in searching the ships on a large sea area, both range and azi...An imaging algorithm based on compressed sensing（CS） for the multi-ship motion target is presented. In order to reduce the quantity of data transmission in searching the ships on a large sea area, both range and azimuth of the moving ship targets are converted into sparse representation under certain signal basis. The signal reconstruction algorithm based on CS at a distant calculation station, and the Keystone and fractional Fourier transform（FRFT） algorithm are used to compensate range migration and obtain Doppler frequency. When the sea ships satisfy the sparsity, the algorithm can obtain higher resolution in both range and azimuth than the conventional imaging algorithm. Some simulations are performed to verify the reliability and stability.展开更多
A new method which employs compressive sensing(CS) to reconstruct the sparse spectrum is designed and experimentally demonstrated. On the basis of CS theory, the simulation results indicate that the probability of rec...A new method which employs compressive sensing(CS) to reconstruct the sparse spectrum is designed and experimentally demonstrated. On the basis of CS theory, the simulation results indicate that the probability of reconstruction is high when the step of the sparsity adaptive matching pursuit algorithm is confirmed as 1. Contrastive analysis for four kinds of commonly used measurement matrices: part Hadamard, Bernoulli, Toeplitz and Circular matrix, has been conducted. The results illustrate that the part Hadamard matrix has better performance of reconstruction than the other matrices. The experimental system of the spectral compression reconstruction is mainly based on the digital micro-mirror device(DMD). The experimental results prove that CS can reconstruct sparse spectrum well under the condition of 50% sampling rate. The system error 0.0781 is obtained, which is defined by the average value of the 2-norm. Furthermore, the proposed method shows a dominant ability to discard redundancy.展开更多
The performance guarantees of generalized orthogonal matching pursuit（ gOMP） are considered in the framework of mutual coherence. The gOMP algorithmis an extension of the well-known OMP greed algorithmfor compressed...The performance guarantees of generalized orthogonal matching pursuit（ gOMP） are considered in the framework of mutual coherence. The gOMP algorithmis an extension of the well-known OMP greed algorithmfor compressed sensing. It identifies multiple N indices per iteration to reconstruct sparse signals.The gOMP with N≥2 can perfectly reconstruct any K-sparse signals frommeasurement y = Φx if K 〈1/N（1/μ-1） ＋1,where μ is coherence parameter of measurement matrix Φ. Furthermore,the performance of the gOMP in the case of y = Φx ＋ e with bounded noise ‖e‖2≤ε is analyzed and the sufficient condition ensuring identification of correct indices of sparse signals via the gOMP is derived,i. e.,K 〈1/N（1/μ-1）＋1-（2ε/Nμxmin） ,where x min denotes the minimummagnitude of the nonzero elements of x. Similarly,the sufficient condition in the case of G aussian noise is also given.展开更多
基金supported by the National Natural Science Foundation of China(61271342)
文摘An imaging algorithm based on compressed sensing（CS） for the multi-ship motion target is presented. In order to reduce the quantity of data transmission in searching the ships on a large sea area, both range and azimuth of the moving ship targets are converted into sparse representation under certain signal basis. The signal reconstruction algorithm based on CS at a distant calculation station, and the Keystone and fractional Fourier transform（FRFT） algorithm are used to compensate range migration and obtain Doppler frequency. When the sea ships satisfy the sparsity, the algorithm can obtain higher resolution in both range and azimuth than the conventional imaging algorithm. Some simulations are performed to verify the reliability and stability.
基金supported by the National Natural Science Foundation of China(Nos.61002013 and 11504435)the Natural Science Foundation of Hubei Province(No.2014CFA051)+1 种基金the Key Technology R&D Program of Hubei Province(No.2015BCE048)the Fundamental Research Funds for the Central Universities,South-Central University for Nationalities(Nos.CZY13034,CZW15055 and CZP17026)
文摘A new method which employs compressive sensing(CS) to reconstruct the sparse spectrum is designed and experimentally demonstrated. On the basis of CS theory, the simulation results indicate that the probability of reconstruction is high when the step of the sparsity adaptive matching pursuit algorithm is confirmed as 1. Contrastive analysis for four kinds of commonly used measurement matrices: part Hadamard, Bernoulli, Toeplitz and Circular matrix, has been conducted. The results illustrate that the part Hadamard matrix has better performance of reconstruction than the other matrices. The experimental system of the spectral compression reconstruction is mainly based on the digital micro-mirror device(DMD). The experimental results prove that CS can reconstruct sparse spectrum well under the condition of 50% sampling rate. The system error 0.0781 is obtained, which is defined by the average value of the 2-norm. Furthermore, the proposed method shows a dominant ability to discard redundancy.
基金Supported by the National Natural Science Foundation of China(60119944,61331021)the National Key Basic Research Program Founded by MOST(2010C B731902)+1 种基金the Program for Changjiang Scholars and Innovative Research Team in University(IRT1005)Beijing Higher Education Young Elite Teacher Project(YET P1159)
文摘The performance guarantees of generalized orthogonal matching pursuit（ gOMP） are considered in the framework of mutual coherence. The gOMP algorithmis an extension of the well-known OMP greed algorithmfor compressed sensing. It identifies multiple N indices per iteration to reconstruct sparse signals.The gOMP with N≥2 can perfectly reconstruct any K-sparse signals frommeasurement y = Φx if K 〈1/N（1/μ-1） ＋1,where μ is coherence parameter of measurement matrix Φ. Furthermore,the performance of the gOMP in the case of y = Φx ＋ e with bounded noise ‖e‖2≤ε is analyzed and the sufficient condition ensuring identification of correct indices of sparse signals via the gOMP is derived,i. e.,K 〈1/N（1/μ-1）＋1-（2ε/Nμxmin） ,where x min denotes the minimummagnitude of the nonzero elements of x. Similarly,the sufficient condition in the case of G aussian noise is also given.
