22 search results - page 2 / 5 » Bounded gradient projection methods for sparse signal recove... |
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
TSP
2010
12 years 11 months ago
2010
Abstract--In this paper, we present a concise and coherent analysis of the constrained `1 minimization method for stable recovering of high-dimensional sparse signals both in the n...
CORR
2012
Springer
12 years 15 days ago
2012
Springer
Suppose that we observe noisy linear measurements of an unknown signal that can be modeled as the sum of two component signals, each of which arises from a nonlinear sub-manifold ...
CVPR
2012
IEEE
11 years 7 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
2008
Springer
13 years 4 months ago
2008
Springer
The two major approaches to sparse recovery are L1-minimization and greedy methods. Recently, Needell and Vershynin developed Regularized Orthogonal Matching Pursuit (ROMP) that ha...