441 search results - page 34 / 89 » Sparse Recovery Using Sparse Random Matrices |
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We present a convex formulation of dictionary learning for sparse signal decomposition. Convexity is obtained by replacing the usual explicit upper bound on the dictionary size by...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
SIAMMAX
2010
14 years 4 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
SIAMSC
2010
14 years 4 months ago
2010
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...