33 search results - page 2 / 7 » Semigroup Kernels on Finite Sets |
ICIP
2005
IEEE
14 years 9 months ago
2005
IEEE
In this paper, we propose new sampling schemes for classes of 2-D signals with finite rate of innovation (FRI). In particular, we consider sets of 2-D Diracs and bilevel polygons....
JMLR
2010
13 years 2 months ago
2010
Appropriate selection of the kernel function, which implicitly defines the feature space of an algorithm, has a crucial role in the success of kernel methods. In this paper, we co...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Most modern computer vision systems for high-level
tasks, such as image classification, object recognition and
segmentation, are based on learning algorithms that are
able to se...
TRECVID
2008
13 years 9 months ago
2008
We studied a method using support vector machines (SVMs) with walk-based graph kernels for the high-level feature extraction (HLF) task. In this method, each image is first segmen...
DAGM
2010
Springer
13 years 8 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...