Sciweavers

10 search results - page 1 / 2
» Fast nonparametric clustering with Gaussian blurring mean-sh...
Sort
View
CVPR
2008
IEEE
14 years 6 months ago
Generalised blurring mean-shift algorithms for nonparametric clustering
Gaussian blurring mean-shift (GBMS) is a nonparametric clustering algorithm, having a single bandwidth parameter that controls the number of clusters. The algorithm iteratively sh...
Miguel Á. Carreira-Perpiñán
ACCV
2009
Springer
13 years 11 months ago
Evolving Mean Shift with Adaptive Bandwidth: A Fast and Noise Robust Approach
Abstract. This paper presents a novel nonparametric clustering algorithm called evolving mean shift (EMS) algorithm. The algorithm iteratively shrinks a dataset and generates well ...
Qi Zhao, Zhi Yang, Hai Tao, Wentai Liu
JUCS
2010
265views more  JUCS 2010»
13 years 3 months ago
A General Framework for Multi-Human Tracking using Kalman Filter and Fast Mean Shift Algorithms
: The task of reliable detection and tracking of multiple objects becomes highly complex for crowded scenarios. In this paper, a robust framework is presented for multi-Human track...
Ahmed Ali, Kenji Terada
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