Sciweavers

89 search results - page 14 / 18
» Sparse Recovery by Non-convex Optimization -- Instance Optim...
Sort
View
CORR
2011
Springer
186views Education» more  CORR 2011»
12 years 11 months ago
Blind Compressed Sensing Over a Structured Union of Subspaces
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
Jorge Silva, Minhua Chen, Yonina C. Eldar, Guiller...
ICML
2010
IEEE
13 years 8 months ago
Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity
We consider the problem of learning a sparse multi-task regression, where the structure in the outputs can be represented as a tree with leaf nodes as outputs and internal nodes a...
Seyoung Kim, Eric P. Xing
CORR
2010
Springer
207views Education» more  CORR 2010»
13 years 4 months ago
TILT: Transform Invariant Low-rank Textures
Abstract. In this paper, we show how to efficiently and effectively extract a rich class of low-rank textures in a 3D scene from 2D images despite significant distortion and warpin...
Zhengdong Zhang, Arvind Ganesh, Xiao Liang, Yi Ma
ECCV
2008
Springer
14 years 9 months ago
Compressive Sensing for Background Subtraction
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...
Volkan Cevher, Aswin C. Sankaranarayanan, Marco F....
CIMAGING
2009
120views Hardware» more  CIMAGING 2009»
13 years 8 months ago
Dantzig selector homotopy with dynamic measurements
The Dantzig selector is a near ideal estimator for recovery of sparse signals from linear measurements in the presence of noise. It is a convex optimization problem which can be r...
Muhammad Salman Asif, Justin K. Romberg