The Kantorovich metric for probability measures on the circle

DOI10.1016/0377-0427(93)E0213-6zbMath0819.60001MaRDI QIDQ1893595

Ursula M. Molter, Carlos A. Cabrelli

Publication date: 4 July 1995

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

pattern recognition; probability metrics; Hutchinson distance; Kantorovich distance between probability measures on the circle; minimal matching problem; texture metrics

Mathematics Subject Classification ID

60B05: Probability measures on topological spaces

60A10: Probabilistic measure theory

Related Items

A linear time algorithm for a matching problem on the circle

Cites Work

• Weighted median algorithms for \(L_ 1\) approximation
• An algorithm for the computation of the Hutchinson distance
• A linear selection algorithm for sets of elements with weights
• The Wasserstein distance and approximation theorems
• Probability Metrics
• The Monge–Kantorovich Mass Transference Problem and Its Stochastic Applications
• Bipartite graph matching for points on a line or a circle
• Calculation of the Wasserstein Distance Between Probability Distributions on the Line
• Selecting the Kth Element in $X + Y$ and $X_1 + X_2 + \cdots + X_m $
• Mass transhipment problems and ideal metrics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item