Given a set of patterns and a similarity measure between them, we would present an optimization framework to approximate a small subset, known as a canonical set, whose members closely resemble the members of the original set. We would present a combinatorial formulation of the canonical set problem in terms of quadratic optimization integer programming, present a relaxation through semidefinite programming, and propose a bounded performance rounding procedure for its approximation solution in polynomial time. Through a set of experiments we would investigate the application of canonical sets for computing a summary of views from a dense set of 2D views computed for a 3D object.
Approximation of canonical sets and their applications to 2D view simplification
2004-01-01
461212 byte
Conference paper
Electronic Resource
English
Approximation of Canonical Sets and Their Applications to 2D View Simplification
British Library Conference Proceedings | 2004
|A SIMPLIFICATION OF THE SECOND BORN APPROXIMATION
NTRS | 1961
|Extreme Simplification and Rendering of Point Sets using Algebraic Multigrid
BASE | 2005
|System simplification tools -- Airline engineer's view of SST reliability
Engineering Index Backfile | 1962
|Feature-Preserving Surface Reconstruction and Simplification from Defect-Laden Point Sets
British Library Online Contents | 2014
|