Spectral Generalized Multi-Dimensional Scaling

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.

References in corpus (1)

• Spectral Generalized Multi-Dimensional Scaling

Cited by in corpus (18)

• Spectral Generalized Multi-Dimensional Scaling
• Outlier Detection and Optimal Anchor Placement for 3D Underwater Optical Wireless Sensor Networks Localization
• ZoomOut: Spectral Upsampling for Efficient Shape Correspondence
• Manifold Learning in Atomistic Simulations: A Conceptual Review
• Graph matching: relax or not?
• Continuous and Orientation-preserving Correspondences via Functional Maps
• Product Manifold Filter: Non-Rigid Shape Correspondence via Kernel Density Estimation in the Product Space
• MapTree: Recovering Multiple Solutions in the Space of Maps
• Divergence-Free Shape Interpolation and Correspondence
• BiFold visualization of bipartite datasets
• Subspace Least Squares Multidimensional Scaling
• Dimension Reduction with Prior Information for Knowledge Discovery
• On the optimality of shape and data representation in the spectral domain
• Shape-from-intrinsic operator
• Geodesic Distance Descriptors
• Efficient Inter-Geodesic Distance Computation and Fast Classical Scaling
• Efficient, sparse representation of manifold distance matrices for classical scaling
• Functional Maps Representation on Product Manifolds