Sciweavers

70 search results - page 12 / 14
» Learning Fourier Sparse Set Functions
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Efficient Euclidean projections in linear time
We consider the problem of computing the Euclidean projection of a vector of length n onto a closed convex set including the 1 ball and the specialized polyhedra employed in (Shal...
Jun Liu, Jieping Ye
PAMI
2010
168views more  PAMI 2010»
13 years 5 months ago
Surface-from-Gradients without Discrete Integrability Enforcement: A Gaussian Kernel Approach
—Representative surface reconstruction algorithms taking a gradient field as input enforces the integrability constraint in a discrete manner. While enforcing integrability allo...
Heung-Sun Ng, Tai-Pang Wu, Chi-Keung Tang
JMLR
2008
116views more  JMLR 2008»
13 years 7 months ago
Support Vector Machinery for Infinite Ensemble Learning
Ensemble learning algorithms such as boosting can achieve better performance by averaging over the predictions of some base hypotheses. Nevertheless, most existing algorithms are ...
Hsuan-Tien Lin, Ling Li
CVPR
2004
IEEE
14 years 9 months ago
Learning a Restricted Bayesian Network for Object Detection
Many classes of images have the characteristics of sparse structuring of statistical dependency and the presence of conditional independencies among various groups of variables. S...
Henry Schneiderman
BMCV
2000
Springer
13 years 12 months ago
The Spectral Independent Components of Natural Scenes
Abstract. We apply independent component analysis (ICA) for learning an efficient color image representation of natural scenes. In the spectra of single pixels, the algorithm was a...
Te-Won Lee, Thomas Wachtler, Terrence J. Sejnowski