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.
Unsupervised learning of image manifolds by semidefinite programming
2004-01-01
610775 byte
Conference paper
Electronic Resource
English
Unsupervised Learning of Image Manifolds by Semidefinite Programming
British Library Online Contents | 2006
|Unsupervised Learning of Image Manifolds by Semidefinite Programming
British Library Conference Proceedings | 2004
|Multiclass Image Labeling with Semidefinite Programming
British Library Conference Proceedings | 2006
|