Sciweavers

ICASSP
2011
IEEE
12 years 8 months ago
A hybrid compressed sensing algorithm for sparse channel estimation in MIMO OFDM systems
Due to multipath delay spread and relatively high sampling rate in OFDM systems, the channel estimation is formulated as a sparse recovery problem, where a hybrid compressed sensi...
Chenhao Qi, Lenan Wu
ICASSP
2011
IEEE
12 years 8 months ago
Look ahead orthogonal matching pursuit
For compressive sensing, we endeavor to improve the recovery performance of the existing orthogonal matching pursuit (OMP) algorithm. To achieve a better estimate of the underlyin...
Saikat Chatterjee, Dennis Sundman, Mikael Skoglund
TSP
2010
12 years 11 months ago
Block-sparse signals: uncertainty relations and efficient recovery
We consider efficient methods for the recovery of block-sparse signals--i.e., sparse signals that have nonzero entries occurring in clusters--from an underdetermined system of line...
Yonina C. Eldar, Patrick Kuppinger, Helmut Bö...
TIT
2008
121views more  TIT 2008»
13 years 4 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
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
169views Education» more  CORR 2010»
13 years 5 months ago
Near-Oracle Performance of Greedy Block-Sparse Estimation Techniques from Noisy Measurements
This paper examines the ability of greedy algorithms to estimate a block sparse parameter vector from noisy measurements. In particular, block sparse versions of the orthogonal mat...
Zvika Ben-Haim, Yonina C. Eldar
ICASSP
2010
IEEE
13 years 5 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...
ICASSP
2009
IEEE
13 years 11 months ago
Separation of a subspace-sparse signal: Algorithms and conditions
In this paper, we show how two classical sparse recovery algorithms, Orthogonal Matching Pursuit and Basis Pursuit, can be naturally extended to recover block-sparse solutions for...
Arvind Ganesh, Zihan Zhou, Yi Ma
ICASSP
2009
IEEE
13 years 11 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...