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.展开更多
提出一种压缩感知正交匹配追踪（CS-OMP）超谐波测量新算法,即运用压缩感知理论,通过引入插值系数,基于离散傅里叶变换（DFT）系数向量和狄利克雷核矩阵,构建了高频率分辨率的压缩感知模型,并基于正交匹配追踪算法,在不增加被测数据观...提出一种压缩感知正交匹配追踪（CS-OMP）超谐波测量新算法,即运用压缩感知理论,通过引入插值系数,基于离散傅里叶变换（DFT）系数向量和狄利克雷核矩阵,构建了高频率分辨率的压缩感知模型,并基于正交匹配追踪算法,在不增加被测数据观测时间前提下,将超谐波测量的频率分辨率提高了一个数量级。数值仿真分析以及两种非线性负荷的实测数据验证的结果表明,该算法可将测得数据频率分辨率由2 k Hz细化为200 Hz,能实现对被测信号中超谐波频率成分的精确定位,也可准确求解出其幅值信息,从而有效地弥补了DFT算法存在的观测时间与频率分辨率互相限制的固有缺陷,在更准确测量超谐波方面展现出良好前景。展开更多
A space-based bistatic radar system composed of two space-based radars as the transmitter and the receiver respectively has a wider surveillance region and a better early warning capability for high-speed targets,and ...A space-based bistatic radar system composed of two space-based radars as the transmitter and the receiver respectively has a wider surveillance region and a better early warning capability for high-speed targets,and it can detect focused space targets more flexibly than the monostatic radar system or the ground-based radar system.However,the target echo signal is more difficult to process due to the high-speed motion of both space-based radars and space targets.To be specific,it will encounter the problems of Range Cell Migration(RCM)and Doppler Frequency Migration(DFM),which degrade the long-time coherent integration performance for target detection and localization inevitably.To solve this problem,a novel target detection method based on an improved Gram Schmidt(GS)-orthogonalization Orthogonal Matching Pursuit(OMP)algorithm is proposed in this paper.First,the echo model for bistatic space-based radar is constructed and the conditions for RCM and DFM are analyzed.Then,the proposed GS-orthogonalization OMP method is applied to estimate the equivalent motion parameters of space targets.Thereafter,the RCM and DFM are corrected by the compensation function correlated with the estimated motion parameters.Finally,coherent integration can be achieved by performing the Fast Fourier Transform(FFT)operation along the slow time direction on compensated echo signal.Numerical simulations and real raw data results validate that the proposed GS-orthogonalization OMP algorithm achieves better motion parameter estimation performance and higher detection probability for space targets detection.展开更多
This paper analyzes the performance of the orthogonal matching pursuit （OMP） algorithm in recovering sparse signals from noisy measurement. Considering the fact that some matrices satisfy some restricted isometry pr...This paper analyzes the performance of the orthogonal matching pursuit （OMP） algorithm in recovering sparse signals from noisy measurement. Considering the fact that some matrices satisfy some restricted isometry properties （RIPs） but not the coherence condition, a superior RIP-based condition is proposed, which means that if the measurement matrix satisfies δk＋1 〈 1/（2 ＋ √k） and the minimum component signal-to-noise ratio （MCSNR） is bounded, the OMP algorithm can exactly identify the support of the original sparse signal within k iterations. Finally, the theoretical results are verified by numerical simulations con- cerning different values of MCSNR and noise levels.展开更多
As the amount of data produced by ground penetrating radar （GPR） for roots is large, the transmission and the storage of data consumes great resources. To alleviate this problem, we propose here a root imaging algor...As the amount of data produced by ground penetrating radar （GPR） for roots is large, the transmission and the storage of data consumes great resources. To alleviate this problem, we propose here a root imaging algorithm using chaotic particle swarm optimal （CPSO） compressed sensing based on GPR data according to the sparsity of root space. Radar data are decomposed, observed, measured and represented in sparse manner, so roots image can be reconstructed with limited data. Firstly, radar signal measurement and sparse representation are implemented, and the solution space is established by wavelet basis and Gauss random matrix; secondly, the matching function is considered as the fitness function, and the best fitness value is found by a PSO algorithm; then, a chaotic search was used to obtain the global optimal operator; finally, the root image is reconstructed by the optimal operators. A-scan data, B-scan data, and complex data from American GSSI GPR is used, respectively, in the experimental test. For B-scan data, the computation time was reduced 60 % and PSNR was improved 5.539 dB; for actual root data imaging, the reconstruction PSNR was 26.300 dB, and total computation time was only 67.210 s. The CPSO-OMP algorithm overcomes the problem of local optimum trapping and comprehensively enhances the precision during reconstruction.展开更多
基金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.
文摘提出一种压缩感知正交匹配追踪（CS-OMP）超谐波测量新算法,即运用压缩感知理论,通过引入插值系数,基于离散傅里叶变换（DFT）系数向量和狄利克雷核矩阵,构建了高频率分辨率的压缩感知模型,并基于正交匹配追踪算法,在不增加被测数据观测时间前提下,将超谐波测量的频率分辨率提高了一个数量级。数值仿真分析以及两种非线性负荷的实测数据验证的结果表明,该算法可将测得数据频率分辨率由2 k Hz细化为200 Hz,能实现对被测信号中超谐波频率成分的精确定位,也可准确求解出其幅值信息,从而有效地弥补了DFT算法存在的观测时间与频率分辨率互相限制的固有缺陷,在更准确测量超谐波方面展现出良好前景。
文摘A space-based bistatic radar system composed of two space-based radars as the transmitter and the receiver respectively has a wider surveillance region and a better early warning capability for high-speed targets,and it can detect focused space targets more flexibly than the monostatic radar system or the ground-based radar system.However,the target echo signal is more difficult to process due to the high-speed motion of both space-based radars and space targets.To be specific,it will encounter the problems of Range Cell Migration(RCM)and Doppler Frequency Migration(DFM),which degrade the long-time coherent integration performance for target detection and localization inevitably.To solve this problem,a novel target detection method based on an improved Gram Schmidt(GS)-orthogonalization Orthogonal Matching Pursuit(OMP)algorithm is proposed in this paper.First,the echo model for bistatic space-based radar is constructed and the conditions for RCM and DFM are analyzed.Then,the proposed GS-orthogonalization OMP method is applied to estimate the equivalent motion parameters of space targets.Thereafter,the RCM and DFM are corrected by the compensation function correlated with the estimated motion parameters.Finally,coherent integration can be achieved by performing the Fast Fourier Transform(FFT)operation along the slow time direction on compensated echo signal.Numerical simulations and real raw data results validate that the proposed GS-orthogonalization OMP algorithm achieves better motion parameter estimation performance and higher detection probability for space targets detection.
基金supported by the National Natural Science Foundation of China(6117401661171197)
文摘This paper analyzes the performance of the orthogonal matching pursuit （OMP） algorithm in recovering sparse signals from noisy measurement. Considering the fact that some matrices satisfy some restricted isometry properties （RIPs） but not the coherence condition, a superior RIP-based condition is proposed, which means that if the measurement matrix satisfies δk＋1 〈 1/（2 ＋ √k） and the minimum component signal-to-noise ratio （MCSNR） is bounded, the OMP algorithm can exactly identify the support of the original sparse signal within k iterations. Finally, the theoretical results are verified by numerical simulations con- cerning different values of MCSNR and noise levels.
基金supported by the Fundamental Research Funds for the Central Universities(DL13BB21)the Natural Science Foundation of Heilongjiang Province(C2015054)+1 种基金Heilongjiang Province Technology Foundation for Selected Osverseas ChineseNatural Science Foundation of Heilongjiang Province(F2015036)
文摘As the amount of data produced by ground penetrating radar （GPR） for roots is large, the transmission and the storage of data consumes great resources. To alleviate this problem, we propose here a root imaging algorithm using chaotic particle swarm optimal （CPSO） compressed sensing based on GPR data according to the sparsity of root space. Radar data are decomposed, observed, measured and represented in sparse manner, so roots image can be reconstructed with limited data. Firstly, radar signal measurement and sparse representation are implemented, and the solution space is established by wavelet basis and Gauss random matrix; secondly, the matching function is considered as the fitness function, and the best fitness value is found by a PSO algorithm; then, a chaotic search was used to obtain the global optimal operator; finally, the root image is reconstructed by the optimal operators. A-scan data, B-scan data, and complex data from American GSSI GPR is used, respectively, in the experimental test. For B-scan data, the computation time was reduced 60 % and PSNR was improved 5.539 dB; for actual root data imaging, the reconstruction PSNR was 26.300 dB, and total computation time was only 67.210 s. The CPSO-OMP algorithm overcomes the problem of local optimum trapping and comprehensively enhances the precision during reconstruction.
