Sciweavers

1582 search results - page 118 / 317
» On sparse signal representations
Sort
View
CORR
2011
Springer
203views Education» more  CORR 2011»
15 years 1 months ago
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
The Compressive Sensing (CS) framework aims to ease the burden on analog-to-digital converters (ADCs) by reducing the sampling rate required to acquire and stably recover sparse s...
Laurent Jacques, Jason N. Laska, Petros Boufounos,...
ESA
2008
Springer
102views Algorithms» more  ESA 2008»
15 years 8 months ago
Succinct Representations of Arbitrary Graphs
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
Arash Farzan, J. Ian Munro
ICASSP
2009
IEEE
16 years 27 days ago
Compressive spectral estimation for nonstationary random processes
We propose a “compressive” estimator of the Wigner-Ville spectrum (WVS) for time-frequency sparse, underspread, nonstationary random processes. A novel WVS estimator involving...
Alexander Jung, Georg Tauböck, Franz Hlawatsc...
ISCAS
2007
IEEE
126views Hardware» more  ISCAS 2007»
16 years 13 days ago
Theory and Implementation of an Analog-to-Information Converter using Random Demodulation
— The new theory of compressive sensing enables direct analog-to-information conversion of compressible signals at subNyquist acquisition rates. We develop new theory, algorithms...
Jason N. Laska, Sami Kirolos, Marco F. Duarte, Tam...
149
Voted
ICASSP
2008
IEEE
16 years 18 days ago
An audio watermarking method based on molecular matching pursuit
In this paper we introduce a new watermarking model combining a joint time frequency (TF) representation using the molecular matching pursuit (MMP) algorithm and a psychoacoustic ...
Mathieu Parvaix, Sridhar Krishnan, Cornel Ioana