Improved bounds on restricted isometry constant for orthogonal multi matching pursuit

2015 ◽  
Vol 15 (4) ◽  
pp. 737-744 ◽  
Author(s):  
Xiujie Wei ◽  
Peixin Ye
Keyword(s):  
Matching Pursuit ◽  
Restricted Isometry Constant

scholarly journals A Sharp Bound on RIC in Generalized Orthogonal Matching Pursuit

2018 ◽  
Vol 61 (1) ◽  
pp. 40-54 ◽  
Author(s):  
Wengu Chen ◽  
Huanmin Ge
Keyword(s):  
Matching Pursuit ◽  
Natural Extension ◽  
Orthogonal Matching Pursuit ◽  
Sparse Signal ◽  
Sparse Signals ◽  
Sensing Matrix ◽  
Extra Condition ◽  
Exact Reconstruction ◽  
Restricted Isometry Constant ◽  
Generalized Orthogonal

AbstractThe generalized orthogonal matching pursuit (gOMP) algorithm has received much attention in recent years as a natural extension of the orthogonal matching pursuit (OMP). It is used to recover sparse signals in compressive sensing. In this paper, a new bound is obtained for the exact reconstruction of every K-sparse signal via the gOMP algorithm in the noiseless case. That is, if the restricted isometry constant (RIC) δNK+1 of the sensing matrix A satisfiesthen the gOMP can perfectly recover every K-sparse signal x from y = Ax. Furthermore, the bound is proved to be sharp. In the noisy case, the above bound on RIC combining with an extra condition on the minimum magnitude of the nonzero components of K-sparse signals can guarantee that the gOMP selects all of the support indices of the K-sparse signals.

scholarly journals Improved bounds on restricted isometry constant for orthogonal matching pursuit

2013 ◽  
Vol 49 (23) ◽  
pp. 1487-1489 ◽  
Author(s):  
Jinming Wen ◽  
Xiaomei Zhu ◽  
Dongfang Li
Keyword(s):  
Matching Pursuit ◽  
Orthogonal Matching Pursuit ◽  
Restricted Isometry Constant

Kernel Matching Pursuit Based on Immune Clonal Fast Algorithm for Image Object Recognition

2011 ◽  
Vol 30 (5) ◽  
pp. 1104-1108 ◽  
Author(s):  
Shui-ping Gou ◽  
Li-cheng Jiao ◽  
Xiang-rong Zhang ◽  
Yang-yang Li
Keyword(s):  
Object Recognition ◽  
Fast Algorithm ◽  
Matching Pursuit ◽  
Image Object

Compressed Sensing Image Reconstruction Based on Improved Particle Swarm Optimization Algorithm

2014 ◽  
Vol 599-601 ◽  
pp. 1453-1456
Author(s):  
Ju Wang ◽  
Yin Liu ◽  
Wei Juan Zhang ◽  
Kun Li
Keyword(s):  
Particle Swarm Optimization ◽  
Image Reconstruction ◽  
Compressed Sensing ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Matching Pursuit ◽  
Particle Swarm ◽  
Premature Convergence ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization

The reconstruction algorithm has a hot research in compressed sensing. Matching pursuit algorithm has a huge computational task, when particle swarm optimization has been put forth to find the best atom, but it due to the easy convergence to local minima, so the paper proposed a algorithm ,which based on improved particle swarm optimization. The algorithm referred above combines K-mean and particle swarm optimization algorithm. The algorithm not only effectively prevents the premature convergence, but also improves the K-mean’s local. These findings indicated that the algorithm overcomes premature convergence of particle swarm optimization, and improves the quality of image reconstruction.

Separating Multiple Moving Sources by Microphone Array Signals for Wayside Acoustic Fault Diagnosis

2019 ◽  
Vol 141 (5) ◽  
Author(s):  
Wei Xiong ◽  
Qingbo He ◽  
Zhike Peng
Keyword(s):  
Fault Diagnosis ◽  
Time Domain ◽  
Feature Matching ◽  
Matching Pursuit ◽  
Microphone Array ◽  
Time Frequency ◽  
Moving Sources ◽  
The Time Domain ◽  
Envelope Spectrum ◽  
Threshold Setting

Wayside acoustic defective bearing detector (ADBD) system is a potential technique in ensuring the safety of traveling vehicles. However, Doppler distortion and multiple moving sources aliasing in the acquired acoustic signals decrease the accuracy of defective bearing fault diagnosis. Currently, the method of constructing time-frequency (TF) masks for source separation was limited by an empirical threshold setting. To overcome this limitation, this study proposed a dynamic Doppler multisource separation model and constructed a time domain-separating matrix (TDSM) to realize multiple moving sources separation in the time domain. The TDSM was designed with two steps of (1) constructing separating curves and time domain remapping matrix (TDRM) and (2) remapping each element of separating curves to its corresponding time according to the TDRM. Both TDSM and TDRM were driven by geometrical and motion parameters, which would be estimated by Doppler feature matching pursuit (DFMP) algorithm. After gaining the source components from the observed signals, correlation operation was carried out to estimate source signals. Moreover, fault diagnosis could be carried out by envelope spectrum analysis. Compared with the method of constructing TF masks, the proposed strategy could avoid setting thresholds empirically. Finally, the effectiveness of the proposed technique was validated by simulation and experimental cases. Results indicated the potential of this method for improving the performance of the ADBD system.

Sign in / Sign up

Export Citation Format

Share Document