Unified Theory for Recovery of Sparse Signals in a General Transform Domain
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
This paper analyzes the performance of the simple thresholding algorithm for sparse signal representations. In particular, in order to be more realistic we introduce a new probabilistic signal model which assumes randomness for both the amplitude and also ...
It is well known that the support of a sparse signal can be recovered from a small number of random projections. However, in the presence of noise all known sufficient conditions require that the per-sample signal-to-noise ratio (SNR) grows without bound w ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008
We consider the task of recovering correlated vectors at a central decoder based on fixed linear measurements obtained by distributed sensors. A general formulation of the problem is proposed, under both a universal and an almost sure reconstruction requir ...
This paper addresses the problem of correct recovery of multiple sparse correlated signals using distributed thresholding. We consider the scenario where multiple sensors capture the same event, but observe different signals that are correlated by local tr ...
We introduce the scale axis transform, a new skeletal shape representation for bounded open sets O ⊂ &Rdbl;d. The scale axis transform induces a family of skeletons that captures the important features of a shape in a scale-adaptive way and ...
Consider a scenario where a distributed signal is sparse and is acquired by various sensors that see different versions. Thus, we have a set of sparse signals with both some common parts, and some variations. The question is how to acquire such signals and ...
With the use of a Bessel-like illumination beam produced by an axicon lens an extended depth of field can be achieved. The resulting illumination pattern exhibits a strong central lobe extending over 300um along the optical axis without diffraction. Here w ...
We provide a method for constructing regular sampling lattices in arbitrary dimensions together with an integer dilation matrix. Subsampling using this dilation matrix leads to a similarity-transformed version of the lattice with a chosen density reduction ...
Compressive Sensing (CS) combines sampling and compression into a single sub-Nyquist linear measurement process for sparse and compressible signals. In this paper, we extend the theory of CS to include signals that are concisely represented in terms of a g ...
This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via ell1 minimisation, or more precisely the problem of identifying a dictionary dico from a set of training samples Y knowing that $ ...
