Sciweavers

268 search results - page 2 / 54
» Shape Fitting on Point Sets with Probability Distributions
Sort
View
DCG
2008
93views more  DCG 2008»
13 years 6 months ago
Robust Shape Fitting via Peeling and Grating Coresets
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
PSIVT
2007
Springer
203views Multimedia» more  PSIVT 2007»
14 years 8 days ago
Direct Ellipse Fitting and Measuring Based on Shape Boundaries
: Measuring ellipticity is an important area of computer vision systems. Most existing ellipticity measures are area based and cannot be easily applied to point sets such as extrac...
Milos Stojmenovic, Amiya Nayak
ALGORITHMICA
2008
79views more  ALGORITHMICA 2008»
13 years 6 months ago
Practical Methods for Shape Fitting and Kinetic Data Structures using Coresets
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
Hai Yu, Pankaj K. Agarwal, Raghunath Poreddy, Kast...
COMPGEOM
2003
ACM
13 years 11 months ago
High-dimensional shape fitting in linear time
Let P be a set of n points in Rd. The radius of a k-dimensional flat F with respect to P, denoted by RD(F, P), is defined to be maxp∈P dist(F, p), where dist(F, p) denotes the...
Sariel Har-Peled, Kasturi R. Varadarajan
NIPS
2000
13 years 7 months ago
A Support Vector Method for Clustering
We present a novel method for clustering using the support vector machine approach. Data points are mapped to a high dimensional feature space, where support vectors are used to d...
Asa Ben-Hur, David Horn, Hava T. Siegelmann, Vladi...