Denoising by sparse approximation: error bounds based on rate-distortion theory
Reads0
Chats0
TLDR
A new bound that depends on a new bound on approximating a Gaussian signal as a linear combination of elements of an overcomplete dictionary is given and asymptotic expressions reveal a critical input signal-to-noise ratio for signal recovery.Abstract:
If a signal x is known to have a sparse representation with respect to a frame, it can be estimated from a noise-corrupted observation y by finding the best sparse approximation to y. Removing noise in this manner depends on the frame efficiently representing the signal while it inefficiently represents the noise. The mean-squared error (MSE) of this denoising scheme and the probability that the estimate has the same sparsity pattern as the original signal are analyzed. First an MSE bound that depends on a new bound on approximating a Gaussian signal as a linear combination of elements of an overcomplete dictionary is given. Further analyses are for dictionaries generated randomly according to a spherically-symmetric distribution and signals expressible with single dictionary elements. Easily-computed approximations for the probability of selecting the correct dictionary element and the MSE are given. Asymptotic expressions reveal a critical input signal-to-noise ratio for signal recovery.read more
Citations
More filters
Journal ArticleDOI
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
TL;DR: The aim of this paper is to introduce a few key notions and applications connected to sparsity, targeting newcomers interested in either the mathematical aspects of this area or its applications.
Journal ArticleDOI
Probability and Random Processes
TL;DR: This handbook is a very useful handbook for engineers, especially those working in signal processing, and provides real data bootstrap applications to illustrate the theory covered in the earlier chapters.
Journal ArticleDOI
Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting
TL;DR: For a noisy linear observation model based on random measurement matrices drawn from general Gaussian measurementMatrices, this paper derives both a set of sufficient conditions for exact support recovery using an exhaustive search decoder, as well as aset of necessary conditions that any decoder must satisfy for exactSupport set recovery.
Journal ArticleDOI
Life Beyond Bases: The Advent of Frames (Part II)
Jelena Kovacevic,Amina Chebira +1 more
TL;DR: This part covers a large number of known frame families (harmonic tight frames, equiangular frames, unit-norm tight frame, Gabor frames, cosine-modulated frames, double-density frames, multidimensional frames, filter bank frame) as well as those applications where frames made a difference.
References
More filters
Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Book
Ten lectures on wavelets
TL;DR: This paper presents a meta-analyses of the wavelet transforms of Coxeter’s inequality and its applications to multiresolutional analysis and orthonormal bases.
Journal ArticleDOI
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
TL;DR: In this paper, the authors considered the model problem of reconstructing an object from incomplete frequency samples and showed that with probability at least 1-O(N/sup -M/), f can be reconstructed exactly as the solution to the lscr/sub 1/ minimization problem.
Journal ArticleDOI
Ten Lectures on Wavelets
TL;DR: In this article, the regularity of compactly supported wavelets and symmetry of wavelet bases are discussed. But the authors focus on the orthonormal bases of wavelets, rather than the continuous wavelet transform.