When a data set resides on a d-dimensional manifold that is not a subspace, linear methods cannot effectively reduce the data dimension. Nonlinear methods need to be applied in this case. In this chapter, we introduce Isomap method, which unfolds a manifold by keeping the geodesic metric on the original data set. The description of the method is given in Section 8.1, and the Isomap algorithm is presented in Section 8.2. In Section 8.3, we introduce Dijkstra’s algorithm that effectively computes graph distances. The experiments and applications of Isomaps are included in Section 8.4. We present the justification of Isomaps in Section 8.5.


Dimensionality Reduction Geodesic Distance Neighborhood Size Graph Distance Path Distance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    de Silva, V., Tenenbaum, J.B.: Global versus local methods in nonlinear dimensionality reduction. In: S. Becker, S. Thrun, K. Obermayer (eds.) Neural Information Processing Systems (NIPS 2002), pp. 705–712. MIT Press (2002).Google Scholar
  2. [2]
    Tenenbaum, J.B., de Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319–2323 (2000).CrossRefGoogle Scholar
  3. [3]
    Bachmann, C.M., Ainsworth, T.L., Fusina, R.A.: Exploiting manifold geometry in hyperspectral imagery. IEEE Trans. Geo. Remote Sensing 43(3), 441–454 (2005).CrossRefGoogle Scholar
  4. [4]
    Bachmann, C.M., Ainsworth, T.L., Fusina, R.A.: Improved manifold coordinate representations of large-scale hyperspectral scenes. IEEE Trans. Geo. Remote Sensing 44, 2786–2803 (2006).CrossRefGoogle Scholar
  5. [5]
    Bachmann, C.M., Ainsworth, T.L., Fusina, R.A., Montes, M.J., Bowles, J.H., Korwan, D.R., Gillis, L.: Bathymetric retrieval from hyperspectral imagery using manifold coordinate representations. IEEE Trans. Geo. Remote Sensing 47, 884–897 (2009).CrossRefGoogle Scholar
  6. [6]
    Balasubramanian, M., Schwartz, E.,: The isomap algorithm and topological stability. Science 295, 9 (2002).CrossRefGoogle Scholar
  7. [7]
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959).MathSciNetzbMATHCrossRefGoogle Scholar
  8. [8]
    Cailliez, F.: The analytical solution of the additive constant problem. Psychometrika 48(2), 305–308 (1983).MathSciNetzbMATHCrossRefGoogle Scholar
  9. [9]
    Kumar, V., Grama, A., Gupta, A., Karypis, G.: Introduction to Parallel Computing, Design and Analysis of Algorithms. The Benjamin/Cummings Publishing Company, Inc., California (1994).Google Scholar
  10. [10]
    Choi, H., Choi, S.: Robust kernel isomap. Pattern Recogn. 40.Google Scholar
  11. [11]
    Bernstein, M., de Silva, V., Langford, J., Tenenbaum, J.: Graph approximations to geodesics on embedded manifolds (2000).Google Scholar
  12. [12]
    Tenenbaum, J.B., de Silva, V., Langford, J.C.: Graph approximation to geodesics on embedded manifold (2000), Preprint.Google Scholar

Copyright information

© Higher Education Press, Beijing and Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Jianzhong Wang
    • 1
  1. 1.Department of Mathematics and StatisticsSam Houston State UniversityHuntsvilleUSA

Personalised recommendations