Noise sensitivity of sparse signal representations: reconstruction error bounds for the inverse problem

Authors:
B. Wohlberg
Affiliations:
Los Alamos Nat. Lab., NM, USA
Venue:
IEEE Transactions on Signal Processing
Year:
2003

Citing 0
Cited 6

A simple test to check the optimality of a sparse signal approximation

Signal Processing - Sparse approximations in signal and image processing
Improved FOCUSS method with conjugate gradient iterations

IEEE Transactions on Signal Processing
A plurality of sparse representations is better than the sparsest one alone

IEEE Transactions on Information Theory
Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations

Signal Processing
On the stable recovery of the sparsest overcomplete representations in presence of noise

IEEE Transactions on Signal Processing
Non-negative sparse decomposition based on constrained smoothed ℓ0 norm

Signal Processing

Quantified Score

Hi-index	35.75

Visualization

Abstract

Certain sparse signal reconstruction problems have been shown to have unique solutions when the signal is known to have an exact sparse representation. This result is extended to provide bounds on the reconstruction error when the signal has been corrupted by noise or is not exactly sparse for some other reason. Uniqueness is found to be extremely unstable for a number of common dictionaries.