Sciweavers

93 search results - page 13 / 19
» Reconstructing sparse signals from their zero crossings
Sort
View
SSWMC
2004
13 years 8 months ago
Hiding correlation-based watermark templates using secret modulation
A possible solution to the difficult problem of geometrical distortion of watermarked images in a blind watermarking scenario is to use a template grid in the autocorrelation func...
Jeroen Lichtenauer, Iwan Setyawan, Reginald L. Lag...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 6 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...
ICASSP
2009
IEEE
14 years 1 months ago
Field inversion by consensus and compressed sensing
— We study the inversion of a random field from pointwise measurements collected by a sensor network. We assume that the field has a sparse representation in a known basis. To ...
Aurora Schmidt, José M. F. Moura
ICASSP
2011
IEEE
12 years 10 months ago
Non-negative matrix deconvolution in noise robust speech recognition
High noise robustness has been achieved in speech recognition by using sparse exemplar-based methods with spectrogram windows spanning up to 300 ms. A downside is that a large exe...
Antti Hurmalainen, Jort F. Gemmeke, Tuomas Virtane...
TIT
2010
137views Education» more  TIT 2010»
13 years 1 months ago
Average case analysis of multichannel sparse recovery using convex relaxation
This paper considers recovery of jointly sparse multichannel signals from incomplete measurements. Several approaches have been developed to recover the unknown sparse vectors from...
Yonina C. Eldar, Holger Rauhut