Spectral multidimensional scaling
From MaRDI portal
Abstract: Multidimensional scaling (MDS) is a family of methods that embed a given set of points into a simple, usually flat, domain. The points are assumed to be sampled from some metric space, and the mapping attempts to preserve the distances between each pair of points in the set. Distances in the target space can be computed analytically in this setting. Generalized MDS is an extension that allows mapping one metric space into another, that is, multidimensional scaling into target spaces in which distances are evaluated numerically rather than analytically. Here, we propose an efficient approach for computing such mappings between surfaces based on their natural spectral decomposition, where the surfaces are treated as sampled metric-spaces. The resulting spectral-GMDS procedure enables efficient embedding by implicitly incorporating smoothness of the mapping into the problem, thereby substantially reducing the complexity involved in its solution while practically overcoming its non-convex nature. The method is compared to existing techniques that compute dense correspondence between shapes. Numerical experiments of the proposed method demonstrate its efficiency and accuracy compared to state-of-the-art approaches.
Recommendations
- An analysis of classical multidimensional scaling with applications to clustering
- Multigrid multidimensional scaling
- Subspace Least Squares Multidimensional Scaling
- Multidimensional scaling of noisy high dimensional data
- Geometric multidimensional scaling: a new approach for data dimensionality reduction
Cites work
- A linear-space algorithm for distance preserving graph embedding
- Computing geodesic paths on manifolds
- Diffusion maps
- Embedding Riemannian manifolds by their heat kernel
- Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
- Multigrid multidimensional scaling
- Nonlinear dimensionality reduction by topologically constrained isometric embedding
- Ramifications, old and new, of the eigenvalue problem
Cited in
(6)- On convex relaxation of graph isomorphism
- On the optimality of shape and data representation in the spectral domain
- Non-rigid Shape Correspondence Using Surface Descriptors and Metric Structures in the Spectral Domain
- Curvature in image and shape processing
- Making sense of big data
- Subspace Least Squares Multidimensional Scaling
This page was built for publication: Spectral multidimensional scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5170977)
