mlsanityData to 7 Oct 2026

Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning

arXiv 2204.06645 ↗First posted 13 Apr 2022cs.LG cs.CV stat.MLcited by 15

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose Wasserstein Isometric Mapping (Wassmap), a nonlinear dimensionality reduction technique that provides solutions to some drawbacks in existing global nonlinear dimensionality reduction algorithms in imaging applications. Wassmap represents images via probability measures in Wasserstein space, then uses pairwise Wasserstein distances between the associated measures to produce a low-dimensional, approximately isometric embedding. We show that the algorithm is able to exactly recover parameters of some image manifolds including those generated by translations or dilations of a fixed generating measure. Additionally, we show that a discrete version of the algorithm retrieves parameters from manifolds generated from discrete measures by providing a theoretical bridge to transfer recovery results from functional data to discrete data. Testing of the proposed algorithms on various image data manifolds show that Wassmap yields good embeddings compared with other global and local techniques.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 17 of its 67 references that are in the map. First posted on arXiv 13 Apr 2022.

Builds on

17 of 67 references.

References · 17

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2018Computational Optimal Transportcited by 765
  3. 2019Generalized Sliced Wasserstein Distancescited by 205
  4. 2013Revisiting the Nystrom Method for Improved Large-Scale Machine Learningcited by 76
  5. 2016Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problemscited by 69
  6. 2018Massively scalable Sinkhorn distances via the Nystr"om methodcited by 40
  7. 2020Linear Optimal Transport Embedding: Provable Wasserstein classification for certain rigid transformations and perturbationscited by 37
  8. 2019On the Efficiency of Entropic Regularized Algorithms for Optimal Transportcited by 34
  9. 2015The Radon cumulative distribution transform and its application to image classificationcited by 28
  10. 2015The Cumulative Distribution Transform and Linear Pattern Classificationcited by 19
  11. 2017Multiscale Strategies for Computing Optimal Transportcited by 18
  12. 2015A Sparse Multi-Scale Algorithm for Dense Optimal Transportcited by 16
5 more
  1. 2020Partitioning signal classes using transport transforms for data analysis and machine learningcited by 15
  2. 2021Wasserstein Proximal of GANscited by 15
  3. 2022Supervised learning of sheared distributions using linearized optimal transportcited by 14
  4. 2020Manifold learning with arbitrary normscited by 10
  5. 2020Domain decomposition for entropy regularized optimal transportcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 3; 2023: 6; 2024: 0; 2025: 5; 2026: 1.

15 papers.

Sort: