Nonlinear dimensionality reduction by topologically constrained isometric embedding
From MaRDI portal
Publication:408807
DOI10.1007/s11263-010-0322-1zbMath1477.68489OpenAlexW2167769608MaRDI QIDQ408807
Alexander M. Bronstein, Michael M. Bronstein, Ron Kimmel, Guy Rosman
Publication date: 12 April 2012
Published in: International Journal of Computer Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11263-010-0322-1
Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Differential geometric aspects of statistical manifolds and information geometry (53B12)
Related Items (8)
Multi-manifold discriminant Isomap for visualization and classification ⋮ LRA: local rigid averaging of stretchable non-rigid shapes ⋮ Novel parameter-free and parametric same degree distribution-based dimensionality reduction algorithms for trustworthy data structure preserving ⋮ Reconstruction and interpolation of manifolds. I: The geometric Whitney problem ⋮ Diffusion pruning for rapidly and robustly selecting global correspondences using local isometry ⋮ Spectral multidimensional scaling ⋮ Densifying distance spaces for shape and image retrieval ⋮ Parallel Transport Unfolding: A Connection-Based Manifold Learning Approach
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- Convergence of the majorization method for multidimensional scaling
- Robust kernel Isomap
- Boundary measures for geometric inference
- Clustering to minimize the maximum intercluster distance
- Efficient implementation of minimal polynomial and reduced rank extrapolation methods
- Convergence acceleration for the iterative solution of the equations X = AX + f
- The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newtons Method
- Modern multidimensional scaling: theory and applications
- Three-dimensional boundary detection for particle methods
- A general nonmetric technique for finding the smallest coordinate space for a configuration of points
- Lectures on Modern Convex Optimization
- Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
- Multigrid multidimensional scaling
- A Best Possible Heuristic for the k-Center Problem
- Extrapolation Methods for Vector Sequences
- Computing geodesic paths on manifolds
- A Polynomial Extrapolation Method for Finding Limits and Antilimits of Vector Sequences
- Generalized multidimensional scaling: A framework for isometry-invariant partial surface matching
- Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
- On a connection between kernel PCA and metric multidimensional scaling
This page was built for publication: Nonlinear dimensionality reduction by topologically constrained isometric embedding
