Sciweavers

12 search results - page 2 / 3
» Kernel Methods for Weakly Supervised Mean Shift Clustering
Sort
View
ECCV
2002
Springer
14 years 7 months ago
Robust Computer Vision through Kernel Density Estimation
Abstract. Two new techniques based on nonparametric estimation of probability densities are introduced which improve on the performance of equivalent robust methods currently emplo...
Haifeng Chen, Peter Meer
CVPR
2005
IEEE
14 years 7 months ago
Applying Neighborhood Consistency for Fast Clustering and Kernel Density Estimation
Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper, we combine th...
Kai Zhang, Ming Tang, James T. Kwok
CVPR
2008
IEEE
14 years 7 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
ICPR
2006
IEEE
14 years 6 months ago
Adaptive Feature Integration for Segmentation of 3D Data by Unsupervised Density Estimation
In this paper, a novel unsupervised approach for the segmentation of unorganized 3D points sets is proposed. The method derives by the mean shift clustering paradigm devoted to se...
Marco Cristani, Umberto Castellani, Vittorio Murin...
ICANN
2009
Springer
13 years 10 months ago
Bayesian Estimation of Kernel Bandwidth for Nonparametric Modelling
Kernel density estimation (KDE) has been used in many computational intelligence and computer vision applications. In this paper we propose a Bayesian estimation method for findin...
Adrian G. Bors, Nikolaos Nasios