Sciweavers

76 search results - page 9 / 16
» Optimal In-Place Learning and the Lobe Component Analysis
Sort
View
KDD
2004
ACM
187views Data Mining» more  KDD 2004»
14 years 8 months ago
IMMC: incremental maximum margin criterion
Subspace learning approaches have attracted much attention in academia recently. However, the classical batch algorithms no longer satisfy the applications on streaming data or la...
Jun Yan, Benyu Zhang, Shuicheng Yan, Qiang Yang, H...
ICIP
2005
IEEE
14 years 9 months ago
Visual tracking via efficient kernel discriminant subspace learning
Robustly tracking moving objects in video sequences is one of the key problems in computer vision. In this paper we introduce a computationally efficient nonlinear kernel learning...
Chunhua Shen, Anton van den Hengel, Michael J. Bro...
ICML
2003
IEEE
14 years 8 months ago
The Pre-Image Problem in Kernel Methods
In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applicatio...
James T. Kwok, Ivor W. Tsang
ICPR
2000
IEEE
14 years 2 days ago
Eigensnakes for Vessel Segmentation in Angiography
In this paper we introduce a new deformable model, called eigensnake, for segmentation of elongated structures in a probabilistic framework. Instead of snake attraction by speciď¬...
Ricardo Toledo, Xavier Orriols, Petia Radeva, Xavi...
JMLR
2010
195views more  JMLR 2010»
13 years 6 months ago
Online Learning for Matrix Factorization and Sparse Coding
Sparse coding—that is, modelling data vectors as sparse linear combinations of basis elements—is widely used in machine learning, neuroscience, signal processing, and statisti...
Julien Mairal, Francis Bach, Jean Ponce, Guillermo...