Quantifying the noise sensitivity of the Wasserstein metric for images
Not on the map. Why?
Abstract (arXiv)
Wasserstein metrics are increasingly adopted as similarity scores for images. We consider the sensitivity of Wasserstein metrics with respect to pixel-wise additive noise when the images are treated as discrete measures on the pixel grid. We derive finite-sample expectation bounds for a Gaussian noise model. Among other results, we prove that the error in the signed 2-Wasserstein discrepancy scales with the square root of the noise standard deviation. This is favorable compared to the Euclidean metric that scales linearly, and thus provides a theoretical basis for the benefits of optimal transport distances in noisy settings. We present experiments that support our theoretical findings and point to a peculiar phenomenon where increasing the level of noise can decrease the Wasserstein distance. A case study on cryo-electron microscopy images demonstrates that the Wasserstein metric can capture the geometry of the data manifold in high noise settings even when the Euclidean metric fails.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 43 references that are in the map. First posted on arXiv 1 Oct 2025.
Builds on
21 of 43 references.
References · 21
- 2022Flow Matching for Generative Modelingcited by 5,426
- 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,550
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2022Building Normalizing Flows with Stochastic Interpolantscited by 964
- 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 835
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
- 2016Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problemscited by 69
- 2024Conditional Wasserstein Distances with Applications in Bayesian OT Flow Matchingcited by 34
- 2016DOTmark - A Benchmark for Discrete Optimal Transportcited by 15
- 2025Flow Matching with Semidiscrete Couplingscited by 12
- 2016A Transportation Lp Distance for Signal Analysiscited by 11
9 more
- 2021Fast and Scalable Optimal Transport for Brain Tractogramscited by 11
- 2020Manifold learning with arbitrary normscited by 10
- 2025On Fitting Flow Models with Large Sinkhorn Couplingscited by 10
- 2023Alignment of Density Maps in Wasserstein Distancecited by 8
- 2022AlignOT: An optimal transport based algorithm for fast 3D alignment with applications to cryogenic electron microscopy density mapscited by 7
- 2024A New Robust Partial p-Wasserstein-Based Metric for Comparing Distributionscited by 7
- 2020Wasserstein K-Means for Clustering Tomographic Projectionscited by 6
- 2025Fast rigid alignment of heterogeneous images in sliced Wasserstein distancecited by 4
- 2025Sharp Convergence Rates of Empirical Unbalanced Optimal Transport for Spatio-Temporal Point Processescited by 1
Built on by
Not cited yet.