2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2 Approximation of Canonical Sets and Their Applications to 2D View Simplification Washington, D.C., USA June 27-July 02 ISBN: 0-7695-2158-4
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CVPR.2004.35
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.
Citation:
Trip Denton, Jeff Abrahamson, Ali Shokoufandeh, "Approximation of Canonical Sets and Their Applications to 2D View Simplification," cvpr, vol. 2, pp.550-557, 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'04) - Volume 2, 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb