Sciweavers

214 search results - page 19 / 43
» Computing the Closest Point to a Circle
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
How to get close to the median shape
In this paper, we study the problem of L1-fitting a shape to a set of point, where the target is to minimize the sum of distances of the points to the shape, or alternatively the...
Sariel Har-Peled
ICPR
2010
IEEE
14 years 1 months ago
Geodesic Thin Plate Splines for Image Segmentation
Thin Plate Splines are often used in image registration to model deformations. Its physical analogy involves a thin lying sheet of metal that is deformed and forced to pass throug...
Herve Lombaert, Farida Cheriet
PR
2008
132views more  PR 2008»
13 years 7 months ago
Measuring linearity of planar point sets
Our goal is to design algorithms that give a linearity measure for planar point sets. There is no explicit discussion on linearity in literature, although some existing shape meas...
Milos Stojmenovic, Amiya Nayak, Jovisa D. Zunic
COMGEO
2007
ACM
13 years 7 months ago
Geometric dilation of closed planar curves: New lower bounds
Given two points on a closed planar curve, C, we can divide the length of a shortest connecting path in C by their Euclidean distance. The supremum of these ratios, taken over all...
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Kl...
CVPR
1999
IEEE
14 years 9 months ago
A Novel Bayesian Method for Fitting Parametric and Non-Parametric Models to Noisy Data
We o er a simple paradigm for tting models, parametric and non-parametric, to noisy data, which resolves some of the problems associated with classic MSE algorithms. This is done ...
Michael Werman, Daniel Keren