Sciweavers

53 search results - page 2 / 11
» Noise Folding in Compressed Sensing
Sort
View
INTERSPEECH
2010
13 years 3 days ago
Artificial and online acquired noise dictionaries for noise robust ASR
Recent research has shown that speech can be sparsely represented using a dictionary of speech segments spanning multiple frames, exemplars, and that such a sparse representation ...
Jort F. Gemmeke, Tuomas Virtanen
ICIP
2008
IEEE
14 years 7 months ago
Nonconvex compressive sensing and reconstruction of gradient-sparse images: Random vs. tomographic Fourier sampling
Previous compressive sensing papers have considered the example of recovering an image with sparse gradient from a surprisingly small number of samples of its Fourier transform. T...
Rick Chartrand
ICASSP
2011
IEEE
12 years 9 months ago
Lorentzian based iterative hard thresholding for compressed sensing
In this paper we propose a robust iterative hard thresolding (IHT) algorithm for reconstructing sparse signals in the presence of impulsive noise. To address this problem, we use ...
Rafael E. Carrillo, Kenneth E. Barner
ICASSP
2008
IEEE
13 years 11 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. ...
ICASSP
2008
IEEE
13 years 11 months ago
Approximate lower bounds for rate-distortion in compressive sensing systems
We attempt to quantify the possible gains that can be achieved by examining a rate-distortion competition between a conventional and a compressive sampling solution to data rate r...
Bernard Mulgrew, Michael E. Davies