A linear optimal transportation framework for quantifying and visualizing variations in sets of images
From MaRDI portal
Publication:1943417
DOI10.1007/s11263-012-0566-zzbMath1259.68222OpenAlexW2094100343WikidataQ41224437 ScholiaQ41224437MaRDI QIDQ1943417
Wei Wang, Gustavo K. Rohde, Dejan Slepčev, John A. Ozolek, Saurav Basu
Publication date: 20 March 2013
Published in: International Journal of Computer Vision (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc3667970
Related Items (32)
Applications of optimal transportation in the natural sciences. Abstracts from the workshop held February 21--27, 2021 (online meeting) ⋮ A Framework for Wasserstein-1-Type Metrics ⋮ The signed cumulative distribution transform for 1-D signal analysis and classification ⋮ A sparse multiscale algorithm for dense optimal transport ⋮ Entropical optimal transport, Schrödinger's system and algorithms ⋮ Limit laws for empirical optimal solutions in random linear programs ⋮ The cumulative distribution transform and linear pattern classification ⋮ A continuous linear optimal transport approach for pattern analysis in image datasets ⋮ Globally optimal joint image segmentation and shape matching based on Wasserstein modes ⋮ Convergence Analysis of Volumetric Stretch Energy Minimization and Its Associated Optimal Mass Transport ⋮ Transport type metrics on the space of probability measures involving singular base measures ⋮ Unbalanced multi-marginal optimal transport ⋮ Learning to generate Wasserstein barycenters ⋮ Ellipsoidal conformal and area-/volume-preserving parameterizations and associated optimal mass transportations ⋮ Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning ⋮ Low-Rank Tensor Approximations for Solving Multimarginal Optimal Transport Problems ⋮ Quantum Wasserstein isometries on the qubit state space ⋮ Quantitative stability of optimal transport maps under variations of the target measure ⋮ Applications of No-Collision Transportation Maps in Manifold Learning ⋮ A transportation \(L^p\) distance for signal analysis ⋮ Geodesic PCA versus Log-PCA of Histograms in the Wasserstein Space ⋮ Simple approximative algorithms for free-support Wasserstein barycenters ⋮ Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure ⋮ A sparse algorithm for dense optimal transport ⋮ Fréchet means and Procrustes analysis in Wasserstein space ⋮ Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning ⋮ Hybrid Wasserstein distance and fast distribution clustering ⋮ Radon cumulative distribution transform subspace modeling for image classification ⋮ Partitioning signal classes using transport transforms for data analysis and machine learning ⋮ Least action principles for incompressible flows and geodesics between shapes ⋮ Supervised learning of sheared distributions using linearized optimal transport ⋮ The Linearized Hellinger--Kantorovich Distance
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial \(L^1\) Monge-Kantorovich problem: variational formulation and numerical approximation
- The earth mover's distance as a metric for image retrieval
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- Optimal mass transport for registration and warping
- Computing large deformation metric mappings via geodesic flows of diffeomorphisms
- An Efficient Numerical Method for the Solution of the $L_2$ Optimal Mass Transfer Problem
- On the Implementation of a Primal-Dual Interior Point Method
- Minimizing Flows for the Monge--Kantorovich Problem
- Least squares quantization in PCM
- Generalized Monge–Kantorovich Optimization for Grid Generation and Adaptation in $L_{p}$
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
This page was built for publication: A linear optimal transportation framework for quantifying and visualizing variations in sets of images
