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...
— 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 ...
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-...
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...
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...