A transportation \(L^p\) distance for signal analysis
From MaRDI portal
Publication:1703946
DOI10.1007/s10851-017-0726-4zbMath1391.94415arXiv1609.08669OpenAlexW2525755238WikidataQ63978742 ScholiaQ63978742MaRDI QIDQ1703946
Gustavo K. Rohde, Dejan Slepčev, Soheil Kolouri, Matthew Thorpe, Se Rim Park
Publication date: 8 March 2018
Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.08669
Related Items (16)
A Maximum Principle Argument for the Uniform Convergence of Graph Laplacian Regressors ⋮ Generalized unnormalized optimal transport and its fast algorithms ⋮ Large data limit for a phase transition model with the p-Laplacian on point clouds ⋮ Stochastic approximation versus sample average approximation for Wasserstein barycenters ⋮ The signed cumulative distribution transform for 1-D signal analysis and classification ⋮ Semi-discrete optimal transport: hardness, regularization and numerical solution ⋮ On the Gamma convergence of functionals defined over pairs of measures and energy-measures ⋮ Equivalence relations and \(L^p\) distances between time series with application to the black summer Australian bushfires ⋮ Rates of convergence for Laplacian semi-supervised learning with low labeling rates ⋮ A graph space optimal transport distance as a generalization of L p distances: application to a seismic imaging inverse problem ⋮ HV geometry for signal comparison ⋮ Properly-weighted graph Laplacian for semi-supervised learning ⋮ An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud ⋮ Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems ⋮ Analysis of $p$-Laplacian Regularization in Semisupervised Learning ⋮ Transfer operators from optimal transport plans for coherent set detection
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuum limit of total variation on point clouds
- A fitness-driven cross-diffusion system from population dynamics as a gradient flow
- A sparse multiscale algorithm for dense optimal transport
- Conformal Wasserstein distances: comparing surfaces in polynomial time
- A class of Cartesian grid embedded boundary algorithms for incompressible flow with time-varying complex geometries
- The cumulative distribution transform and linear pattern classification
- A continuous linear optimal transport approach for pattern analysis in image datasets
- A new optimal transport distance on the space of finite Radon measures
- Image labeling by assignment
- Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures
- An interpolating distance between optimal transport and Fisher-Rao metrics
- The earth mover's distance as a metric for image retrieval
- A linear optimal transportation framework for quantifying and visualizing variations in sets of images
- Scale space and variational methods in computer vision. 4th international conference, SSVM 2013, Schloss Seggau, Leibnitz, Austria, June 2--6, 2013. Proceedings
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- Sliced and Radon Wasserstein barycenters of measures
- Exact histogram specification for digital images using a variational approach
- Application of optimal transportation theory to the reconstruction of the early Universe
- Optimal mass transport for registration and warping
- Nonmetric multidimensional scaling. A numerical method
- Landmark matching via large deformation diffeomorphisms
- Convolutional wasserstein distances
- Non-convex Relaxation of Optimal Transport for Color Transfer Between Images
- Optimal Transport in Competition with Reaction: The Hellinger--Kantorovich Distance and Geodesic Curves
- An Efficient Numerical Method for the Solution of the $L_2$ Optimal Mass Transfer Problem
- Scaling algorithms for unbalanced optimal transport problems
- A sparse algorithm for dense optimal transport
- Multi-physics optimal transportation and image interpolation
- On the Application of the Monge–Kantorovich Problem to Image Registration
- Computational anatomy: an emerging discipline
- The Radon Cumulative Distribution Transform and Its Application to Image Classification
- Earth mover's distances on discrete surfaces
- Matrix Optimal Mass Transport: A Quantum Mechanical Approach
- Imaging with Kantorovich--Rubinstein Discrepancy
- Interpolation of matrices and matrix-valued densities: The unbalanced case
- Iterative Bregman Projections for Regularized Transportation Problems
- Image Editing With Spatiograms Transfer
- Letters to the Editor—Extension of Dantzig's Algorithm to Finding an Initial Near-Optimal Basis for the Transportation Problem
- Convex Analysis
- Optimal Transport
This page was built for publication: A transportation \(L^p\) distance for signal analysis
