Sciweavers

7 search results - page 1 / 2
» Near-Optimal Sparse Recovery in the L1 Norm
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
FGR
2011
IEEE
288views Biometrics» more  FGR 2011»
12 years 8 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
2008
IEEE
13 years 11 months ago
Application of sparse signal recovery to pilot-assisted channel estimation
We examine the application of current research in sparse signal recovery to the problem of channel estimation. Specifically, using an Orthogonal Frequency Division Multiplexed (O...
Matthew Sharp, Anna Scaglione
SIAMJO
2011
12 years 11 months ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
CVPR
2008
IEEE
14 years 6 months ago
Sequential sparsification for change detection
This paper presents a general method for segmenting a vector valued sequence into an unknown number of subsequences where all data points from a subsequence can be represented wit...
Necmiye Ozay, Mario Sznaier, Octavia I. Camps