Sciweavers

27 search results - page 1 / 6
» Tree-Based Orthogonal Matching Pursuit Algorithm for Signal ...
Sort
View
ICIP
2006
IEEE
14 years 6 months ago
Tree-Based Orthogonal Matching Pursuit Algorithm for Signal Reconstruction
Recent studies in linear inverse problems have recognized the sparse representation of unknown signal in a certain basis as an useful and effective prior information to solve thos...
Chinh La, Minh N. Do
ICASSP
2009
IEEE
13 years 12 months ago
A low complexity Orthogonal Matching Pursuit for sparse signal approximation with shift-invariant dictionaries
We propose a variant of Orthogonal Matching Pursuit (OMP), called LoCOMP, for scalable sparse signal approximation. The algorithm is designed for shift-invariant signal dictionari...
Boris Mailhé, Rémi Gribonval, Fr&eac...
FOCM
2008
156views more  FOCM 2008»
13 years 5 months ago
Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
We investigate the problem of reconstructing sparse multivariate trigonometric polynomials from few randomly taken samples by Basis Pursuit and greedy algorithms such as Orthogona...
Stefan Kunis, Holger Rauhut
CORR
2010
Springer
181views Education» more  CORR 2010»
13 years 5 months ago
Sparse Recovery with Orthogonal Matching Pursuit under RIP
This paper presents a new analysis for the orthogonal matching pursuit (OMP) algorithm. It is shown that if the restricted isometry property (RIP) is satisfied at sparsity level O...
Tong Zhang
CORR
2007
Springer
183views Education» more  CORR 2007»
13 years 5 months ago
Compressed Sensing and Redundant Dictionaries
This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, whic...
Holger Rauhut, Karin Schnass, Pierre Vandergheynst