Based on Compressed Sensing of Orthogonal Matching Pursuit Algorithm Image Recovery

Compressive sensing theory mainly includes the sparsely of signal processing,the structure of the measurement matrix and reconstruction algorithm.Reconstruction algorithm is the core content of CS theory,that is,through the low dimensional sparse signal recovers the original signal accurately.This thesis based on the theory of CS to study further on seismic data reconstruction algorithm.We select orthogonal matching pursuit algorithm as a base reconstruction algorithm.Then do the specific research for the implementation principle,the structure of the algorithm of AOMP and make the signal simulation at the same time.In view of the OMP algorithm reconstruction speed is slow and the problems need to be a given number of iterations,which developed an improved scheme.We combine the optimized OMP algorithm of constraint the optimal matching of item selection strategy,the backwards gradient projection ideas of adaptive variance step gradient projection method and the original algorithm to improve it.Simulation experiments show that improved OMP algorithm is superior to traditional OMP algorithm of improvement in the reconstruction time and effect under the same condition.This paper introduces CS and most mature compressive sensing algorithm at present orthogonal matching pursuit algorithm.Through the program design realize basic orthogonal matching pursuit algorithms,and design realize basic orthogonal matching pursuit algorithm of one-dimensional,two-dimensional signal processing simulation.

Acoustic sound speed profile inversion based on orthogonal matching pursuit

The estimation of ocean sound speed profiles(SSPs)requires the inversion of an acoustic field using limited observations.Such inverse problems are underdetermined,and require regularization to ensure physically realistic solutions.The empirical orthonormal function(EOF)is capable of a very large compression of the data set.In this paper,the non-linear response of the sound pressure to SSP is linearized using a first order Taylor expansion,and the pressure is expanded in a sparse domain using EOFs.Since the parameters of the inverse model are sparse,compressive sensing(CS)can help solve such underdetermined problems accurately,efficiently,and with enhanced resolution.Here,the orthogonal matching pursuit(OMP)is used to estimate range-independent acoustic SSPs using the simulated acoustic field.The superior resolution of OMP is demonstrated with the SSP data from the South China Sea experiment.By shortening the duration of the training set,the temporal correlation between EOF and test sets is enhanced,and the accuracy of sound velocity inversion is improved.The SSP estimation error versus depth is calculated,and the 99%confidence interval of error is within±0.6 m/s.The 82%of mean absolute error(MAE)is less than 1 m/s.It is shown that SSPs can be well estimated using OMP.

Coherence-based performance analysis of the generalized orthogonal matching pursuit algorithm

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.

Coherence Based Sufficient Condition for Support Recovery Using Generalized Orthogonal Matching Pursuit

In an underdetermined system,compressive sensing can be used to recover the support vector.Greedy algorithms will recover the support vector indices in an iterative manner.Generalized Orthogonal Matching Pursuit(GOMP)is the generalized form of the Orthogonal Matching Pursuit(OMP)algorithm where a number of indices selected per iteration will be greater than or equal to 1.To recover the support vector of unknown signal‘x’from the compressed measurements,the restricted isometric property should be satisfied as a sufficient condition.Finding the restricted isometric constant is a non-deterministic polynomial-time hardness problem due to that the coherence of the sensing matrix can be used to derive the sufficient condition for support recovery.In this paper a sufficient condition based on the coherence parameter to recover the support vector indices of an unknown sparse signal‘x’using GOMP has been derived.The derived sufficient condition will recover support vectors of P-sparse signal within‘P’iterations.The recovery guarantee for GOMP is less restrictive,and applies to OMP when the number of selection elements equals one.Simulation shows the superior performance of the GOMP algorithm compared with other greedy algorithms.

基于改进OMP算法的多目标高速机动检测方法

针对多目标高速机动检测问题,提出了一种基于改进正交匹配追踪(OMP)算法的多目标检测方法。根据高速机动目标运动特性建立信号模型;利用改进OMP算法对脉冲压缩后的回波信号进行运动参数估计;构建相位补偿函数对距离徙动和多普勒徙动进行校正;通过快速傅里叶变换(FFT)完成相参积累,实现对多目标的检测。改进算法适用于多目标高速机动检测场景,可有效避免盲速旁瓣现象及信号交叉项的影响,且具有参数估计精度高和抗噪声能力强等优点。仿真实验验证了改进算法的有效性与可靠性。

自适应STWF与改进OMP的滚动轴承微弱故障诊断方法

针对工业环境中随机冲击干扰下滚动轴承微弱故障特征提取难题,提出一种基于自适应短时维纳滤波(Adaptive Short Time Wiener Filtering,ASTWF)和改进正交匹配追踪(Orthogonal Matching Pursuit,OMP)的滚动轴承故障特征提取方法。该方法首先采用包络峭度和随余比(Random Shocks and Margin Ratio,RMR)作为联合判据,界定窗长界限并自适应确定STWF最优窗长参数,进而将随机冲击干扰从测试信号中分离出来;然后,利用立方包络自相关谱估计信号中周期频率,构造周期原子库,降低匹配原子冗余度;最后,利用相似性理论优化匹配追踪迭代终止条件,并结合周期原子库,实现弱故障冲击特征快速、准确提取。根据仿真信号和通过变速箱下线检测所得工程数据,可验证所提出方法可有效识别随机冲击干扰下的滚动轴承微弱故障特征。对比最小熵形态反卷积(Minimum Entropy Morphological Deconvolution,MEMD)方法对于随机冲击干扰下滚动轴承微弱故障特征提取效果,发现所提出方法具有更好的故障特征提取能力;与经典OMP方法相比,所提出改进OMP方法信号重构速度提升66%。

THE EXACT RECOVERY OF SPARSE SIGNALS VIA ORTHOGONAL MATCHING PURSUIT

This paper aims to investigate sufficient conditions for the recovery of sparse signals via the orthogonal matching pursuit （OMP） algorithm. In the noiseless case, we present a novel sufficient condition for the exact recovery of all k-sparse signals by the OMP algorithm, and demonstrate that this condition is sharp. In the noisy case, a sufficient condition for recovering the support of k-sparse signal is also presented. Generally, the computation for the restricted isometry constant （RIC） in these sufficient conditions is typically difficult, therefore we provide a new condition which is not only computable but also sufficient for the exact recovery of all k-sparse signals.

基于DFT-SWOMP的OFDM系统信道估计方法

基于压缩感知的OFDM信道估计方案中,分段弱正交匹配追踪(SWOMP)算法具有不需要预知信道稀疏度的优点,但其信道估计精度受输入的门限参数和迭代次数的影响较大。针对这一问题,提出一种基于DFT-LS算法的门限自适应的SWOMP算法改进方案。考虑到在OFDM系统中,保护间隔长度外的信道时域响应都可以视为噪声,因此该方案的核心思想是利用DFT-LS算法预估出噪声水平,并用此预估值来动态设置SWOMP算法的门限参数。同时,该方案还使用DFT-LS算法预估出的信道频域响应作为SWOMP算法的迭代停止条件。仿真结果表明,这种SWOMP算法的改进方案可以有效地估计出信道参数,并且相比SWOMP算法,其估计结果的MSE值在不同信噪比下都有不同程度的提升。

Robustness of orthogonal matching pursuit under restricted isometry property

Orthogonal matching pursuit （OMP） algorithm is an efficient method for the recovery of a sparse signal in compressed sensing, due to its ease implementation and low complexity. In this paper, the robustness of the OMP algorithm under the restricted isometry property （RIP） is presented. It is shown that 5K＋V/KOK,1 〈 1 is sufficient for the OMP algorithm to recover exactly the support of arbitrary /（-sparse signal if its nonzero components are large enough for both 12 bounded and lz~ bounded noises.

Analysis of orthogonal multi-matching pursuit under restricted isometry property

Orthogonal multi-matching pursuit（OMMP）is a natural extension of orthogonal matching pursuit（OMP）in the sense that N（N≥1）indices are selected per iteration instead of 1.In this paper,the theoretical performance of OMMP under the restricted isometry property（RIP）is presented.We demonstrate that OMMP can exactly recover any K-sparse signal from fewer observations y=φx,provided that the sampling matrixφsatisfiesδKN-N＋1＋√K/NθKN-N＋1,N〈1.Moreover,the performance of OMMP for support recovery from noisy observations is also discussed.It is shown that,for l_2 bounded and l_∞bounded noisy cases,OMMP can recover the true support of any K-sparse signal under conditions on the restricted isometry property of the sampling matrixφand the minimum magnitude of the nonzero components of the signal.

A new result on recovery sparse signals using orthogonal matching pursuit

Orthogonal matching pursuit(OMP)algorithm is a classical greedy algorithm widely used in compressed sensing.In this paper,by exploiting the Wielandt inequality and some properties of orthogonal projection matrix,we obtained a new number of iterations required for the OMP algorithm to perform exact recovery of sparse signals,which improves significantly upon the latest results as we know.

基于压缩感知OMP的超谐波测量新算法

提出一种压缩感知正交匹配追踪（CS-OMP）超谐波测量新算法,即运用压缩感知理论,通过引入插值系数,基于离散傅里叶变换（DFT）系数向量和狄利克雷核矩阵,构建了高频率分辨率的压缩感知模型,并基于正交匹配追踪算法,在不增加被测数据观测时间前提下,将超谐波测量的频率分辨率提高了一个数量级。数值仿真分析以及两种非线性负荷的实测数据验证的结果表明,该算法可将测得数据频率分辨率由2 k Hz细化为200 Hz,能实现对被测信号中超谐波频率成分的精确定位,也可准确求解出其幅值信息,从而有效地弥补了DFT算法存在的观测时间与频率分辨率互相限制的固有缺陷,在更准确测量超谐波方面展现出良好前景。

基于复图像OMP分解的宽带雷达微动特征提取方法

针对宽带雷达中目标微动散射点发生越距离单元走动和方位欠采样条件下的微动特征提取问题,该文提出了一种基于复图像正交匹配追踪(OMP)分解的微动特征提取新方法。该方法利用目标"距离-慢时间像"的幅度和相位信息,构造复图像空间的微多普勒信号原子集,将向量空间的OMP算法拓展到复图像空间,实现了距离-慢时间平面上目标微动特征的提取。仿真实验表明该方法能够有效提取微动散射点发生越距离单元走动条件下的微动特征,并且可以实现方位欠采样时的微动特征提取。

The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials

Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classical research methods using mutual coherence or restricted isometry property of the measurement matrix,the recovery guarantee and the success probability of OMP are obtained directly by the greedy selection ratio and the probability theory.The results show that the failure probability of OMP given in this paper is exponential small with respect to the number of sampling points.In addition,the recovery guarantee of OMP obtained through classical methods is lager than that of ℓ_(1)-minimization whatever the sparsity of sparse polynomials is,while the recovery guarantee given in this paper is roughly the same as that of ℓ_(1)-minimization when the sparsity is less than 93.Finally,the numerical experiments verify the availability of the theoretical results.

贝叶斯模型下的OMP重构算法及应用

针对稀疏度先验信息缺失的条件下,正交匹配追踪(orthogonal matching pursuit,OMP)算法设置冗余稀疏度时,造成信号过重构、抗噪性能变差等问题,基于贝叶斯检验模型,提出了贝叶斯正交匹配追踪(Bayesian orthogonal matching pursuit,BOMP)算法。并推导了该算法估计信号的克拉美罗下界,最后将算法应用于逆合成孔径雷达(inverse synthetic aperture radar,ISAR)成像。理论分析和实验结果表明,由于该算法能够更加真实地估计信号支撑集,因而具有更好的重构精度、抗噪性能,同时降低了计算复杂度。

基于OMP算法五维数据规则化技术

数据规则化技术是地震资料处理中的重要技术,它对改善地震数据的面元属性、提高地震资料的信噪比和成像质量有很大的优势。基于OMP算法五维数据规则化技术能综合利用三维地震数据的"纵向、横向、时间、偏移距、方位角"五个维度的信息,利用基于正交匹配追踪算法(OMP)实现数据规则化。与常规数据规则化方法相比,该方法规则化和插值更精确,解决了连片偏移处理中块与块之间覆盖次数不均造成的能量不均和偏移画弧问题。该技术在塔北隆起LG地震工区得到成功应用,新资料清楚地刻画出了奥陶系碳酸盐岩的潜山面,并能够更加准确地识别出奥陶系内幕孔洞型"串珠"储层特征。

基于GOMP及其改进的OFDM系统稀疏信道估计

研究在正交频分复用(OFDM)系统的稀疏信道估计问题.由于在许多通信系统中信道具有稀疏性,因此可以把信道估计问题转化为稀疏信号的恢复问题,应用压缩感知理论求解,把现有的恢复算法——广义正交匹配追踪算法(GOMP)运用到信道估计中,并对它加以改进.仿真结果表明,与广义正交匹配追踪算法(GOMP)相比,正交匹配追踪算法(OMP)运行时间少,计算复杂度低,但是估计的最小均方误差略差.为了进一步提高该算法的性能,提出了改进的广义正交匹配追踪算法,性能得到了较大的提高.

Root imaging from ground penetrating radar data by CPSO-OMP compressed sensing

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.

改进OMP算法在人脸识别中的应用

分析稀疏表示的人脸识别方法的基本原理,针对采用基于正交匹配追踪(OMP)的稀疏表示算法时,所获得稀疏系数存在负值的问题,提出一种改进的正交匹配追踪算法。通过对稀疏系数的大小进行直接约束,减少负值稀疏系数的产生及算法迭代次数,并提高人脸识别速度。在ORL人脸数据库中的实验结果证明,改进后算法的识别率比原有算法提高了3%,迭代次数设置为7次最为合理。

基于压缩感知OMP改进算法的图像重构

正交匹配追踪(OMP)算法中迭代次数严格依赖信号的稀疏度K值,迭代次数选取适当会重构出高精确的图像,反之则会对图像重构质量造成严重影响。针对这一问题,提出了一种根据残差值的相对极差来确定最佳迭代次数的新方法。该方法要求在同一次迭代中对一幅图像的所有列同时进行迭代计算,根据极差的相对差值与门限值比较来确定最佳迭代次数,从而达到提高重构精度,消除对稀疏度K值依赖的目的。理论分析和仿真结果表明,改进的OMP算法比原有算法有更理想的重构效果,有更高的重构精度。