Sparse Approximation via Generating Point Sets
نویسندگان
چکیده
منابع مشابه
Sparse Approximation via Generating Point Sets
For a set P of n points in the unit ball b ⊆ Rd, consider the problem of finding a small subset T ⊆ P such that its convex-hull ε-approximates the convex-hull of the original set. Specifically, the Hausdorff distance between the convex hull of T and the convex hull of P should be at most ε. We present an efficient algorithm to compute such an ε′-approximation of size kalg, where ε′ is a functio...
متن کاملRobust Nonparametric Data Approximation of Point Sets via Data Reduction
In this paper we present a novel non-parametric method of simplifying piecewise linear curves and we apply this method as a statistical approximation of structure within sequential data in the plane. We consider the problem of minimizing the average length of sequences of consecutive input points that lie on any one side of the simplified curve. Specifically, given a sequence P of n points in t...
متن کاملPolygonal Approximation of Point Sets
Our domain of interest is polygonal (and polyhedral) approximation of point sets. Neither the order of data points nor the number of needed line segments (surface patches) are known. In particular, point sets can be obtained by laser range scanner mounted on a moving robot or given as edge pixels/voxels in digital images. Polygonal approximation of edge pixels can also be interpreted as groupin...
متن کاملFace Classification via Sparse Approximation
We address the problem of 2D face classification under adverse conditions. Faces are difficult to recognize since they are highly variable due to such factors as illumination, expression, pose, occlusion and resolution. We investigate the potential of a method where the face recognition problem is cast as a sparse approximation. The sparse approximation provides a significant amount of robustne...
متن کاملGeometric Approximation via Core Sets
The paradigm of core-sets has recently emerged as a powerful tool for efficiently approximating various extent measures of a point set . Using this paradigm, one quickly computes a small subset of , called a core-set, that approximates the original set and solves the problem on using a relatively inefficient algorithm. The solution for is then translated to an approximate solution to the origin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2019
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3302249