Sciweavers

441 search results - page 9 / 89
» Sparse Recovery Using Sparse Random Matrices
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
Learning with dynamic group sparsity
This paper investigates a new learning formulation called dynamic group sparsity. It is a natural extension of the standard sparsity concept in compressive sensing, and is motivat...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
CSR
2008
Springer
13 years 9 months ago
Additive Preconditioning for Matrix Computations
Versus the customary preconditioners, our weakly random ones are generated more readily and for a much larger class of input matrices. Furthermore our preconditioners have a wider...
Victor Y. Pan, Dmitriy Ivolgin, Brian Murphy, Rhys...
CVPR
2011
IEEE
13 years 2 months ago
Accelerated Low-Rank Visual Recovery by Random Projection
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
Yadong Mu, Jian Dong, Xiaotong Yuan, Shuicheng Yan
TIT
2010
137views Education» more  TIT 2010»
13 years 2 months ago
Stable recovery of sparse signals and an oracle inequality
This article considers sparse signal recovery in the presence of noise. A mutual incoherence condition which was previously used for exact recovery in the noiseless case is shown t...
T. Tony Cai, Lie Wang, Guangwu Xu
CORR
2011
Springer
214views Education» more  CORR 2011»
12 years 11 months ago
K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specifically, we design a distribution over m × n matrices A such that for any x, given A...
Piotr Indyk, Eric Price