89 search results - page 4 / 18 » Sparse Recovery by Non-convex Optimization -- Instance Optim... |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
The 2- 1 sparse signal minimization problem can be solved efficiently by gradient projection. In many applications, the signal to be estimated is known to lie in some range of va...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the information-theoretic limits of exactly recovering the support set of a sparse signal, using noisy projections defined by various classes of measurement matrices. Our ...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
In this paper, we propose a bilevel sparse coding model for coupled feature spaces, where we aim to learn dictionaries for sparse modeling in both spaces while enforcing some desi...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
SIAMSC
2008
13 years 7 months ago
2008
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...