441 search results - page 4 / 89 » Sparse Recovery Using Sparse Random Matrices |
ICASSP
2010
IEEE
14 years 10 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...
117
click to vote
FGR
2011
IEEE
14 years 1 months ago
2011
IEEE
This paper presents a novel framework for recognition of facial action unit (AU) combinations by viewing the classification as a sparse representation problem. Based on this framew...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
Compressive sensing (CS) is an emerging approach for acquisition of signals having a sparse or compressible representation in some basis. While CS literature has mostly focused on...
PARA
2004
Springer
15 years 3 months ago
2004
Springer
The sparse Cholesky factorization of some large matrices can require a two dimensional partitioning of the matrix. The sparse hypermatrix storage scheme produces a recursive 2D par...
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Random projection methods give distributions over k