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)...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.展开更多
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,throu...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.展开更多
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 realis...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.展开更多
针对工业环境中随机冲击干扰下滚动轴承微弱故障特征提取难题,提出一种基于自适应短时维纳滤波(Adaptive Short Time Wiener Filtering,ASTWF)和改进正交匹配追踪(Orthogonal Matching Pursuit,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 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 s...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.展开更多
为实现汽车前围板隔声薄弱部位的准确识别,文章提出了基于快速傅里叶变换(Fast Fourier Transform,FFT)和正交匹配追踪(Orthogonal Matching Pursuit,OMP)的反卷积(Deconvolution Approach for the Mapping of Acoustic Sources,DAMAS)...为实现汽车前围板隔声薄弱部位的准确识别,文章提出了基于快速傅里叶变换(Fast Fourier Transform,FFT)和正交匹配追踪(Orthogonal Matching Pursuit,OMP)的反卷积(Deconvolution Approach for the Mapping of Acoustic Sources,DAMAS)波束形成方法(FFT-OMP-DAMAS)。该方法基于声源稀疏分布假设,利用正交匹配追踪思想求解反卷积问题,并进一步结合傅里叶变换和点扩散函数空间转移不变假设降低计算维度。在混响室-消声室内,分别利用延迟求和方法,DAMAS方法和FFT-OMP-DAMAS方法进行了某汽车前围板隔声薄弱部位识别试验,结果表明:FFTOMP-DAMAS方法能够有效抑制旁瓣和伪源,有效缩减主瓣宽度,从而准确识别汽车前围板隔声薄弱部位,且相较于传统的DAMAS方法,文中提出的FFT-OMP-DAMAS方法能获得更清晰的成像结果,计算效率有了明显提高。展开更多
The conventional two dimensional(2D)inverse synthetic aperture radar(ISAR)imaging fails to provide the targets'three dimensional(3D)information.In this paper,a 3D ISAR imaging method for the space target is propos...The conventional two dimensional(2D)inverse synthetic aperture radar(ISAR)imaging fails to provide the targets'three dimensional(3D)information.In this paper,a 3D ISAR imaging method for the space target is proposed based on mutliorbit observation data and an improved orthogonal matching pursuit(OMP)algorithm.Firstly,the 3D scattered field data is converted into a set of 2D matrix by stacking slices of the 3D data along the elevation direction dimension.Then,an improved OMP algorithm is applied to recover the space target's amplitude information via the 2D matrix data.Finally,scattering centers can be reconstructed with specific three dimensional locations.Numerical simulations are provided to demonstrate the effectiveness and superiority of the proposed 3D imaging method.展开更多
At present,the traditional channel estimation algorithms have the disadvantages of over-reliance on initial conditions and high complexity.The bacterial foraging optimization(BFO)-based algorithm has been applied in w...At present,the traditional channel estimation algorithms have the disadvantages of over-reliance on initial conditions and high complexity.The bacterial foraging optimization(BFO)-based algorithm has been applied in wireless communication and signal processing because of its simple operation and strong self-organization ability.But the BFO-based algorithm is easy to fall into local optimum.Therefore,this paper proposes the quantum bacterial foraging optimization(QBFO)-binary orthogonal matching pursuit(BOMP)channel estimation algorithm to the problem of local optimization.Firstly,the binary matrix is constructed according to whether atoms are selected or not.And the support set of the sparse signal is recovered according to the BOMP-based algorithm.Then,the QBFO-based algorithm is used to obtain the estimated channel matrix.The optimization function of the least squares method is taken as the fitness function.Based on the communication between the quantum bacteria and the fitness function value,chemotaxis,reproduction and dispersion operations are carried out to update the bacteria position.Simulation results showthat compared with other algorithms,the estimationmechanism based onQBFOBOMP algorithm can effectively improve the channel estimation performance of millimeter wave(mmWave)massive multiple input multiple output(MIMO)systems.Meanwhile,the analysis of the time ratio shows that the quantization of the bacteria does not significantly increase the complexity.展开更多
提出一种压缩感知正交匹配追踪（CS-OMP）超谐波测量新算法,即运用压缩感知理论,通过引入插值系数,基于离散傅里叶变换（DFT）系数向量和狄利克雷核矩阵,构建了高频率分辨率的压缩感知模型,并基于正交匹配追踪算法,在不增加被测数据观...提出一种压缩感知正交匹配追踪（CS-OMP）超谐波测量新算法,即运用压缩感知理论,通过引入插值系数,基于离散傅里叶变换（DFT）系数向量和狄利克雷核矩阵,构建了高频率分辨率的压缩感知模型,并基于正交匹配追踪算法,在不增加被测数据观测时间前提下,将超谐波测量的频率分辨率提高了一个数量级。数值仿真分析以及两种非线性负荷的实测数据验证的结果表明,该算法可将测得数据频率分辨率由2 k Hz细化为200 Hz,能实现对被测信号中超谐波频率成分的精确定位,也可准确求解出其幅值信息,从而有效地弥补了DFT算法存在的观测时间与频率分辨率互相限制的固有缺陷,在更准确测量超谐波方面展现出良好前景。展开更多
文摘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.
基金This study was supported by the Yangtze University Innovation and Entrepreneurship Course Construction Project of“Mobile Internet Entrepreneurship”.
文摘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.
基金The National Natural Science Foundation of China under contract No.11704225the Shandong Provincial Natural Science Foundation under contract No.ZR2016AQ23+3 种基金the State Key Laboratory of Acoustics,Chinese Academy of Sciences under contract No.SKLA201902the National Key Research and Development Program of China contract No.2018YFC1405900the SDUST Research Fund under contract No.2019TDJH103the Talent Introduction Plan for Youth Innovation Team in Universities of Shandong Province(Innovation Team of Satellite Positioning and Navigation)
文摘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.
文摘针对工业环境中随机冲击干扰下滚动轴承微弱故障特征提取难题,提出一种基于自适应短时维纳滤波(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%。
基金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.
文摘为实现汽车前围板隔声薄弱部位的准确识别,文章提出了基于快速傅里叶变换(Fast Fourier Transform,FFT)和正交匹配追踪(Orthogonal Matching Pursuit,OMP)的反卷积(Deconvolution Approach for the Mapping of Acoustic Sources,DAMAS)波束形成方法(FFT-OMP-DAMAS)。该方法基于声源稀疏分布假设,利用正交匹配追踪思想求解反卷积问题,并进一步结合傅里叶变换和点扩散函数空间转移不变假设降低计算维度。在混响室-消声室内,分别利用延迟求和方法,DAMAS方法和FFT-OMP-DAMAS方法进行了某汽车前围板隔声薄弱部位识别试验,结果表明:FFTOMP-DAMAS方法能够有效抑制旁瓣和伪源,有效缩减主瓣宽度,从而准确识别汽车前围板隔声薄弱部位,且相较于传统的DAMAS方法,文中提出的FFT-OMP-DAMAS方法能获得更清晰的成像结果,计算效率有了明显提高。
文摘The conventional two dimensional(2D)inverse synthetic aperture radar(ISAR)imaging fails to provide the targets'three dimensional(3D)information.In this paper,a 3D ISAR imaging method for the space target is proposed based on mutliorbit observation data and an improved orthogonal matching pursuit(OMP)algorithm.Firstly,the 3D scattered field data is converted into a set of 2D matrix by stacking slices of the 3D data along the elevation direction dimension.Then,an improved OMP algorithm is applied to recover the space target's amplitude information via the 2D matrix data.Finally,scattering centers can be reconstructed with specific three dimensional locations.Numerical simulations are provided to demonstrate the effectiveness and superiority of the proposed 3D imaging method.
基金supported by the National Natural Science Foundation of China(Nos.61861015,62061013 and 61961013)Key Research and Development Program of Hainan Province(No.ZDYF2019011)+3 种基金National Key Research and Development Program of China(No.2019CXTD400)Young Elite Scientists Sponsorship Program by CAST(No.2018QNRC001)Scientific Research Setup Fund of Hainan University(No.KYQD(ZR)1731)the Natural Science Foundation High-Level Talent Project of Hainan Province(No.622RC619).
文摘At present,the traditional channel estimation algorithms have the disadvantages of over-reliance on initial conditions and high complexity.The bacterial foraging optimization(BFO)-based algorithm has been applied in wireless communication and signal processing because of its simple operation and strong self-organization ability.But the BFO-based algorithm is easy to fall into local optimum.Therefore,this paper proposes the quantum bacterial foraging optimization(QBFO)-binary orthogonal matching pursuit(BOMP)channel estimation algorithm to the problem of local optimization.Firstly,the binary matrix is constructed according to whether atoms are selected or not.And the support set of the sparse signal is recovered according to the BOMP-based algorithm.Then,the QBFO-based algorithm is used to obtain the estimated channel matrix.The optimization function of the least squares method is taken as the fitness function.Based on the communication between the quantum bacteria and the fitness function value,chemotaxis,reproduction and dispersion operations are carried out to update the bacteria position.Simulation results showthat compared with other algorithms,the estimationmechanism based onQBFOBOMP algorithm can effectively improve the channel estimation performance of millimeter wave(mmWave)massive multiple input multiple output(MIMO)systems.Meanwhile,the analysis of the time ratio shows that the quantization of the bacteria does not significantly increase the complexity.
文摘提出一种压缩感知正交匹配追踪（CS-OMP）超谐波测量新算法,即运用压缩感知理论,通过引入插值系数,基于离散傅里叶变换（DFT）系数向量和狄利克雷核矩阵,构建了高频率分辨率的压缩感知模型,并基于正交匹配追踪算法,在不增加被测数据观测时间前提下,将超谐波测量的频率分辨率提高了一个数量级。数值仿真分析以及两种非线性负荷的实测数据验证的结果表明,该算法可将测得数据频率分辨率由2 k Hz细化为200 Hz,能实现对被测信号中超谐波频率成分的精确定位,也可准确求解出其幅值信息,从而有效地弥补了DFT算法存在的观测时间与频率分辨率互相限制的固有缺陷,在更准确测量超谐波方面展现出良好前景。
