216 search results - page 2 / 44 » Multiple kernel learning from sets of partially matching ima... |
DAGM
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Approximations based on random Fourier features have recently emerged as an efficient and elegant methodology for designing large-scale kernel machines [4]. By expressing...
CVPR
2008
IEEE
13 years 12 months ago
2008
IEEE
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
ESANN
2006
13 years 6 months ago
2006
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
CVPR
2009
IEEE
15 years 17 days ago
2009
IEEE
Latent Variable Models (LVM), like the Shared-GPLVM
and the Spectral Latent Variable Model, help mitigate over-
fitting when learning discriminative methods from small or
modera...
ICPR
2010
IEEE
13 years 3 months ago
2010
IEEE
Previous Multiple Kernel Learning approaches (MKL) employ different kernels by their linear combination. Though some improvements have been achieved over methods using single kerne...