Sciweavers

220 search results - page 24 / 44
» SMOS L1 algorithms
Sort
View
ECCV
2008
Springer
14 years 9 months ago
A Linear Time Histogram Metric for Improved SIFT Matching
We present a new metric between histograms such as SIFT descriptors and a linear time algorithm for its computation. It is common practice to use the L2 metric for comparing SIFT d...
Ofir Pele, Michael Werman
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
14 years 8 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler
CVPR
2010
IEEE
14 years 3 months ago
Learning Shift-Invariant Sparse Representation of Actions
A central problem in the analysis of motion capture (Mo- Cap) data is how to decompose motion sequences into primitives. Ideally, a description in terms of primitives should fac...
Yi Li
PKDD
2009
Springer
88views Data Mining» more  PKDD 2009»
14 years 2 months ago
Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
Huyen Do, Alexandros Kalousis, Melanie Hilario
CVPR
2008
IEEE
14 years 9 months ago
Robust tensor factorization using R1 norm
Over the years, many tensor based algorithms, e.g. two dimensional principle component analysis (2DPCA), two dimensional singular value decomposition (2DSVD), high order SVD, have...
Heng Huang, Chris H. Q. Ding