14 search results - page 1 / 3 » Quick Shift and Kernel Methods for Mode Seeking |
ECCV
2008
Springer
14 years 6 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...
ICCV
2005
IEEE
13 years 10 months ago
2005
IEEE
We address the problem of seeking the global mode of a density function using the mean shift algorithm. Mean shift, like other gradient ascent optimisation methods, is susceptible...
CVPR
2009
IEEE
15 years 6 hour ago
2009
IEEE
As a well known fixed-point iteration algorithm for kernel
density mode-seeking, Mean-Shift has attracted wide attention
in pattern recognition field. To date, Mean-Shift algorit...
ICCV
2007
IEEE
14 years 6 months ago
2007
IEEE
Theoretical understanding and extension of mean shift procedure has received much attention recently [8, 18, 3]. In this paper, we present a theoretical exploration and an algorit...
ICCV
2009
IEEE
14 years 10 months 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...