Name
Abstract | ||
|---|---|---|
Given a set of patterns and a similarity measure between them, we will 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 will 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 will investigate the application of canonical sets for computing a summary of views from a dense set of 2D views computed for a 3D object. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/CVPR.2004.1315212 | CVPR (2) |
Keywords | Field | DocType |
bounded performance,canonical set,optimization framework,quadratic optimization integer programming,original set,dense set,approximation solution,semidefinite programming,view simplification,combinatorial formulation,canonical set problem,polynomial time,quadratic optimization,integer programming,set theory,quadratic programming | Set theory,Discrete mathematics,Quadratically constrained quadratic program,Active set method,Computer science,Randomized rounding,Quadratic programming,Semidefinite programming,Bounded function,Special ordered set | Conference |
ISSN | Citations | PageRank |
1063-6919 | 12 | 1.38 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Trip Denton | 1 | 107 | 8.47 |
| Jeff Abrahamson | 2 | 48 | 6.07 |
| A. Shokoufandeh | 3 | 1356 | 88.63 |