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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Approximation of canonical sets and their applications to 2D view simplification


    Contributors:


    Publication date :

    2004-01-01


    Size :

    461212 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Approximation of Canonical Sets and Their Applications to 2D View Simplification

    Denton, T. / Abrahamson, J. / Shokoufandeh, A. et al. | British Library Conference Proceedings | 2004


    A SIMPLIFICATION OF THE SECOND BORN APPROXIMATION

    Moiseiwitsch, B. L. | NTRS | 1961


    Extreme Simplification and Rendering of Point Sets using Algebraic Multigrid

    Reniers, Dennie / Telea, Alexandru | BASE | 2005

    Free access