Sciweavers

174 search results - page 2 / 35
» Algorithms for center and Tverberg points
Sort
View
ICPR
2010
IEEE
13 years 3 months ago
On Dynamic Weighting of Data in Clustering with K-Alpha Means
Although many methods of refining initialization have appeared, the sensitivity of K-Means to initial centers is still an obstacle in applications. In this paper, we investigate a...
Sibao Chen, Haixian Wang, Bin Luo
JMIV
2010
105views more  JMIV 2010»
13 years 4 months ago
Degeneracy of the Linear Seventeen-Point Algorithm for Generalized Essential Matrix
Abstract In estimating motions of multi-centered optical systems using the generalized camera model, one can use the linear seventeen-point algorithm for obtaining a generalized es...
Jun-Sik Kim, Takeo Kanade
JCSS
2002
199views more  JCSS 2002»
13 years 5 months ago
A Constant-Factor Approximation Algorithm for the k-Median Problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
Moses Charikar, Sudipto Guha, Éva Tardos, D...
FGR
2011
IEEE
176views Biometrics» more  FGR 2011»
12 years 9 months ago
Prop-free pointing detection in dynamic cluttered environments
Abstract—Vision-based prop-free pointing detection is challenging both from an algorithmic and a systems standpoint. From a computer vision perspective, accurately determining wh...
Pyry Matikainen, Padmanabhan Pillai, Lily B. Mumme...
DCG
1998
80views more  DCG 1998»
13 years 5 months ago
Fitting a Set of Points by a Circle
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
Jesus Garcia-Lopez, Pedro A. Ramos, Jack Snoeyink