Sciweavers

441 search results - page 4 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
ICASSP
2010
IEEE
13 years 7 months ago
Gradient Polytope Faces Pursuit for large scale sparse recovery problems
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...
Aris Gretsistas, Ivan Damnjanovic, Mark D. Plumble...
FGR
2011
IEEE
288views Biometrics» more  FGR 2011»
12 years 11 months ago
Facial action unit recognition with sparse representation
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...
Mohammad H. Mahoor, Mu Zhou, Kevin L. Veon, Seyed ...
ICASSP
2010
IEEE
13 years 7 months ago
Kronecker product matrices for compressive sensing
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...
Marco F. Duarte, Richard G. Baraniuk
PARA
2004
Springer
14 years 22 days ago
Optimization of a Statically Partitioned Hypermatrix Sparse Cholesky Factorization
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...
José R. Herrero, Juan J. Navarro
APPROX
2008
Springer
102views Algorithms» more  APPROX 2008»
13 years 9 months ago
Dense Fast Random Projections and Lean Walsh Transforms
Random projection methods give distributions over k
Edo Liberty, Nir Ailon, Amit Singer