240 search results - page 22 / 48 » The Kernel Trick for Distances |
IVC
2007
13 years 7 months ago
2007
This article presents the use of anisotropic dynamic structuring elements, or amoebas, in order to build content-aware noise reduction filters. The amoeba is the ball defined by ...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
ICCV
2009
IEEE
15 years 19 days ago
2009
IEEE
Mean shift clustering is a powerful unsupervised data
analysis technique which does not require prior knowledge
of the number of clusters, and does not constrain the shape
of th...
WACV
2012
IEEE
12 years 3 months ago
2012
IEEE
A convenient way of analysing Riemannian manifolds is to embed them in Euclidean spaces, with the embedding typically obtained by flattening the manifold via tangent spaces. This...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...