Sciweavers

168 search results - page 13 / 34
» Bayesian Compressive Sensing for clustered sparse signals
Sort
View
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 5 months ago
Compressive Sensing over Graphs
In this paper, motivated by network inference and tomography applications, we study the problem of compressive sensing for sparse signal vectors over graphs. In particular, we are ...
Weiyu Xu, Enrique Mallada, Ao Tang
TSP
2010
13 years 2 months ago
Distributed sampling of signals linked by sparse filtering: theory and applications
We study the distributed sampling and centralized reconstruction of two correlated signals, modeled as the input and output of an unknown sparse filtering operation. This is akin ...
Ali Hormati, Olivier Roy, Yue M. Lu, Martin Vetter...
TIT
2010
112views Education» more  TIT 2010»
13 years 2 months ago
Exponential bounds implying construction of compressed sensing matrices, error-correcting codes, and neighborly polytopes by ran
In [12] the authors proved an asymptotic sampling theorem for sparse signals, showing that n random measurements permit to reconstruct an N-vector having k nonzeros provided n >...
David L. Donoho, Jared Tanner
ICASSP
2008
IEEE
14 years 2 months ago
Finding needles in noisy haystacks
The theory of compressed sensing shows that samples in the form of random projections are optimal for recovering sparse signals in high-dimensional spaces (i.e., finding needles ...
Rui M. Castro, Jarvis Haupt, Robert Nowak, Gil M. ...
ICIP
2010
IEEE
13 years 5 months ago
Gradient projection for linearly constrained convex optimization in sparse signal recovery
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...
Zachary T. Harmany, Daniel Thompson, Rebecca Wille...