Sciweavers

13 search results - page 2 / 3
» Computation of Initial Modes for K-modes Clustering Algorith...
Sort
View
ICMLA
2008
13 years 6 months ago
Farthest Centroids Divisive Clustering
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
Haw-ren Fang, Yousef Saad
ICCV
2009
IEEE
14 years 10 months ago
Mode-Detection via Median-Shift
Median-shift is a mode seeking algorithm that relies on computing the median of local neighborhoods, instead of the mean. We further combine median-shift with Locality Sensitive...
Lior Shapira, Shai Avidan, Ariel Shamir
PR
2008
228views more  PR 2008»
13 years 4 months ago
Accurate integration of multi-view range images using k-means clustering
3D modelling finds a wide range of applications in industry. However, due to the presence of surface scanning noise, accumulative registration errors, and improper data fusion, re...
Hong Zhou, Yonghuai Liu
SPIEVIP
2010
13 years 7 months ago
Automatic scene activity modeling for improving object classification
In video surveillance, automatic methods for scene understanding and activity modeling can exploit the high redundancy of object trajectories observed over a long period of time. ...
Samuel Foucher, Marc Lalonde, Langis Gagnon
ICCV
2007
IEEE
14 years 7 months ago
Articulated Shape Matching Using Locally Linear Embedding and Orthogonal Alignment
In this paper we propose a method for matching articulated shapes represented as large sets of 3D points by aligning the corresponding embedded clouds generated by locally linear ...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...