Sciweavers

84 search results - page 10 / 17
» Gradient-Based Methods for Sparse Recovery
Sort
View
TSP
2010
13 years 2 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ö...
ICA
2007
Springer
14 years 1 months ago
Sparse Component Analysis in Presence of Noise Using an Iterative EM-MAP Algorithm
Abstract. In this paper, a new algorithm for source recovery in underdetermined Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented i...
Hadi Zayyani, Massoud Babaie-Zadeh, G. Hosein Mohi...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 7 months ago
Sequential Compressed Sensing
Compressed sensing allows perfect recovery of sparse signals (or signals sparse in some basis) using only a small number of random measurements. Existing results in compressed sens...
Dmitry M. Malioutov, Sujay Sanghavi, Alan S. Wills...
CORR
2010
Springer
128views Education» more  CORR 2010»
13 years 7 months ago
Blind Compressed Sensing
The fundamental principle underlying compressed sensing is that a signal, which is sparse under some basis representation, can be recovered from a small number of linear measuremen...
Sivan Gleichman, Yonina C. Eldar
CORR
2008
Springer
186views Education» more  CORR 2008»
13 years 7 months ago
Greedy Signal Recovery Review
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed Regularized Orthogonal Matching Pursuit (ROMP) that ha...
Deanna Needell, Joel A. Tropp, Roman Vershynin