On sparse representation in pairs of bases

Authors:
A. Feuer;A. Nemirovski
Affiliations:
Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 15

Morphological Diversity and Sparsity for Multichannel Data Restoration

Journal of Mathematical Imaging and Vision
On the reconstruction of block-sparse signals with an optimal number of measurements

IEEE Transactions on Signal Processing
Sharp thresholds for high-dimensional and noisy sparsity recovery using l1-constrained quadratic programming (Lasso)

IEEE Transactions on Information Theory
l2/l1-optimization and its strong thresholds in approximately block-sparse compressed sensing

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Explicit thresholds for approximately sparse compressed sensing via l1-optimization

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Uncertainty relations for shift-invariant analog signals

IEEE Transactions on Information Theory
Direction finding of multiple emitters by spatial sparsity and linear programming

ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
LP decoding meets LP decoding: a connection between channel coding and compressed sensing

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Bounds on the number of identifiable outliers in source localization by linear programming

IEEE Transactions on Signal Processing
Robust regression and Lasso

IEEE Transactions on Information Theory
Restricted Eigenvalue Properties for Correlated Gaussian Designs

The Journal of Machine Learning Research
Sparse representations and approximation theory

Journal of Approximation Theory
Analysis and Generalizations of the Linearized Bregman Method

SIAM Journal on Imaging Sciences
Image representation in visual cortex and high nonlinear approximation

ISNN'05 Proceedings of the Second international conference on Advances in Neural Networks - Volume Part I
Error bounds for convex parameter estimation

Signal Processing

Quantified Score

Hi-index	755.02

Visualization

Abstract

In previous work, Elad and Bruckstein (EB) have provided a sufficient condition for replacing an l0 optimization by linear programming minimization when searching for the unique sparse representation. We establish here that the EB condition is both sufficient and necessary.