Sciweavers

587 search results - page 10 / 118
» Theory of matching pursuit
Sort
View
CORR
2010
Springer
169views Education» more  CORR 2010»
13 years 7 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
2008
IEEE
14 years 1 months ago
Compressed sensing - a look beyond linear programming
Recently, significant attention in compressed sensing has been focused on Basis Pursuit, exchanging the cardinality operator with the l1-norm, which leads to a linear formulation...
Christian R. Berger, Javier Areta, Krishna R. Patt...
ICASSP
2011
IEEE
12 years 11 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
ICIP
2005
IEEE
14 years 9 months ago
The M-term pursuit for image representation and progressive compression
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable ...
Adel Rahmoune, Pierre Vandergheynst, Pascal Frossa...
ICIP
2009
IEEE
13 years 5 months ago
Structured pursuits for geometric super-resolution
Super-resolution image zooming is possible when the image has some geometric regularity. We introduce a general class of non-linear inverse estimators, which combines linear estima...
Stéphane Mallat, Guoshen Yu