Abstract
Nonlinear dimensionality reduction (NLDR) algorithms such as Isomap, LLE, and Laplacian Eigenmaps address the problem of representing high-dimensional nonlinear data in terms of low-dimensional coordinates which represent the intrinsic structure of the data. This paradigm incorporates the assumption that real-valued coordinates provide a rich enough class of functions to represent the data faithfully and efficiently. On the other hand, there are simple structures which challenge this assumption: the circle, for example, is one-dimensional, but its faithful representation requires two real coordinates. In this work, we present a strategy for constructing circle-valued functions on a statistical data set. We develop a machinery of persistent cohomology to identify candidates for significant circle-structures in the data, and we use harmonic smoothing and integration to obtain the circle-valued coordinate functions themselves. We suggest that this enriched class of coordinate functions permits a precise NLDR analysis of a broader range of realistic data sets.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Belkin, M., Niyogi, P.: Laplacian eigenmaps and spectral techniques for embedding and clustering. In: Diettrich, T., Becker, S., Ghahramani, Z. (eds.) Advances in Neural Information Processing Systems 14, pp. 585–591. MIT Press, Cambridge (2002)
Cox, T.F., Cox, M.A.A.: Multidimensional Scaling. Chapman & Hall, London (1994)
de Silva, V., Carlsson, G.: Topological estimation using witness complexes. In: Alexa, M., Rusinkiewicz, S. (eds.) Eurographics Symposium on Point-Based Graphics, ETH, Zürich (2004)
Dixon, M., Jacobs, N., Pless, R.: Finding minimal parameterizations of cylindrical image manifolds. In: CVPRW’06: Proc. 2006 Conference on Computer Vision and Pattern Recognition Workshop, Washington, DC, USA, p. 192. IEEE Computer Society, Los Alamitos (2006)
Donoho, D.L., Grimes, C.: Hessian eigenmaps: new locally linear embedding techniques for high-dimensional data. Technical Report TR 2003-08, Department of Statistics, Stanford University (2003)
Edelsbrunner, H., Harer, J.: Persistent homology—a survey. In: Goodman, J.E., Pach, J., Pollack, R. (eds.) Surveys on Discrete and Computational Geometry: Twenty Years Later. Contemporary Mathematics, vol. 453, pp. 257–282. American Mathematical Society, Providence (2008)
Edelsbrunner, H., Letscher, D., Zomorodian, A.: Topological persistence and simplification. Discrete Comput. Geom. 28, 511–533 (2002)
Ghrist, R.: Barcodes: the persistent topology of data. Bull. Am. Math. Soc. 45(1), 61–75 (2008)
Guibas, L.J., Oudot, S.Y.: Reconstruction using witness complexes. In: Proc. 18th ACM–SIAM Symposium on Discrete Algorithms, pp. 1076–1085 (2007)
Hatcher, A.: Algebraic Topology. Cambridge University Press, Cambridge (2002)
Lee, J.A., Verleysen, M.: Nonlinear dimensionality reduction of data manifolds with essential loops. Neurocomputing 67, 29–53 (2005)
Morozov, D.: Dionysus library for computing persistent homology. http://www.mrzv.org/software/dionysus/
Paige, C.C., Saunders, M.A.: LSQR: sparse equations and least squares. http://www.stanford.edu/group/SOL/software/lsqr.html
Paige, C.C., Saunders, M.A.: LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Softw. 8(1), 43–71 (1982)
Pless, R., Simon, I.: Embedding images in non-flat spaces. In: Conference on Imaging Science Systems and Technology, pp. 182–188 (2002)
Roweis, S., Saul, L.: Nonlinear dimensionality reduction by locally linear embedding. Science 290, 2323–2326 (2000)
Sexton, H., Vejdemo-Johansson, M.: jPlex simplicial complex library. http://comptop.stanford.edu/programs/jplex/
Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290, 2319–2323 (2000)
Zomorodian, A., Carlsson, G.: Computing persistent homology. Discrete Comput. Geom. 33(2), 249–274 (2005)
Author information
Authors and Affiliations
Corresponding author
Additional information
V. de Silva was partially supported by DARPA, through grants HR0011-05-1-0007 (TDA) and HR0011-07-1-0002 (SToMP). The author holds a Digiteo Chair.
M. Vejdemo-Johansson was partially supported by the Office of Naval Research, through grant N00014-08-1-0931.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
de Silva, V., Morozov, D. & Vejdemo-Johansson, M. Persistent Cohomology and Circular Coordinates. Discrete Comput Geom 45, 737–759 (2011). https://doi.org/10.1007/s00454-011-9344-x
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-011-9344-x