Sciweavers

42 search results - page 3 / 9
» A Linear Subspace Learning Approach via Sparse Coding
Sort
View
ICASSP
2011
IEEE
12 years 9 months ago
Denoising of image patches via sparse representations with learned statistical dependencies
We address the problem of denoising for image patches. The approach taken is based on Bayesian modeling of sparse representations, which takes into account dependencies between th...
Tomer Faktor, Yonina C. Eldar, Michael Elad
ICCV
2009
IEEE
14 years 10 months ago
Sparse Representation of Cast Shadows via L1-Regularized Least Squares
Scenes with cast shadows can produce complex sets of images. These images cannot be well approximated by lowdimensional linear subspaces. However, in this paper we show that the...
Xue Mei, Haibin Ling, David W. Jacobs
JMLR
2010
154views more  JMLR 2010»
13 years 17 days ago
Infinite Predictor Subspace Models for Multitask Learning
Given several related learning tasks, we propose a nonparametric Bayesian model that captures task relatedness by assuming that the task parameters (i.e., predictors) share a late...
Piyush Rai, Hal Daumé III
TCSV
2008
195views more  TCSV 2008»
13 years 5 months ago
Locality Versus Globality: Query-Driven Localized Linear Models for Facial Image Computing
Conventional subspace learning or recent feature extraction methods consider globality as the key criterion to design discriminative algorithms for image classification. We demonst...
Yun Fu, Zhu Li, Junsong Yuan, Ying Wu, Thomas S. H...
JMLR
2006
124views more  JMLR 2006»
13 years 5 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...