Sciweavers

16 search results - page 1 / 4
» Sparse Recovery with Orthogonal Matching Pursuit under RIP
Sort
View
CORR
2010
Springer
181views Education» more  CORR 2010»
13 years 3 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
TIT
2010
171views Education» more  TIT 2010»
12 years 10 months ago
Analysis of orthogonal matching pursuit using the restricted isometry property
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...
Mark A. Davenport, Michael B. Wakin
FOCM
2008
156views more  FOCM 2008»
13 years 3 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
TIT
2008
121views more  TIT 2008»
13 years 3 months ago
Stability Results for Random Sampling of Sparse Trigonometric Polynomials
Recently, it has been observed that a sparse trigonometric polynomial, i.e. having only a small number of non-zero coefficients, can be reconstructed exactly from a small number o...
Holger Rauhut
ICASSP
2010
IEEE
13 years 3 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...