Joint Sparse with Generalized Orthogonal Matching Pursuit for Off-Grid Wideband DOA Estimation

Author(s):  
Xingchen Liu ◽  
Haiyan Wang ◽  
Xiaohong Shen ◽  
Haitao Dong ◽  
Haixian Jing
2020 ◽  
pp. 2150017
Author(s):  
Bittu Kumar

In this paper, the performance of compressive sensing (CS)-based technique for speech enhancement has been studied and results analyzed with recovery algorithms as a comparison of their performances. This is done for several recovery algorithms such as matching pursuit, orthogonal matching pursuit, stage-wise orthogonal matching pursuit, compressive sampling matching pursuit and generalized orthogonal matching pursuit. Performances of all these greedy algorithms were compared for speech enhancement. The evaluation of results has been carried out using objective measures (perceptual evaluation of speech quality, log-likelihood ratio, weighted spectral slope distance and segmental signal-to-noise ratio), simulation time and composite objective measures (signal distortion C[Formula: see text], background intrusiveness C[Formula: see text] and overall quality C[Formula: see text]. Results showed that the CS-based technique using generalized orthogonal matching pursuit algorithm yields better performance than the other recovery algorithms in terms of speech quality and distortion.


2018 ◽  
Vol 61 (1) ◽  
pp. 40-54 ◽  
Author(s):  
Wengu Chen ◽  
Huanmin Ge

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.


2017 ◽  
Vol 21 (4) ◽  
pp. 805-808 ◽  
Author(s):  
Jinming Wen ◽  
Zhengchun Zhou ◽  
Dongfang Li ◽  
Xiaohu Tang

2012 ◽  
Vol 60 (12) ◽  
pp. 6202-6216 ◽  
Author(s):  
Jian Wang ◽  
Seokbeop Kwon ◽  
Byonghyo Shim

Sign in / Sign up

Export Citation Format

Share Document