Sciweavers

26 search results - page 3 / 6
» Universal Measurement Bounds for Structured Sparse Signal Re...
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ö...
ICASSP
2010
IEEE
13 years 8 months ago
Texas Hold 'Em algorithms for distributed compressive sensing
This paper develops a new class of algorithms for signal recovery in the distributed compressive sensing (DCS) framework. DCS exploits both intra-signal and inter-signal correlati...
Stephen R. Schnelle, Jason N. Laska, Chinmay Hegde...
ICASSP
2011
IEEE
12 years 11 months ago
Additive character sequences with small alphabets for compressed sensing matrices
Compressed sensing is a novel technique where one can recover sparse signals from the undersampled measurements. In this paper, a K × N measurement matrix for compressed sensing ...
Nam Yul Yu
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 3 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 8 months ago
Performance Bounds and Design Criteria for Estimating Finite Rate of Innovation Signals
In this paper, we consider the problem of estimating finite rate of innovation (FRI) signals from noisy measurements, and specifically analyze the interaction between FRI technique...
Zvika Ben-Haim, Tomer Michaeli, Yonina C. Eldar