Results 11  20
of
9,712
Mean shift for graph bundling
, 2012
"... We present a fast and simple adaption of the wellknown mean shift technique for image segmentation to compute bundled layouts of general graphs. For this, we first transform a given graph drawing into a density map using kernel density estimation. Next, we apply the equivalent of mean shift segmen ..."
Abstract
 Add to MetaCart
We present a fast and simple adaption of the wellknown mean shift technique for image segmentation to compute bundled layouts of general graphs. For this, we first transform a given graph drawing into a density map using kernel density estimation. Next, we apply the equivalent of mean shift
Mean Shift Clustering
"... The mean shift algorithm is a nonparametric clustering technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of the clusters. Given n data points xi, i = 1,..., n on a ddimensional space Rd, the multivariate kernel density estimate obtained wit ..."
Abstract
 Add to MetaCart
The mean shift algorithm is a nonparametric clustering technique which does not require prior knowledge of the number of clusters, and does not constrain the shape of the clusters. Given n data points xi, i = 1,..., n on a ddimensional space Rd, the multivariate kernel density estimate obtained
Gaussian mean shift is an EM algorithm
 IEEE Trans. on Pattern Analysis and Machine Intelligence
, 2005
"... The meanshift algorithm, based on ideas proposed by Fukunaga and Hostetler (1975), is a hillclimbing algorithm on the density defined by a finite mixture or a kernel density estimate. Meanshift can be used as a nonparametric clustering method and has attracted recent attention in computer vision ..."
Abstract

Cited by 42 (4 self)
 Add to MetaCart
The meanshift algorithm, based on ideas proposed by Fukunaga and Hostetler (1975), is a hillclimbing algorithm on the density defined by a finite mixture or a kernel density estimate. Meanshift can be used as a nonparametric clustering method and has attracted recent attention in computer vision
Geodesic Mean Shift
, 2004
"... In this paper we introduce a versatile and robust method for analyzing the feature space associated with a given surface. The method is based on the meanshift operator which was shown to be successful in image and video processing. Its strength stems from the fact that it works in a single space of ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
In this paper we introduce a versatile and robust method for analyzing the feature space associated with a given surface. The method is based on the meanshift operator which was shown to be successful in image and video processing. Its strength stems from the fact that it works in a single space
Information theoretic mean shift algorithm
 In Proceedings of IEEE Conf. on Machine Learning for Signal Processing
"... In this paper we introduce a new cost function called Information Theoretic Mean Shift algorithm to capture the “predominant structure ” in the data. We formulate this problem with a cost function which minimizes the entropy of the data subject to the constraint that the CauchySchwartz distance bet ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
In this paper we introduce a new cost function called Information Theoretic Mean Shift algorithm to capture the “predominant structure ” in the data. We formulate this problem with a cost function which minimizes the entropy of the data subject to the constraint that the CauchySchwartz distance
� � � � � � � � � � � � � � Mean Shift � � � � � � � � � � � � � � � � �� � � � � � � � � � � � � � � � � [9]. � � � � � � � � � � � � � � � � � � � � � � 2��
"... mu � � ˆρ(p, q) = ˆpu · ˆqu (2) u=1 � � � � � � ˆqu = qu Pmu k=1 qk, ˆpu = pu Pmu k=1 pk. qu q � � p � � � � u � � � �. � � �� pu � � � � � � �� �mu k=1 qk �� �mu k=1 pk �� � � ��� � � � � � � � 2� � � � � � � � � � � � � � � � � � � � � � � � � � �� mu � √ ρ(p, q) = ..."
Abstract
 Add to MetaCart
mu � � ˆρ(p, q) = ˆpu · ˆqu (2) u=1 � � � � � � ˆqu = qu Pmu k=1 qk, ˆpu = pu Pmu k=1 pk. qu q � � p � � � � u � � � �. � � �� pu � � � � � � �� �mu k=1 qk �� �mu k=1 pk �� � � ��� � � � � � � � 2� � � � � � � � � � � � � � � � � � � � � � � � � � �� mu � √ ρ(p, q) =
Convergence of a Mean Shift Algorithm
"... Abstract: Mean shift is an effective iterative algorithm widely used in clustering, tracking, segmentation, discontinuity preserving smoothing, filtering, edge detection, and information fusion etc. However, its convergence, a key property of any iterative method, has not been rigorously proved till ..."
Abstract
 Add to MetaCart
Abstract: Mean shift is an effective iterative algorithm widely used in clustering, tracking, segmentation, discontinuity preserving smoothing, filtering, edge detection, and information fusion etc. However, its convergence, a key property of any iterative method, has not been rigorously proved
Image and Video Segmentation by Anisotropic Kernel Mean Shift
 In Proc. ECCV
, 2004
"... Mean shift is a nonparametric estimator of density which has been applied to image and video segmentation. Traditional mean shift based segmentation uses a radially symmetric kernel to estimate local density, which is not optimal in view of the often structured nature of image and more particula ..."
Abstract

Cited by 68 (1 self)
 Add to MetaCart
Mean shift is a nonparametric estimator of density which has been applied to image and video segmentation. Traditional mean shift based segmentation uses a radially symmetric kernel to estimate local density, which is not optimal in view of the often structured nature of image and more
Adaptive Mean ShiftBased Clustering
"... Abstract. This report proposes an adaptive mean shift clustering algorithm. Its application is demonstrated for simulated data, by finding old clusters which are highly overlapping. The obtained clustering result is actually close to an estimated upper bound, derived for those simulated data elsewhe ..."
Abstract
 Add to MetaCart
Abstract. This report proposes an adaptive mean shift clustering algorithm. Its application is demonstrated for simulated data, by finding old clusters which are highly overlapping. The obtained clustering result is actually close to an estimated upper bound, derived for those simulated data
(IDETC). Fast Mean Shift by Compact Density Representation
"... clustering, fast algorithm, mean shift, sampling ..."
Results 11  20
of
9,712