10 search results - page 1 / 2 » High-dimensional shape fitting in linear time |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
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...
DICTA
2003
13 years 6 months ago
2003
An algebraic curve is defined as the zero set of a multivariate polynomial. We consider the problem of fitting an algebraic curve to a set of vectors given an additional set of v...
COMPGEOM
2003
ACM
13 years 10 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
ECCV
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. Fitting parameterized 3D shape and general reflectance models to 2D image data is challenging due to the high dimensionality of the problem. The proposed method combines ...