Image Manifolds which are Isometric to Euclidean Space
- 245 Downloads
Recently, the Isomap procedure  was proposed as a new way to recover a low-dimensional parametrization of data lying on a low-dimensional submanifold in high-dimensional space. The method assumes that the submanifold, viewed as a Riemannian submanifold of the ambient high-dimensional space, is isometric to a convex subset of Euclidean space. This naturally raises the question: what datasets can reasonably be modeled by this condition? In this paper, we consider a special kind of image data: families of images generated by articulation of one or several objects in a scene—for example, images of a black disk on a white background with center placed at a range of locations. The collection of all images in such an articulation family, as the parameters of the articulation vary, makes up an articulation manifold, a submanifold of L2. We study the properties of such articulation manifolds, in particular, their lack of differentiability when the images have edges. Under these conditions, we show that there exists a natural renormalization of geodesic distance which yields a well-defined metric. We exhibit a list of articulation models where the corresponding manifold equipped with this new metric is indeed isometric to a convex subset of Euclidean space. Examples include translations of a symmetric object, rotations of a closed set, articulations of a horizon, and expressions of a cartoon face.
The theoretical predictions from our study are borne out by empirical experiments with published Isomap code. We also note that in the case where several components of the image articulate independently, isometry may fail; for example, with several disks in an image avoiding contact, the underlying Riemannian manifold is locally isometric to an open, connected, but not convex subset of Euclidean space. Such a situation matches the assumptions of our recently-proposed Hessian Eigenmaps procedure, but not the original Isomap procedure.
KeywordsIsomap multidimensional scaling manifolds of articulated images isometry
Unable to display preview. Download preview PDF.
- 1.P.N. Belhumeur and D.J. Kriegman, “What is the set of images of an object under all possible illumination conditions?” International Journal of Computer Vision, Vol. 28, No. 3, pp. 1–16, 1998.Google Scholar
- 2.T.F. Cox and M.A.A. Cox, Multidimensional Scaling, Chapman, Hall, 1994.Google Scholar
- 3.D.L. Donoho and C. Grimes, “When does Isomap recover the true parametrization of manifolds of articulated images?” Department of Statistics, Stanford University, Technical Report TR2002-27, 2002.Google Scholar
- 4.D. Donoho and C. Grimes, “Hessian Eigenmaps: Locally linear embedding techniques for high-dimensional data,” Proceedings of the National Academy of Sciences, Vol. 100, No. 10, pp. 5591–5596, 2003.Google Scholar
- 5.A. Gray, Tubes, Addison-Wesley, 1990.Google Scholar
- 6.C. Grimes, “New Methods in Nonlinear Dimensionality Reduction,” PhD, Department of Statistics, Stanford University, Stanford, CA, 2003.Google Scholar
- 7.K.V. Mardia, J.T. Kent, and J.M. Bibby, Multivariate Analysis, Academic Press: Harcourt Brace, 1979.Google Scholar
- 8.S. Nayar, S. Baker, and H. Murase, “Parametric feature detection,” in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, San Francisco, California, 1996, pp. 471–477.Google Scholar
- 9.S.T. Roweis and L.K. Saul, “Nonlinear dimensionality analysis by locally linear embedding,” Science, Vol. 290, No. 5500, pp. 2323–2326, 2003.Google Scholar
- 10.J.B. Tenenbaum, V. de Silva, and J.C. Langford. “A global geometric framework for nonlinear dimensionality reduction,” Science, Vol. 290, No. 5500, pp. 2319–2323, 2000.Google Scholar