Sciweavers

671 search results - page 5 / 135
» Mean shift-based clustering
Sort
View
DAGM
2009
Springer
14 years 2 months ago
Fusing Time-of-Flight Depth and Color for Real-Time Segmentation and Tracking
Abstract. We present an improved framework for real-time segmentation and tracking by fusing depth and RGB color data. We are able to solve common problems seen in tracking and seg...
Amit Bleiweiss, Michael Werman
IJCNN
2008
IEEE
14 years 2 months ago
On the sample mean of graphs
— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
Brijnesh J. Jain, Klaus Obermayer
ICIC
2005
Springer
14 years 1 months ago
Methods of Decreasing the Number of Support Vectors via k-Mean Clustering
This paper proposes two methods which take advantage of k -mean clustering algorithm to decrease the number of support vectors (SVs) for the training of support vector machine (SVM...
Xiao-Lei Xia, Michael R. Lyu, Tat-Ming Lok, Guang-...
ICCV
2009
IEEE
1556views Computer Vision» more  ICCV 2009»
15 years 20 days ago
Kernel Methods for Weakly Supervised Mean Shift Clustering
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...
Oncel Tuzel, Fatih Porikli, Peter Meer
FOCS
2010
IEEE
13 years 5 months ago
Stability Yields a PTAS for k-Median and k-Means Clustering
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
Pranjal Awasthi, Avrim Blum, Or Sheffet