Computing the orthographic projection aspect graph of solids of revolution
Pattern Recognition Letters
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
SIAM Review
Matrix computations (3rd ed.)
On View Likelihood and Stability
IEEE Transactions on Pattern Analysis and Machine Intelligence
Semidefinite programming in combinatorial optimization
Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Shock Graphs and Shape Matching
International Journal of Computer Vision
Derandomizing Approximation Algorithms Based on Semidefinite Programming
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
IEEE Transactions on Pattern Analysis and Machine Intelligence
Many-to-many graph matching via metric embedding
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
International Journal of Computer Vision
Canonical subsets of image features
Computer Vision and Image Understanding
Volume composition and evaluation using eye-tracking data
ACM Transactions on Applied Perception (TAP)
Combining different types of scale space interest points using canonical sets
SSVM'07 Proceedings of the 1st international conference on Scale space and variational methods in computer vision
Stable bounded canonical sets and image matching
EMMCVPR'05 Proceedings of the 5th international conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Volume composition using eye tracking data
EUROVIS'06 Proceedings of the Eighth Joint Eurographics / IEEE VGTC conference on Visualization
| Hi-index | 0.00 |
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.