Sciweavers

1582 search results - page 57 / 317
» On sparse signal representations
Sort
View
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
15 years 9 months ago
Lower Bounds for Sparse Recovery
We consider the following k-sparse recovery problem: design an m ? n matrix A, such that for any signal x, given Ax we can efficiently recover ^x satisfying
khanh do ba, piotr indyk, eric price
ICASSP
2010
IEEE
15 years 2 days ago
Sound enhancement using sparse approximation with speclets
This paper addresses an innovative approach to informed enhancement of damaged sound. It uses sparse approximations with a learned dictionary of atoms modeling the main components...
Manuel Moussallam, Pierre Leveau, Si-Mohamed Aziz ...
CISS
2008
IEEE
15 years 6 months ago
The Dantzig selector and generalized thresholding
Abstract—The Dantzig selector is a recently introduced technique for near-optimal estimatation of sparse signals from a limited set of measurements. This paper offers an interpre...
Justin K. Romberg
FOCM
2010
140views more  FOCM 2010»
14 years 10 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen
CORR
2002
Springer
180views Education» more  CORR 2002»
14 years 11 months ago
Non-negative sparse coding
Abstract. Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this...
Patrik O. Hoyer