Sciweavers

35 search results - page 1 / 7
» Efficient Mean-shift Clustering Using Gaussian KD-Tree
Sort
View
CGF
2010
171views more  CGF 2010»
13 years 1 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu
PAMI
2007
253views more  PAMI 2007»
13 years 4 months ago
Gaussian Mean-Shift Is an EM Algorithm
The mean-shift algorithm, based on ideas proposed by Fukunaga and Hostetler (1975), is a hill-climbing algorithm on the density defined by a finite mixture or a kernel density e...
Miguel Á. Carreira-Perpiñán
ECCV
2008
Springer
14 years 6 months ago
Edge-Preserving Smoothing and Mean-Shift Segmentation of Video Streams
Video streams are ubiquitous in applications such as surveillance, games, and live broadcast. Processing and analyzing these data is challenging because algorithms have to be effic...
Sylvain Paris
ICIP
2006
IEEE
14 years 6 months ago
Acoustic Range Image Segmentation by Effective Mean Shift
Image perception in underwater environment is a difficult task for a human operator, and data segmentation becomes a crucial step toward an higher level interpretation and recogni...
Umberto Castellani, Marco Cristani, Vittorio Murin...
SSPR
1998
Springer
13 years 8 months ago
Distribution Free Decomposition of Multivariate Data
: We present a practical approach to nonparametric cluster analysis of large data sets. The number of clusters and the cluster centres are automatically derived by mode seeking wit...
Dorin Comaniciu, Peter Meer