Can we detect low dimensional structure in high dimensional data sets of images and video? The problem of dimensionality reduction arises often in computer vision and pattern recognition. In this paper, we propose a new solution to this problem based on semidefinite programming. Our algorithm can be used to analyze high dimensional data that lies on or near a low dimensional manifold. It overcomes certain limitations of previous work in manifold learning, such as Isomap and locally linear embedding. We illustrate the algorithm on easily visualized examples of curves and surfaces, as well as on actual images of faces, handwritten digits, and solid objects.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Unsupervised learning of image manifolds by semidefinite programming


    Contributors:


    Publication date :

    2004-01-01


    Size :

    610775 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Unsupervised Learning of Image Manifolds by Semidefinite Programming

    Weinberger, K. Q. / Saul, L. K. | British Library Online Contents | 2006


    Unsupervised Learning of Image Manifolds by Semidefinite Programming

    Weinberger, K. / Saul, L. / IEEE Computer Society | British Library Conference Proceedings | 2004


    Multiclass Image Labeling with Semidefinite Programming

    Keuchel, Jens | Springer Verlag | 2006

    Free access

    Multiclass Image Labeling with Semidefinite Programming

    Keuchel, J. | British Library Conference Proceedings | 2006


    Recursive Inertia Estimation with Semidefinite Programming

    Manchester, Zachary R. / Peck, Mason A. | AIAA | 2017