Sciweavers

18 search results - page 3 / 4
» Gradient projection for linearly constrained convex optimiza...
Sort
View
CORR
2011
Springer
167views Education» more  CORR 2011»
13 years 10 days ago
Fast global convergence of gradient methods for high-dimensional statistical recovery
Many statistical M-estimators are based on convex optimization problems formed by the weighted sum of a loss function with a norm-based regularizer. We analyze the convergence rat...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
ICASSP
2011
IEEE
12 years 9 months ago
Sparse decomposition of transformation-invariant signals with continuous basis pursuit
Consider the decomposition of a signal into features that undergo transformations drawn from a continuous family. Current methods discretely sample the transformations and apply s...
Chaitanya Ekanadham, Daniel Tranchina, Eero P. Sim...
CVPR
2012
IEEE
11 years 7 months ago
Bilevel sparse coding for coupled feature spaces
In this paper, we propose a bilevel sparse coding model for coupled feature spaces, where we aim to learn dictionaries for sparse modeling in both spaces while enforcing some desi...
Jianchao Yang, Zhaowen Wang, Zhe Lin, Xianbiao Shu...
ICASSP
2011
IEEE
12 years 9 months ago
Recovery of sparse perturbations in Least Squares problems
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structure...
Mert Pilanci, Orhan Arikan
ECCV
2008
Springer
14 years 7 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....