Abstract
Isometric feature mapping is an established time-honored algorithm in manifold learning and non-linear dimensionality reduction. Its prominence can be attributed to the output of a coherent global low-dimensional representation of data by preserving intrinsic distances. In order to enable an efficient and more applicable isometric feature mapping, a diverse set of sophisticated advancements have been proposed to the original algorithm to incorporate important factors like sparsity of computation, conformality, topological constraints and spectral geometry. However, a significant shortcoming of most approaches is the dependence on large-scale dense-spectral decompositions and the inability to generalize to points far away from the sampling of the manifold. In this paper, we explore an unsupervised deep learning approach for computing distance-preserving maps for non-linear dimensionality reduction. We demonstrate that our framework is general enough to incorporate all previous advancements and show a significantly improved local and non-local generalization of the isometric mapping. Our approach involves training with only a few landmark points and avoids the need for population of dense matrices as well as computing their spectral decomposition.
Original language | English |
---|---|
Article number | 104461 |
Journal | Image and Vision Computing |
Volume | 123 |
DOIs | |
State | Published - Jul 2022 |
Keywords
- Manifold learning
- Multidimensional scaling
- Neural networks
- Non-linear dimensionality reduction
All Science Journal Classification (ASJC) codes
- Signal Processing
- Computer Vision and Pattern Recognition