Sciweavers

84 search results - page 14 / 17
» Gradient-Based Methods for Sparse Recovery
Sort
View
ICML
2010
IEEE
15 years 3 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
ECCV
2008
Springer
16 years 4 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....
136
Voted
ML
2002
ACM
167views Machine Learning» more  ML 2002»
15 years 1 months ago
Linear Programming Boosting via Column Generation
We examine linear program (LP) approaches to boosting and demonstrate their efficient solution using LPBoost, a column generation based simplex method. We formulate the problem as...
Ayhan Demiriz, Kristin P. Bennett, John Shawe-Tayl...
CORR
2010
Springer
127views Education» more  CORR 2010»
15 years 2 months ago
Analysis of Basis Pursuit Via Capacity Sets
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
Joseph Shtok, Michael Elad
ICIP
2008
IEEE
15 years 8 months ago
Compressed sensing for multi-view tracking and 3-D voxel reconstruction
Compressed sensing(CS) suggests that a signal, sparse in some basis, can be recovered from a small number of random projections. In this paper, we apply the CS theory on sparse ba...
Dikpal Reddy, Aswin C. Sankaranarayanan, Volkan Ce...