Matching pursuits algorithm (MP), as an adaptive signal representation upon overcomplete fundamental waveforms, is a powerful tool in many applications. However, MP suffers from distinguishing a doublet structure. In ...Matching pursuits algorithm (MP), as an adaptive signal representation upon overcomplete fundamental waveforms, is a powerful tool in many applications. However, MP suffers from distinguishing a doublet structure. In this paper, the authors proposed an algorithm called compete matching pursuits (CMP), which can overcome this shortcoming and performance very well.展开更多
To improve the reconstruction performance of the greedy algorithm for sparse signals, an improved greedy algorithm, called sparsity estimation variable step-size matching pursuit, is proposed. Compared with state-of-t...To improve the reconstruction performance of the greedy algorithm for sparse signals, an improved greedy algorithm, called sparsity estimation variable step-size matching pursuit, is proposed. Compared with state-of-the-art greedy algorithms, the proposed algorithm incorporates the restricted isometry property and variable step-size, which is utilized for sparsity estimation and reduces the reconstruction time, respectively. Based on the sparsity estimation, the initial value including sparsity level and support set is computed at the beginning of the reconstruction, which provides preliminary sparsity information for signal reconstruction. Then, the residual and correlation are calculated according to the initial value and the support set is refined at the next iteration associated with variable step-size and backtracking. Finally, the correct support set is obtained when the halting condition is reached and the original signal is reconstructed accurately. The simulation results demonstrate that the proposed algorithm improves the recovery performance and considerably outperforms the existing algorithm in terms of the running time in sparse signal reconstruction.展开更多
To suppress noise amplitude modulation jamming in a single-antenna radar system, a new method based on weighted-matching pursuit （WMP） algorithm is proposed, which can achieve underdetermined blind sources separatio...To suppress noise amplitude modulation jamming in a single-antenna radar system, a new method based on weighted-matching pursuit （WMP） algorithm is proposed, which can achieve underdetermined blind sources separation of the jamming and the target echo from the jammed mixture in the single channel of the receiver. Firstly, the presented method utilizes a prior information about the differences between the jamming component and the radar transmitted signal to construct two signal-adapted sub-dictionaries and to determine the weights. Then the WMP algorithm is applied to remove the jamming component from the mixture. Experimental results verify the validity of the presented method. By comparison of the pulse compression performance, the simulation results shows that the presented method is superior to the method of frequency domain cancellation （FDC） when the jamming-to-signal ratio （JSR） is lower than 15 dB.展开更多
In the time-frequency analysis of seismic signals, the matching pursuit algorithm is an effective tool for non-stationary signals, and has high time-frequency resolution and a transient structure with local self-adapt...In the time-frequency analysis of seismic signals, the matching pursuit algorithm is an effective tool for non-stationary signals, and has high time-frequency resolution and a transient structure with local self-adaption. We expand the time-frequency dictionary library with Ricker, Morlet, and mixed phase seismic wavelets, to make the method more suitable for seismic signal time-frequency decomposition. In this paper, we demonstrated the algorithm theory using synthetic seismic data, and tested the method using synthetic data with 25% noise. We compared the matching pursuit results of the time-frequency dictionaries. The results indicated that the dictionary which matched the signal characteristics better would obtain better results, and can reflect the information of seismic data effectively.展开更多
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.展开更多
针对工业环境中随机冲击干扰下滚动轴承微弱故障特征提取难题,提出一种基于自适应短时维纳滤波(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 conventional linear time-frequency analysis method cannot achieve high resolution and energy focusing in the time and frequency dimensions at the same time,especially in the low frequency region.In order to improv...The conventional linear time-frequency analysis method cannot achieve high resolution and energy focusing in the time and frequency dimensions at the same time,especially in the low frequency region.In order to improve the resolution of the linear time-frequency analysis method in the low-frequency region,we have proposed a W transform method,in which the instantaneous frequency is introduced as a parameter into the linear transformation,and the analysis time window is constructed which matches the instantaneous frequency of the seismic data.In this paper,the W transform method is compared with the Wigner-Ville distribution(WVD),a typical nonlinear time-frequency analysis method.The WVD method that shows the energy distribution in the time-frequency domain clearly indicates the gravitational center of time and the gravitational center of frequency of a wavelet,while the time-frequency spectrum of the W transform also has a clear gravitational center of energy focusing,because the instantaneous frequency corresponding to any time position is introduced as the transformation parameter.Therefore,the W transform can be benchmarked directly by the WVD method.We summarize the development of the W transform and three improved methods in recent years,and elaborate on the evolution of the standard W transform,the chirp-modulated W transform,the fractional-order W transform,and the linear canonical W transform.Through three application examples of W transform in fluvial sand body identification and reservoir prediction,it is verified that W transform can improve the resolution and energy focusing of time-frequency spectra.展开更多
A multichannel matching pursuit（MMP）algorithm is proposed to decompose the one-dimensional multichannel non-stationary magnetoencephalography（MEG）signal at a single-trial level.The single-channel matching pursuit...A multichannel matching pursuit（MMP）algorithm is proposed to decompose the one-dimensional multichannel non-stationary magnetoencephalography（MEG）signal at a single-trial level.The single-channel matching pursuit（MP）linearly decomposes the signal into a set of Gabor atoms,which are adaptively chosen from an overcomplete dictionary with good time-frequency characters.The MMP is the extension of the MP,which represents multichannel signals using linear combination of Gabor atoms with the same occurrence,frequency,phase,and time width,but varying amplitude in all channels.The results demonstrate that the MMP can optimally reconstruct the original signal and automatically remove artifact noises.Moreover,the coherence between the 3D source reconstruction and the prior knowledge of psychology further suggests that the MMP is effective in MEG single-trial processing.展开更多
文摘Matching pursuits algorithm (MP), as an adaptive signal representation upon overcomplete fundamental waveforms, is a powerful tool in many applications. However, MP suffers from distinguishing a doublet structure. In this paper, the authors proposed an algorithm called compete matching pursuits (CMP), which can overcome this shortcoming and performance very well.
基金The National Basic Research Program of China(973Program)(No.2013CB329003)
文摘To improve the reconstruction performance of the greedy algorithm for sparse signals, an improved greedy algorithm, called sparsity estimation variable step-size matching pursuit, is proposed. Compared with state-of-the-art greedy algorithms, the proposed algorithm incorporates the restricted isometry property and variable step-size, which is utilized for sparsity estimation and reduces the reconstruction time, respectively. Based on the sparsity estimation, the initial value including sparsity level and support set is computed at the beginning of the reconstruction, which provides preliminary sparsity information for signal reconstruction. Then, the residual and correlation are calculated according to the initial value and the support set is refined at the next iteration associated with variable step-size and backtracking. Finally, the correct support set is obtained when the halting condition is reached and the original signal is reconstructed accurately. The simulation results demonstrate that the proposed algorithm improves the recovery performance and considerably outperforms the existing algorithm in terms of the running time in sparse signal reconstruction.
文摘To suppress noise amplitude modulation jamming in a single-antenna radar system, a new method based on weighted-matching pursuit （WMP） algorithm is proposed, which can achieve underdetermined blind sources separation of the jamming and the target echo from the jammed mixture in the single channel of the receiver. Firstly, the presented method utilizes a prior information about the differences between the jamming component and the radar transmitted signal to construct two signal-adapted sub-dictionaries and to determine the weights. Then the WMP algorithm is applied to remove the jamming component from the mixture. Experimental results verify the validity of the presented method. By comparison of the pulse compression performance, the simulation results shows that the presented method is superior to the method of frequency domain cancellation （FDC） when the jamming-to-signal ratio （JSR） is lower than 15 dB.
文摘In the time-frequency analysis of seismic signals, the matching pursuit algorithm is an effective tool for non-stationary signals, and has high time-frequency resolution and a transient structure with local self-adaption. We expand the time-frequency dictionary library with Ricker, Morlet, and mixed phase seismic wavelets, to make the method more suitable for seismic signal time-frequency decomposition. In this paper, we demonstrated the algorithm theory using synthetic seismic data, and tested the method using synthetic data with 25% noise. We compared the matching pursuit results of the time-frequency dictionaries. The results indicated that the dictionary which matched the signal characteristics better would obtain better results, and can reflect the information of seismic data effectively.
文摘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.
文摘针对工业环境中随机冲击干扰下滚动轴承微弱故障特征提取难题,提出一种基于自适应短时维纳滤波(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 Science Foundation of China(42055402)。
文摘The conventional linear time-frequency analysis method cannot achieve high resolution and energy focusing in the time and frequency dimensions at the same time,especially in the low frequency region.In order to improve the resolution of the linear time-frequency analysis method in the low-frequency region,we have proposed a W transform method,in which the instantaneous frequency is introduced as a parameter into the linear transformation,and the analysis time window is constructed which matches the instantaneous frequency of the seismic data.In this paper,the W transform method is compared with the Wigner-Ville distribution(WVD),a typical nonlinear time-frequency analysis method.The WVD method that shows the energy distribution in the time-frequency domain clearly indicates the gravitational center of time and the gravitational center of frequency of a wavelet,while the time-frequency spectrum of the W transform also has a clear gravitational center of energy focusing,because the instantaneous frequency corresponding to any time position is introduced as the transformation parameter.Therefore,the W transform can be benchmarked directly by the WVD method.We summarize the development of the W transform and three improved methods in recent years,and elaborate on the evolution of the standard W transform,the chirp-modulated W transform,the fractional-order W transform,and the linear canonical W transform.Through three application examples of W transform in fluvial sand body identification and reservoir prediction,it is verified that W transform can improve the resolution and energy focusing of time-frequency spectra.
基金The National Natural Science Foundation of China(No.30900356,81071135)the National High Technology Research and Development Program of China(863Program)(No.2008AA02Z410)
文摘A multichannel matching pursuit（MMP）algorithm is proposed to decompose the one-dimensional multichannel non-stationary magnetoencephalography（MEG）signal at a single-trial level.The single-channel matching pursuit（MP）linearly decomposes the signal into a set of Gabor atoms,which are adaptively chosen from an overcomplete dictionary with good time-frequency characters.The MMP is the extension of the MP,which represents multichannel signals using linear combination of Gabor atoms with the same occurrence,frequency,phase,and time width,but varying amplitude in all channels.The results demonstrate that the MMP can optimally reconstruct the original signal and automatically remove artifact noises.Moreover,the coherence between the 3D source reconstruction and the prior knowledge of psychology further suggests that the MMP is effective in MEG single-trial processing.
